./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-simple/sll2n_remove_all_reverse_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa 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/list-simple/sll2n_remove_all_reverse_true-unreach-call_true-valid-memsafety.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 13cb8f020c937b6a3b0b6c39b85904cffb8b3ba5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 19:38:35,398 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 19:38:35,400 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 19:38:35,412 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 19:38:35,412 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 19:38:35,413 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 19:38:35,415 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 19:38:35,424 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 19:38:35,426 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 19:38:35,427 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 19:38:35,428 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 19:38:35,428 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 19:38:35,429 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 19:38:35,430 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 19:38:35,432 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 19:38:35,432 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 19:38:35,433 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 19:38:35,435 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 19:38:35,437 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 19:38:35,439 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 19:38:35,440 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 19:38:35,442 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 19:38:35,444 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 19:38:35,444 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 19:38:35,445 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 19:38:35,446 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 19:38:35,447 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 19:38:35,448 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 19:38:35,449 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 19:38:35,450 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 19:38:35,451 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 19:38:35,451 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 19:38:35,452 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 19:38:35,452 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 19:38:35,453 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 19:38:35,454 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 19:38:35,454 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 19:38:35,470 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 19:38:35,471 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 19:38:35,472 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 19:38:35,472 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 19:38:35,472 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 19:38:35,473 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 19:38:35,473 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 19:38:35,474 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 19:38:35,474 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 19:38:35,474 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 19:38:35,474 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 19:38:35,474 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 19:38:35,474 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 19:38:35,475 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 19:38:35,475 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 19:38:35,475 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 19:38:35,475 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 19:38:35,475 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 19:38:35,476 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 19:38:35,477 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 19:38:35,477 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 19:38:35,477 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 19:38:35,478 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 19:38:35,478 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 19:38:35,478 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 19:38:35,478 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 19:38:35,478 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 -> 13cb8f020c937b6a3b0b6c39b85904cffb8b3ba5 [2019-01-01 19:38:35,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 19:38:35,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 19:38:35,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 19:38:35,543 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 19:38:35,544 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 19:38:35,544 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-simple/sll2n_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-01 19:38:35,621 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c90220008/abb75aa6799e444ab2d0a2ac94f66607/FLAGad8dc3876 [2019-01-01 19:38:36,200 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 19:38:36,201 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-simple/sll2n_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-01 19:38:36,220 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c90220008/abb75aa6799e444ab2d0a2ac94f66607/FLAGad8dc3876 [2019-01-01 19:38:36,397 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c90220008/abb75aa6799e444ab2d0a2ac94f66607 [2019-01-01 19:38:36,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 19:38:36,403 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 19:38:36,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 19:38:36,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 19:38:36,408 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 19:38:36,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:38:36" (1/1) ... [2019-01-01 19:38:36,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1089083f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:36, skipping insertion in model container [2019-01-01 19:38:36,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:38:36" (1/1) ... [2019-01-01 19:38:36,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 19:38:36,471 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 19:38:36,902 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:38:36,927 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 19:38:37,093 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:38:37,164 INFO L195 MainTranslator]: Completed translation [2019-01-01 19:38:37,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:37 WrapperNode [2019-01-01 19:38:37,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 19:38:37,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 19:38:37,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 19:38:37,167 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 19:38:37,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:37" (1/1) ... [2019-01-01 19:38:37,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:37" (1/1) ... [2019-01-01 19:38:37,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:37" (1/1) ... [2019-01-01 19:38:37,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:37" (1/1) ... [2019-01-01 19:38:37,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:37" (1/1) ... [2019-01-01 19:38:37,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:37" (1/1) ... [2019-01-01 19:38:37,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:37" (1/1) ... [2019-01-01 19:38:37,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 19:38:37,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 19:38:37,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 19:38:37,250 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 19:38:37,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:37" (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-01 19:38:37,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 19:38:37,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 19:38:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 19:38:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 19:38:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-01 19:38:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-01-01 19:38:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-01-01 19:38:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_remove_last [2019-01-01 19:38:37,319 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 19:38:37,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 19:38:37,320 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 19:38:37,320 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 19:38:37,320 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 19:38:37,320 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 19:38:37,320 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 19:38:37,321 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 19:38:37,321 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 19:38:37,322 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 19:38:37,322 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 19:38:37,322 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 19:38:37,322 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 19:38:37,322 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 19:38:37,322 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 19:38:37,323 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 19:38:37,323 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 19:38:37,323 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 19:38:37,323 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 19:38:37,323 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 19:38:37,323 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 19:38:37,323 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 19:38:37,323 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 19:38:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 19:38:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 19:38:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 19:38:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 19:38:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 19:38:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 19:38:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 19:38:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 19:38:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 19:38:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 19:38:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 19:38:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 19:38:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 19:38:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 19:38:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 19:38:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 19:38:37,328 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 19:38:37,329 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 19:38:37,329 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 19:38:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 19:38:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 19:38:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 19:38:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 19:38:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 19:38:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 19:38:37,330 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 19:38:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 19:38:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 19:38:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 19:38:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 19:38:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 19:38:37,331 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 19:38:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 19:38:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 19:38:37,334 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 19:38:37,334 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 19:38:37,334 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 19:38:37,334 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 19:38:37,334 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 19:38:37,334 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-01 19:38:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 19:38:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 19:38:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-01 19:38:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 19:38:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 19:38:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-01 19:38:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 19:38:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 19:38:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 19:38:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 19:38:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 19:38:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 19:38:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 19:38:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 19:38:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 19:38:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 19:38:37,339 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 19:38:37,339 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 19:38:37,339 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 19:38:37,339 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 19:38:37,339 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 19:38:37,339 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 19:38:37,339 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 19:38:37,339 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 19:38:37,341 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 19:38:37,341 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 19:38:37,342 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 19:38:37,342 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 19:38:37,342 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 19:38:37,342 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 19:38:37,342 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 19:38:37,342 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 19:38:37,342 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 19:38:37,342 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 19:38:37,344 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 19:38:37,344 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 19:38:37,344 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 19:38:37,344 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 19:38:37,344 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 19:38:37,344 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 19:38:37,344 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 19:38:37,344 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 19:38:37,345 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 19:38:37,345 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 19:38:37,346 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-01 19:38:37,346 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-01-01 19:38:37,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 19:38:37,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 19:38:37,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 19:38:37,346 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-01-01 19:38:37,346 INFO L130 BoogieDeclarations]: Found specification of procedure sll_remove_last [2019-01-01 19:38:37,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 19:38:37,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 19:38:37,347 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 19:38:37,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 19:38:37,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-01 19:38:37,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 19:38:37,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 19:38:37,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 19:38:38,407 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 19:38:38,407 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-01 19:38:38,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:38:38 BoogieIcfgContainer [2019-01-01 19:38:38,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 19:38:38,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 19:38:38,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 19:38:38,412 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 19:38:38,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 07:38:36" (1/3) ... [2019-01-01 19:38:38,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211e510d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:38:38, skipping insertion in model container [2019-01-01 19:38:38,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:37" (2/3) ... [2019-01-01 19:38:38,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211e510d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:38:38, skipping insertion in model container [2019-01-01 19:38:38,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:38:38" (3/3) ... [2019-01-01 19:38:38,417 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-01 19:38:38,428 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 19:38:38,438 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-01-01 19:38:38,457 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-01-01 19:38:38,491 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 19:38:38,492 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 19:38:38,492 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 19:38:38,493 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 19:38:38,493 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 19:38:38,493 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 19:38:38,493 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 19:38:38,493 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 19:38:38,494 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 19:38:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2019-01-01 19:38:38,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 19:38:38,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:38,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:38:38,532 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:38,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:38,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2025219408, now seen corresponding path program 1 times [2019-01-01 19:38:38,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:38,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:38,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:38,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:38,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:38,780 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-01 19:38:38,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:38:38,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:38:38,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:38:38,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:38:38,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:38:38,810 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2019-01-01 19:38:39,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:38:39,063 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2019-01-01 19:38:39,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:38:39,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-01 19:38:39,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:38:39,075 INFO L225 Difference]: With dead ends: 88 [2019-01-01 19:38:39,075 INFO L226 Difference]: Without dead ends: 81 [2019-01-01 19:38:39,077 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-01 19:38:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-01 19:38:39,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-01 19:38:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-01 19:38:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2019-01-01 19:38:39,125 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 13 [2019-01-01 19:38:39,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:38:39,125 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2019-01-01 19:38:39,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:38:39,126 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2019-01-01 19:38:39,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 19:38:39,126 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:39,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:38:39,127 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:39,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:39,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2025219409, now seen corresponding path program 1 times [2019-01-01 19:38:39,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:39,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:39,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:39,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:39,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:39,234 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-01 19:38:39,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:38:39,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:38:39,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:38:39,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:38:39,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:38:39,237 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 3 states. [2019-01-01 19:38:39,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:38:39,409 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-01 19:38:39,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:38:39,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-01 19:38:39,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:38:39,414 INFO L225 Difference]: With dead ends: 79 [2019-01-01 19:38:39,414 INFO L226 Difference]: Without dead ends: 79 [2019-01-01 19:38:39,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01 19:38:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-01 19:38:39,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-01 19:38:39,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-01 19:38:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2019-01-01 19:38:39,441 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 13 [2019-01-01 19:38:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:38:39,442 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2019-01-01 19:38:39,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:38:39,442 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2019-01-01 19:38:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 19:38:39,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:39,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:38:39,446 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:39,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:39,447 INFO L82 PathProgramCache]: Analyzing trace with hash -39903579, now seen corresponding path program 1 times [2019-01-01 19:38:39,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:39,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:39,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:39,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:39,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:39,644 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-01 19:38:39,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:38:39,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 19:38:39,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 19:38:39,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 19:38:39,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 19:38:39,646 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 4 states. [2019-01-01 19:38:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:38:39,811 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2019-01-01 19:38:39,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 19:38:39,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-01 19:38:39,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:38:39,816 INFO L225 Difference]: With dead ends: 82 [2019-01-01 19:38:39,816 INFO L226 Difference]: Without dead ends: 82 [2019-01-01 19:38:39,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:38:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-01 19:38:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-01-01 19:38:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-01 19:38:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-01-01 19:38:39,831 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 15 [2019-01-01 19:38:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:38:39,833 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-01-01 19:38:39,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 19:38:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-01-01 19:38:39,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 19:38:39,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:39,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:38:39,835 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:39,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:39,836 INFO L82 PathProgramCache]: Analyzing trace with hash 307504148, now seen corresponding path program 1 times [2019-01-01 19:38:39,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:39,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:39,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:39,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:39,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:40,012 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-01 19:38:40,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:38:40,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:38:40,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:38:40,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:38:40,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:38:40,014 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2019-01-01 19:38:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:38:40,488 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2019-01-01 19:38:40,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:38:40,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-01 19:38:40,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:38:40,493 INFO L225 Difference]: With dead ends: 123 [2019-01-01 19:38:40,493 INFO L226 Difference]: Without dead ends: 123 [2019-01-01 19:38:40,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:38:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-01 19:38:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 87. [2019-01-01 19:38:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-01 19:38:40,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2019-01-01 19:38:40,505 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 17 [2019-01-01 19:38:40,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:38:40,505 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2019-01-01 19:38:40,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:38:40,506 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2019-01-01 19:38:40,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 19:38:40,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:40,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:38:40,508 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:40,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:40,508 INFO L82 PathProgramCache]: Analyzing trace with hash 307504149, now seen corresponding path program 1 times [2019-01-01 19:38:40,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:40,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:40,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:40,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:40,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:40,575 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-01 19:38:40,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:38:40,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:38:40,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:38:40,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:38:40,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:38:40,577 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 5 states. [2019-01-01 19:38:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:38:40,627 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-01-01 19:38:40,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:38:40,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-01 19:38:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:38:40,635 INFO L225 Difference]: With dead ends: 89 [2019-01-01 19:38:40,635 INFO L226 Difference]: Without dead ends: 86 [2019-01-01 19:38:40,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:38:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-01 19:38:40,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2019-01-01 19:38:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-01 19:38:40,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2019-01-01 19:38:40,648 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 17 [2019-01-01 19:38:40,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:38:40,648 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2019-01-01 19:38:40,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:38:40,652 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2019-01-01 19:38:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 19:38:40,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:40,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:38:40,655 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:40,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:40,656 INFO L82 PathProgramCache]: Analyzing trace with hash 123258323, now seen corresponding path program 1 times [2019-01-01 19:38:40,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:40,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:40,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:40,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:40,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:40,804 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-01 19:38:40,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:38:40,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:38:40,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:38:40,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:38:40,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:38:40,807 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 6 states. [2019-01-01 19:38:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:38:41,127 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2019-01-01 19:38:41,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:38:41,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-01 19:38:41,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:38:41,130 INFO L225 Difference]: With dead ends: 79 [2019-01-01 19:38:41,131 INFO L226 Difference]: Without dead ends: 79 [2019-01-01 19:38:41,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:38:41,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-01 19:38:41,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-01-01 19:38:41,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-01 19:38:41,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-01-01 19:38:41,139 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 19 [2019-01-01 19:38:41,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:38:41,139 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-01-01 19:38:41,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:38:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-01-01 19:38:41,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 19:38:41,140 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:41,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:38:41,141 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:41,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:41,141 INFO L82 PathProgramCache]: Analyzing trace with hash 123258324, now seen corresponding path program 1 times [2019-01-01 19:38:41,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:41,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:41,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:41,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:41,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:41,430 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-01 19:38:41,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:38:41,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:38:41,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:38:41,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:38:41,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:38:41,432 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 6 states. [2019-01-01 19:38:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:38:41,923 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-01-01 19:38:41,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:38:41,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-01 19:38:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:38:41,926 INFO L225 Difference]: With dead ends: 78 [2019-01-01 19:38:41,926 INFO L226 Difference]: Without dead ends: 78 [2019-01-01 19:38:41,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:38:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-01 19:38:41,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-01-01 19:38:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-01 19:38:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-01-01 19:38:41,936 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 19 [2019-01-01 19:38:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:38:41,937 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-01-01 19:38:41,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:38:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-01-01 19:38:41,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 19:38:41,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:41,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:38:41,940 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:41,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:41,940 INFO L82 PathProgramCache]: Analyzing trace with hash -616890411, now seen corresponding path program 1 times [2019-01-01 19:38:41,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:41,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:41,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:41,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:41,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:38:42,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:38:42,041 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-01 19:38:42,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:42,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:38:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:38:42,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:38:42,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 19:38:42,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:38:42,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:38:42,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:38:42,185 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 6 states. [2019-01-01 19:38:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:38:42,277 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-01-01 19:38:42,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:38:42,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-01-01 19:38:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:38:42,279 INFO L225 Difference]: With dead ends: 91 [2019-01-01 19:38:42,280 INFO L226 Difference]: Without dead ends: 88 [2019-01-01 19:38:42,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:38:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-01 19:38:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2019-01-01 19:38:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-01 19:38:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-01-01 19:38:42,286 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 30 [2019-01-01 19:38:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:38:42,287 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-01-01 19:38:42,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:38:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-01-01 19:38:42,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-01 19:38:42,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:42,288 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:38:42,289 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:42,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:42,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1002767796, now seen corresponding path program 2 times [2019-01-01 19:38:42,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:42,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:42,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:42,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:42,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:43,269 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 19:38:43,382 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:38:43,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:38:43,382 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-01 19:38:43,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:38:43,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 19:38:43,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:38:43,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:38:43,496 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 6 treesize of output 5 [2019-01-01 19:38:43,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:38:43,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:38:43,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 19:38:43,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:38:43,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:38:43,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:38:43,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-01 19:38:43,937 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |c_old(#valid)| |node_create_#t~malloc2.base| 1) |c_#valid|) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|))) is different from true [2019-01-01 19:38:44,459 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (< |c_#StackHeapBarrier| v_prenex_1) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|) (= (store (store |c_old(#valid)| |node_create_#t~malloc2.base| 1) v_prenex_1 1) |c_#valid|))) is different from true [2019-01-01 19:38:44,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:38:44,485 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-01 19:38:44,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:38:44,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-01 19:38:44,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:38:44,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:38:44,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:38:44,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:26 [2019-01-01 19:38:44,708 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2019-01-01 19:38:44,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:38:44,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2019-01-01 19:38:44,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 19:38:44,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 19:38:44,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=171, Unknown=2, NotChecked=54, Total=272 [2019-01-01 19:38:44,739 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 17 states. [2019-01-01 19:38:46,324 WARN L181 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-01-01 19:38:47,539 WARN L181 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 10 [2019-01-01 19:38:53,352 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 30 DAG size of output: 13 [2019-01-01 19:38:57,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:38:57,595 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-01-01 19:38:57,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 19:38:57,596 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2019-01-01 19:38:57,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:38:57,598 INFO L225 Difference]: With dead ends: 133 [2019-01-01 19:38:57,598 INFO L226 Difference]: Without dead ends: 133 [2019-01-01 19:38:57,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=105, Invalid=388, Unknown=21, NotChecked=86, Total=600 [2019-01-01 19:38:57,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-01 19:38:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2019-01-01 19:38:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-01 19:38:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-01-01 19:38:57,609 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 43 [2019-01-01 19:38:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:38:57,610 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-01-01 19:38:57,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 19:38:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-01-01 19:38:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-01 19:38:57,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:57,612 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:38:57,613 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:57,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:57,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1002767797, now seen corresponding path program 1 times [2019-01-01 19:38:57,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:57,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:57,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:57,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:38:57,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-01 19:38:58,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:38:58,136 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-01 19:38:58,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:58,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:38:58,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 19:38:58,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:38:58,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:38:58,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-01 19:38:58,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:38:58,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:38:58,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:38:58,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-01 19:38:58,773 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |c_old(#length)| |node_create_#t~malloc2.base| 8) |c_#length|) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|))) is different from true [2019-01-01 19:38:59,343 WARN L181 SmtUtils]: Spent 454.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 19:38:59,825 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int) (sll_create_~new_head~0.base Int)) (and (= (store (store |c_old(#length)| |node_create_#t~malloc2.base| 8) sll_create_~new_head~0.base 8) |c_#length|) (< |c_#StackHeapBarrier| sll_create_~new_head~0.base) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|))) is different from true [2019-01-01 19:38:59,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:38:59,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:38:59,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-01 19:38:59,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:38:59,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2019-01-01 19:38:59,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:38:59,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:38:59,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:38:59,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2019-01-01 19:39:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 14 not checked. [2019-01-01 19:39:00,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:39:00,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 16 [2019-01-01 19:39:00,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 19:39:00,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 19:39:00,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=173, Unknown=2, NotChecked=54, Total=272 [2019-01-01 19:39:00,178 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 17 states. [2019-01-01 19:39:02,178 WARN L181 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2019-01-01 19:39:06,502 WARN L181 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2019-01-01 19:39:08,622 WARN L181 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 10 [2019-01-01 19:39:13,768 WARN L181 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2019-01-01 19:39:17,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:17,299 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2019-01-01 19:39:17,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 19:39:17,300 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2019-01-01 19:39:17,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:17,303 INFO L225 Difference]: With dead ends: 141 [2019-01-01 19:39:17,303 INFO L226 Difference]: Without dead ends: 141 [2019-01-01 19:39:17,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=98, Invalid=395, Unknown=21, NotChecked=86, Total=600 [2019-01-01 19:39:17,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-01 19:39:17,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 122. [2019-01-01 19:39:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-01 19:39:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2019-01-01 19:39:17,312 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 43 [2019-01-01 19:39:17,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:17,312 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2019-01-01 19:39:17,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 19:39:17,313 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2019-01-01 19:39:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 19:39:17,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:17,316 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:17,316 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:17,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:17,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1021030653, now seen corresponding path program 1 times [2019-01-01 19:39:17,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:17,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:17,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:17,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:17,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 19:39:18,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:39:18,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 19:39:18,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 19:39:18,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 19:39:18,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:39:18,188 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand 13 states. [2019-01-01 19:39:18,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:18,792 INFO L93 Difference]: Finished difference Result 165 states and 207 transitions. [2019-01-01 19:39:18,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 19:39:18,793 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-01-01 19:39:18,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:18,796 INFO L225 Difference]: With dead ends: 165 [2019-01-01 19:39:18,796 INFO L226 Difference]: Without dead ends: 165 [2019-01-01 19:39:18,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-01-01 19:39:18,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-01 19:39:18,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 127. [2019-01-01 19:39:18,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-01 19:39:18,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 159 transitions. [2019-01-01 19:39:18,805 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 159 transitions. Word has length 44 [2019-01-01 19:39:18,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:18,805 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 159 transitions. [2019-01-01 19:39:18,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 19:39:18,805 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 159 transitions. [2019-01-01 19:39:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 19:39:18,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:18,807 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:18,807 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:18,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1021030654, now seen corresponding path program 1 times [2019-01-01 19:39:18,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:18,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:18,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:18,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:18,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:39:19,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:39:19,237 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:39:19,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:19,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:39:20,059 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 23 treesize of output 19 [2019-01-01 19:39:20,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-01 19:39:20,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:20,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:20,072 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 28 treesize of output 22 [2019-01-01 19:39:20,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-01-01 19:39:20,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:20,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:20,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:20,089 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:13 [2019-01-01 19:39:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 19:39:20,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:39:20,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 28 [2019-01-01 19:39:20,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-01 19:39:20,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-01 19:39:20,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-01-01 19:39:20,145 INFO L87 Difference]: Start difference. First operand 127 states and 159 transitions. Second operand 29 states. [2019-01-01 19:39:21,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:21,813 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2019-01-01 19:39:21,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 19:39:21,815 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2019-01-01 19:39:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:21,818 INFO L225 Difference]: With dead ends: 168 [2019-01-01 19:39:21,818 INFO L226 Difference]: Without dead ends: 168 [2019-01-01 19:39:21,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=134, Invalid=1348, Unknown=0, NotChecked=0, Total=1482 [2019-01-01 19:39:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-01 19:39:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 127. [2019-01-01 19:39:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-01 19:39:21,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 157 transitions. [2019-01-01 19:39:21,826 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 157 transitions. Word has length 44 [2019-01-01 19:39:21,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:21,826 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 157 transitions. [2019-01-01 19:39:21,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-01 19:39:21,826 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 157 transitions. [2019-01-01 19:39:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 19:39:21,827 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:21,827 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:21,828 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:21,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:21,828 INFO L82 PathProgramCache]: Analyzing trace with hash 565846907, now seen corresponding path program 1 times [2019-01-01 19:39:21,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:21,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:21,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:21,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:21,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:39:22,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:39:22,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 19:39:22,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 19:39:22,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 19:39:22,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:39:22,125 INFO L87 Difference]: Start difference. First operand 127 states and 157 transitions. Second operand 13 states. [2019-01-01 19:39:22,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:22,488 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2019-01-01 19:39:22,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 19:39:22,489 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-01-01 19:39:22,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:22,491 INFO L225 Difference]: With dead ends: 126 [2019-01-01 19:39:22,491 INFO L226 Difference]: Without dead ends: 126 [2019-01-01 19:39:22,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-01-01 19:39:22,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-01 19:39:22,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-01-01 19:39:22,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-01 19:39:22,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2019-01-01 19:39:22,497 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 47 [2019-01-01 19:39:22,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:22,498 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2019-01-01 19:39:22,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 19:39:22,498 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2019-01-01 19:39:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 19:39:22,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:22,499 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:22,499 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:22,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:22,500 INFO L82 PathProgramCache]: Analyzing trace with hash 361816003, now seen corresponding path program 1 times [2019-01-01 19:39:22,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:22,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:22,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:22,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:22,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 19:39:22,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:39:22,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:39:22,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:39:22,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:39:22,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:39:22,615 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand 6 states. [2019-01-01 19:39:22,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:22,789 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2019-01-01 19:39:22,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:39:22,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-01-01 19:39:22,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:22,793 INFO L225 Difference]: With dead ends: 127 [2019-01-01 19:39:22,793 INFO L226 Difference]: Without dead ends: 127 [2019-01-01 19:39:22,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:39:22,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-01 19:39:22,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-01-01 19:39:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-01 19:39:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2019-01-01 19:39:22,801 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 48 [2019-01-01 19:39:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:22,803 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2019-01-01 19:39:22,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:39:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2019-01-01 19:39:22,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 19:39:22,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:22,804 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:22,805 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:22,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:22,805 INFO L82 PathProgramCache]: Analyzing trace with hash 361816004, now seen corresponding path program 1 times [2019-01-01 19:39:22,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:22,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:22,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:22,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:22,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:39:23,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:39:23,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:39:23,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:23,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:39:23,542 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 23 treesize of output 19 [2019-01-01 19:39:23,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-01 19:39:23,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:23,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:23,559 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 28 treesize of output 22 [2019-01-01 19:39:23,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-01-01 19:39:23,564 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:23,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:23,574 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-01 19:39:23,575 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2019-01-01 19:39:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 19:39:23,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:39:23,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 23 [2019-01-01 19:39:23,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-01 19:39:23,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-01 19:39:23,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-01-01 19:39:23,654 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand 24 states. [2019-01-01 19:39:24,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:24,938 INFO L93 Difference]: Finished difference Result 182 states and 224 transitions. [2019-01-01 19:39:24,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-01 19:39:24,940 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2019-01-01 19:39:24,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:24,942 INFO L225 Difference]: With dead ends: 182 [2019-01-01 19:39:24,942 INFO L226 Difference]: Without dead ends: 182 [2019-01-01 19:39:24,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=1191, Unknown=0, NotChecked=0, Total=1332 [2019-01-01 19:39:24,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-01 19:39:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 125. [2019-01-01 19:39:24,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-01 19:39:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2019-01-01 19:39:24,954 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 48 [2019-01-01 19:39:24,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:24,955 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2019-01-01 19:39:24,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-01 19:39:24,955 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2019-01-01 19:39:24,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 19:39:24,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:24,956 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:24,956 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:24,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:24,957 INFO L82 PathProgramCache]: Analyzing trace with hash 361385054, now seen corresponding path program 1 times [2019-01-01 19:39:24,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:24,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:24,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:24,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:24,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:39:25,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:39:25,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 19:39:25,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 19:39:25,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 19:39:25,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:39:25,301 INFO L87 Difference]: Start difference. First operand 125 states and 151 transitions. Second operand 13 states. [2019-01-01 19:39:26,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:26,009 INFO L93 Difference]: Finished difference Result 164 states and 198 transitions. [2019-01-01 19:39:26,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 19:39:26,013 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-01-01 19:39:26,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:26,014 INFO L225 Difference]: With dead ends: 164 [2019-01-01 19:39:26,014 INFO L226 Difference]: Without dead ends: 164 [2019-01-01 19:39:26,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-01-01 19:39:26,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-01 19:39:26,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 133. [2019-01-01 19:39:26,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-01 19:39:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2019-01-01 19:39:26,021 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 48 [2019-01-01 19:39:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:26,022 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2019-01-01 19:39:26,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 19:39:26,022 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2019-01-01 19:39:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-01 19:39:26,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:26,023 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:26,023 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:26,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:26,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1681965091, now seen corresponding path program 1 times [2019-01-01 19:39:26,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:26,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:26,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:26,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:26,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 19:39:26,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:39:26,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 19:39:26,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:39:26,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:39:26,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:39:26,275 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand 5 states. [2019-01-01 19:39:26,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:26,848 INFO L93 Difference]: Finished difference Result 132 states and 160 transitions. [2019-01-01 19:39:26,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:39:26,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-01-01 19:39:26,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:26,851 INFO L225 Difference]: With dead ends: 132 [2019-01-01 19:39:26,851 INFO L226 Difference]: Without dead ends: 132 [2019-01-01 19:39:26,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:39:26,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-01 19:39:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-01-01 19:39:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-01 19:39:26,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 160 transitions. [2019-01-01 19:39:26,857 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 160 transitions. Word has length 49 [2019-01-01 19:39:26,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:26,857 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 160 transitions. [2019-01-01 19:39:26,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:39:26,857 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 160 transitions. [2019-01-01 19:39:26,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-01 19:39:26,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:26,858 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:26,858 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:26,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:26,859 INFO L82 PathProgramCache]: Analyzing trace with hash -187169459, now seen corresponding path program 1 times [2019-01-01 19:39:26,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:26,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:26,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:26,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:26,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:39:27,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:39:27,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:39:27,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:27,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:39:27,949 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-01 19:39:27,952 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-01 19:39:27,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:27,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:27,963 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-01 19:39:27,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01 19:39:27,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:27,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:27,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:27,976 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:27, output treesize:9 [2019-01-01 19:39:28,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2019-01-01 19:39:28,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:28,505 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-01-01 19:39:28,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:28,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-01-01 19:39:28,550 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:28,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-01-01 19:39:28,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:28,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:39:28,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 19:39:28,680 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:59 [2019-01-01 19:39:28,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2019-01-01 19:39:28,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2019-01-01 19:39:28,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:28,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-01-01 19:39:28,995 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:29,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:29,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2019-01-01 19:39:29,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2019-01-01 19:39:29,068 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:29,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-01-01 19:39:29,119 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:29,122 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:29,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:29,127 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:71, output treesize:4 [2019-01-01 19:39:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:39:29,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:39:29,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 38 [2019-01-01 19:39:29,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-01 19:39:29,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-01 19:39:29,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1321, Unknown=0, NotChecked=0, Total=1406 [2019-01-01 19:39:29,179 INFO L87 Difference]: Start difference. First operand 132 states and 160 transitions. Second operand 38 states. [2019-01-01 19:39:34,114 WARN L181 SmtUtils]: Spent 3.66 s on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-01-01 19:39:37,803 WARN L181 SmtUtils]: Spent 3.61 s on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-01-01 19:39:37,989 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-01-01 19:39:38,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:38,399 INFO L93 Difference]: Finished difference Result 155 states and 184 transitions. [2019-01-01 19:39:38,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-01 19:39:38,401 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 50 [2019-01-01 19:39:38,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:38,403 INFO L225 Difference]: With dead ends: 155 [2019-01-01 19:39:38,403 INFO L226 Difference]: Without dead ends: 155 [2019-01-01 19:39:38,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=274, Invalid=3032, Unknown=0, NotChecked=0, Total=3306 [2019-01-01 19:39:38,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-01 19:39:38,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 134. [2019-01-01 19:39:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-01 19:39:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 160 transitions. [2019-01-01 19:39:38,411 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 160 transitions. Word has length 50 [2019-01-01 19:39:38,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:38,411 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 160 transitions. [2019-01-01 19:39:38,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-01 19:39:38,411 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 160 transitions. [2019-01-01 19:39:38,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-01 19:39:38,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:38,412 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:38,413 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:38,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:38,413 INFO L82 PathProgramCache]: Analyzing trace with hash 518831993, now seen corresponding path program 1 times [2019-01-01 19:39:38,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:38,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:38,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:38,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:38,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:39:39,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:39:39,138 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:39:39,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:39,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:39:39,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 19:39:39,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:39,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:39,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-01 19:39:39,436 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-01 19:39:39,443 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-01 19:39:39,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:39,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:39,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:39,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-01-01 19:39:39,913 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 27 treesize of output 23 [2019-01-01 19:39:39,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-01 19:39:39,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:39,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:39,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:39,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2019-01-01 19:39:40,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2019-01-01 19:39:40,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-01-01 19:39:40,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:40,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2019-01-01 19:39:40,068 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:40,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 21 [2019-01-01 19:39:40,094 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:39:40,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:40,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:40,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-01-01 19:39:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:39:40,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:39:40,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 37 [2019-01-01 19:39:40,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-01 19:39:40,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-01 19:39:40,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1319, Unknown=0, NotChecked=0, Total=1406 [2019-01-01 19:39:40,143 INFO L87 Difference]: Start difference. First operand 134 states and 160 transitions. Second operand 38 states. [2019-01-01 19:39:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:43,329 INFO L93 Difference]: Finished difference Result 158 states and 188 transitions. [2019-01-01 19:39:43,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-01 19:39:43,331 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 52 [2019-01-01 19:39:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:43,333 INFO L225 Difference]: With dead ends: 158 [2019-01-01 19:39:43,333 INFO L226 Difference]: Without dead ends: 158 [2019-01-01 19:39:43,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=251, Invalid=2829, Unknown=0, NotChecked=0, Total=3080 [2019-01-01 19:39:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-01 19:39:43,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 140. [2019-01-01 19:39:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-01-01 19:39:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 168 transitions. [2019-01-01 19:39:43,339 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 168 transitions. Word has length 52 [2019-01-01 19:39:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:43,340 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 168 transitions. [2019-01-01 19:39:43,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-01 19:39:43,342 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 168 transitions. [2019-01-01 19:39:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-01 19:39:43,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:43,342 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:43,343 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:43,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:43,343 INFO L82 PathProgramCache]: Analyzing trace with hash 518831994, now seen corresponding path program 1 times [2019-01-01 19:39:43,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:43,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:43,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:43,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:43,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:39:44,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:39:44,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:39:44,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:44,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:39:44,351 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 6 treesize of output 5 [2019-01-01 19:39:44,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:44,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:44,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 19:39:44,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 19:39:44,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:44,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:44,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-01 19:39:44,742 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-01 19:39:44,748 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-01 19:39:44,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:44,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:44,769 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-01 19:39:44,772 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-01 19:39:44,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:44,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:44,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:44,786 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-01-01 19:39:45,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2019-01-01 19:39:45,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2019-01-01 19:39:45,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:39:45,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2019-01-01 19:39:45,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:45,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 41 [2019-01-01 19:39:45,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:45,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 19:39:45,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2019-01-01 19:39:45,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2019-01-01 19:39:45,615 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:45,632 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:45,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 45 [2019-01-01 19:39:45,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2019-01-01 19:39:45,646 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:45,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:45,685 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2019-01-01 19:39:45,685 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:45,703 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:45,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2019-01-01 19:39:45,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:45,720 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2019-01-01 19:39:45,721 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:45,759 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:45,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:45,777 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:80, output treesize:9 [2019-01-01 19:39:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:39:45,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:39:45,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2019-01-01 19:39:45,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-01 19:39:45,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-01 19:39:45,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1968, Unknown=0, NotChecked=0, Total=2070 [2019-01-01 19:39:45,900 INFO L87 Difference]: Start difference. First operand 140 states and 168 transitions. Second operand 46 states. [2019-01-01 19:39:48,399 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-01-01 19:39:48,599 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-01-01 19:39:48,911 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-01-01 19:39:50,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:50,451 INFO L93 Difference]: Finished difference Result 178 states and 212 transitions. [2019-01-01 19:39:50,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-01 19:39:50,459 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 52 [2019-01-01 19:39:50,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:50,460 INFO L225 Difference]: With dead ends: 178 [2019-01-01 19:39:50,461 INFO L226 Difference]: Without dead ends: 178 [2019-01-01 19:39:50,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=290, Invalid=3742, Unknown=0, NotChecked=0, Total=4032 [2019-01-01 19:39:50,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-01 19:39:50,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 154. [2019-01-01 19:39:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-01 19:39:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 188 transitions. [2019-01-01 19:39:50,468 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 188 transitions. Word has length 52 [2019-01-01 19:39:50,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:50,469 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 188 transitions. [2019-01-01 19:39:50,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-01 19:39:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 188 transitions. [2019-01-01 19:39:50,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-01 19:39:50,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:50,470 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:50,471 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:50,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:50,471 INFO L82 PathProgramCache]: Analyzing trace with hash 381341571, now seen corresponding path program 1 times [2019-01-01 19:39:50,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:50,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:50,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:50,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:50,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 19:39:51,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:39:51,027 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:39:51,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:51,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:39:51,120 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 17 treesize of output 13 [2019-01-01 19:39:51,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-01-01 19:39:51,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:51,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:51,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:51,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-01-01 19:39:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 19:39:51,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:39:51,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 19:39:51,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:39:51,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:39:51,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:39:51,161 INFO L87 Difference]: Start difference. First operand 154 states and 188 transitions. Second operand 7 states. [2019-01-01 19:39:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:51,383 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2019-01-01 19:39:51,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 19:39:51,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-01-01 19:39:51,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:51,387 INFO L225 Difference]: With dead ends: 159 [2019-01-01 19:39:51,387 INFO L226 Difference]: Without dead ends: 159 [2019-01-01 19:39:51,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:39:51,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-01 19:39:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-01-01 19:39:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-01 19:39:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 194 transitions. [2019-01-01 19:39:51,394 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 194 transitions. Word has length 54 [2019-01-01 19:39:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:51,394 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 194 transitions. [2019-01-01 19:39:51,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:39:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 194 transitions. [2019-01-01 19:39:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-01 19:39:51,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:51,395 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:51,395 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:51,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:51,399 INFO L82 PathProgramCache]: Analyzing trace with hash 381341572, now seen corresponding path program 1 times [2019-01-01 19:39:51,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:51,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:51,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:51,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:51,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:39:52,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:39:52,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:39:52,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:52,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:39:52,710 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 23 treesize of output 19 [2019-01-01 19:39:52,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-01 19:39:52,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:52,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:52,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-01 19:39:52,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 19:39:52,730 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:52,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:52,735 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-01 19:39:52,735 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:7 [2019-01-01 19:39:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 19:39:52,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:39:52,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7] total 26 [2019-01-01 19:39:52,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-01 19:39:52,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-01 19:39:52,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2019-01-01 19:39:52,847 INFO L87 Difference]: Start difference. First operand 158 states and 194 transitions. Second operand 27 states. [2019-01-01 19:39:54,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:54,586 INFO L93 Difference]: Finished difference Result 178 states and 210 transitions. [2019-01-01 19:39:54,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-01 19:39:54,591 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 54 [2019-01-01 19:39:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:54,592 INFO L225 Difference]: With dead ends: 178 [2019-01-01 19:39:54,592 INFO L226 Difference]: Without dead ends: 178 [2019-01-01 19:39:54,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=272, Invalid=2278, Unknown=0, NotChecked=0, Total=2550 [2019-01-01 19:39:54,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-01 19:39:54,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 162. [2019-01-01 19:39:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-01 19:39:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 194 transitions. [2019-01-01 19:39:54,602 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 194 transitions. Word has length 54 [2019-01-01 19:39:54,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:54,602 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 194 transitions. [2019-01-01 19:39:54,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-01 19:39:54,602 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 194 transitions. [2019-01-01 19:39:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 19:39:54,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:54,606 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:54,607 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:54,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:54,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1600273867, now seen corresponding path program 3 times [2019-01-01 19:39:54,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:54,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:54,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:54,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:54,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-01 19:39:54,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:39:54,800 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:39:54,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 19:39:54,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 19:39:54,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:39:54,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:39:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-01 19:39:54,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:39:54,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 19:39:54,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:39:54,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:39:54,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:39:54,958 INFO L87 Difference]: Start difference. First operand 162 states and 194 transitions. Second operand 7 states. [2019-01-01 19:39:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:55,008 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2019-01-01 19:39:55,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:39:55,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-01-01 19:39:55,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:55,011 INFO L225 Difference]: With dead ends: 106 [2019-01-01 19:39:55,011 INFO L226 Difference]: Without dead ends: 97 [2019-01-01 19:39:55,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:39:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-01 19:39:55,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-01 19:39:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-01 19:39:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2019-01-01 19:39:55,015 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 56 [2019-01-01 19:39:55,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:55,015 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2019-01-01 19:39:55,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:39:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2019-01-01 19:39:55,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 19:39:55,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:55,016 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:55,016 INFO L423 AbstractCegarLoop]: === Iteration 24 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:55,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:55,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1397032643, now seen corresponding path program 1 times [2019-01-01 19:39:55,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:55,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:55,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:55,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:39:55,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:39:55,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:39:55,658 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:39:55,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:55,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:39:55,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 19:39:55,762 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-01 19:39:55,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:55,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:55,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:55,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-01-01 19:39:56,003 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 27 treesize of output 23 [2019-01-01 19:39:56,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-01 19:39:56,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:56,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:56,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:56,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2019-01-01 19:39:56,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2019-01-01 19:39:56,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-01-01 19:39:56,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:56,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:56,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:56,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:5 [2019-01-01 19:39:56,174 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:39:56,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:39:56,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 31 [2019-01-01 19:39:56,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-01 19:39:56,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-01 19:39:56,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=924, Unknown=0, NotChecked=0, Total=992 [2019-01-01 19:39:56,195 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 32 states. [2019-01-01 19:39:57,486 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-01-01 19:39:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:59,305 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-01-01 19:39:59,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-01 19:39:59,306 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 56 [2019-01-01 19:39:59,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:59,307 INFO L225 Difference]: With dead ends: 106 [2019-01-01 19:39:59,307 INFO L226 Difference]: Without dead ends: 106 [2019-01-01 19:39:59,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=194, Invalid=2062, Unknown=0, NotChecked=0, Total=2256 [2019-01-01 19:39:59,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-01 19:39:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2019-01-01 19:39:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-01 19:39:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2019-01-01 19:39:59,312 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 56 [2019-01-01 19:39:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:59,312 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2019-01-01 19:39:59,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-01 19:39:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2019-01-01 19:39:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 19:39:59,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:59,313 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:59,313 INFO L423 AbstractCegarLoop]: === Iteration 25 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:59,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1397085231, now seen corresponding path program 2 times [2019-01-01 19:39:59,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:59,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:59,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:59,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:59,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:59,832 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-01 19:40:00,738 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-01 19:40:01,404 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-01-01 19:40:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:40:01,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:40:01,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:40:01,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:40:01,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 19:40:01,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:40:01,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:40:01,928 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-01 19:40:01,942 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-01 19:40:01,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:01,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:01,956 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-01 19:40:01,970 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-01 19:40:01,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:01,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:01,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:01,979 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-01-01 19:40:12,366 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 19:40:16,474 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 19:40:16,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:40:16,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:40:16,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:40:16,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:16,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-01 19:40:16,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-01 19:40:16,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:40:16,523 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 20 treesize of output 16 [2019-01-01 19:40:16,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:16,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:16,537 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:16,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-01 19:40:16,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-01 19:40:16,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:40:16,571 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 20 treesize of output 16 [2019-01-01 19:40:16,572 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:16,577 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:16,584 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:16,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:40:16,598 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:68, output treesize:40 [2019-01-01 19:40:16,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-01-01 19:40:17,014 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 2 case distinctions, treesize of input 18 treesize of output 27 [2019-01-01 19:40:17,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:40:17,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:40:17,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-01-01 19:40:17,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-01-01 19:40:17,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:17,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:17,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:40:17,128 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:111 [2019-01-01 19:40:18,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 130 [2019-01-01 19:40:18,468 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:40:18,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 106 [2019-01-01 19:40:18,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:18,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 63 [2019-01-01 19:40:18,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:40:18,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 106 [2019-01-01 19:40:18,649 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:40:18,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 80 [2019-01-01 19:40:18,741 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:40:18,828 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:40:18,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2019-01-01 19:40:18,830 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:18,919 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:40:18,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 102 [2019-01-01 19:40:18,939 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-01 19:40:19,056 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:40:19,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 66 [2019-01-01 19:40:19,062 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:40:19,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 55 [2019-01-01 19:40:19,554 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:40:19,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2019-01-01 19:40:19,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2019-01-01 19:40:19,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2019-01-01 19:40:19,781 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:19,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2019-01-01 19:40:19,851 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:19,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 22 [2019-01-01 19:40:19,887 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:19,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2019-01-01 19:40:19,932 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:19,948 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:19,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 57 [2019-01-01 19:40:19,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:40:19,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2019-01-01 19:40:19,974 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,013 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:40:20,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 38 [2019-01-01 19:40:20,015 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2019-01-01 19:40:20,050 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2019-01-01 19:40:20,084 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2019-01-01 19:40:20,114 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,131 INFO L267 ElimStorePlain]: Start of recursive call 16: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 59 [2019-01-01 19:40:20,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2019-01-01 19:40:20,158 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2019-01-01 19:40:20,238 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2019-01-01 19:40:20,315 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,383 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:40:20,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:40:20,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2019-01-01 19:40:20,394 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,450 INFO L267 ElimStorePlain]: Start of recursive call 22: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 67 [2019-01-01 19:40:20,480 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:40:20,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2019-01-01 19:40:20,481 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-01-01 19:40:20,574 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2019-01-01 19:40:20,763 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,806 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:40:20,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:40:20,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2019-01-01 19:40:20,810 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,831 INFO L267 ElimStorePlain]: Start of recursive call 27: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2019-01-01 19:40:20,850 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:40:20,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-01 19:40:20,853 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2019-01-01 19:40:20,875 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:40:20,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-01 19:40:20,890 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,899 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:20,947 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 3 variables, input treesize:156, output treesize:7 [2019-01-01 19:40:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:40:21,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:40:21,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32] total 50 [2019-01-01 19:40:21,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-01 19:40:21,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-01 19:40:21,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2310, Unknown=24, NotChecked=0, Total=2450 [2019-01-01 19:40:21,050 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 50 states. [2019-01-01 19:40:40,151 WARN L181 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-01-01 19:40:48,612 WARN L181 SmtUtils]: Spent 8.21 s on a formula simplification. DAG size of input: 93 DAG size of output: 57 [2019-01-01 19:40:49,858 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-01-01 19:40:50,558 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-01-01 19:40:50,797 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-01-01 19:40:51,128 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 74 [2019-01-01 19:40:51,410 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 74 [2019-01-01 19:40:51,823 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2019-01-01 19:40:52,690 WARN L181 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2019-01-01 19:40:52,968 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-01-01 19:40:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:40:53,745 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2019-01-01 19:40:53,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-01 19:40:53,746 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 56 [2019-01-01 19:40:53,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:40:53,747 INFO L225 Difference]: With dead ends: 97 [2019-01-01 19:40:53,748 INFO L226 Difference]: Without dead ends: 97 [2019-01-01 19:40:53,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=288, Invalid=4794, Unknown=30, NotChecked=0, Total=5112 [2019-01-01 19:40:53,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-01 19:40:53,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-01-01 19:40:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-01 19:40:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-01-01 19:40:53,753 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 56 [2019-01-01 19:40:53,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:40:53,753 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-01-01 19:40:53,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-01 19:40:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-01-01 19:40:53,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-01 19:40:53,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:40:53,758 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:40:53,758 INFO L423 AbstractCegarLoop]: === Iteration 26 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:40:53,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:40:53,758 INFO L82 PathProgramCache]: Analyzing trace with hash -695544581, now seen corresponding path program 1 times [2019-01-01 19:40:53,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:40:53,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:40:53,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:53,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:40:53,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 19:40:53,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:40:53,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:40:53,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:40:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:53,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:40:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 19:40:53,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:40:53,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 19:40:53,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:40:53,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:40:53,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:40:53,983 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 5 states. [2019-01-01 19:40:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:40:54,014 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2019-01-01 19:40:54,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:40:54,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-01-01 19:40:54,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:40:54,017 INFO L225 Difference]: With dead ends: 97 [2019-01-01 19:40:54,017 INFO L226 Difference]: Without dead ends: 97 [2019-01-01 19:40:54,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:40:54,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-01 19:40:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-01 19:40:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-01 19:40:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2019-01-01 19:40:54,021 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 62 [2019-01-01 19:40:54,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:40:54,021 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2019-01-01 19:40:54,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:40:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2019-01-01 19:40:54,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-01 19:40:54,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:40:54,022 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:40:54,023 INFO L423 AbstractCegarLoop]: === Iteration 27 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:40:54,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:40:54,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1596693738, now seen corresponding path program 1 times [2019-01-01 19:40:54,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:40:54,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:40:54,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:54,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:40:54,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 19:40:54,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:40:54,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:40:54,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:40:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:54,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:40:54,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:40:54,662 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 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 19:40:54,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-01 19:40:54,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:40:54,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:24 [2019-01-01 19:40:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 19:40:54,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:40:54,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-01-01 19:40:54,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 19:40:54,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 19:40:54,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:40:54,783 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 16 states. [2019-01-01 19:40:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:40:55,565 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2019-01-01 19:40:55,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 19:40:55,567 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 64 [2019-01-01 19:40:55,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:40:55,569 INFO L225 Difference]: With dead ends: 132 [2019-01-01 19:40:55,569 INFO L226 Difference]: Without dead ends: 132 [2019-01-01 19:40:55,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-01-01 19:40:55,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-01 19:40:55,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 95. [2019-01-01 19:40:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-01 19:40:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-01-01 19:40:55,574 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 64 [2019-01-01 19:40:55,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:40:55,574 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-01-01 19:40:55,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 19:40:55,575 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-01-01 19:40:55,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-01 19:40:55,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:40:55,575 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:40:55,578 INFO L423 AbstractCegarLoop]: === Iteration 28 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:40:55,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:40:55,579 INFO L82 PathProgramCache]: Analyzing trace with hash -2042101625, now seen corresponding path program 1 times [2019-01-01 19:40:55,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:40:55,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:40:55,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:55,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:40:55,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:40:56,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:40:56,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:40:56,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:40:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:56,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:40:57,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:40:57,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:40:57,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:40:57,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:57,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:57,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-01 19:40:57,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 19:40:57,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 19:40:57,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:57,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:57,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:57,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-01-01 19:40:59,124 WARN L181 SmtUtils]: Spent 666.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-01 19:40:59,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:40:59,163 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 2 case distinctions, treesize of input 30 treesize of output 51 [2019-01-01 19:40:59,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-01 19:40:59,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 19:40:59,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:113 [2019-01-01 19:41:00,892 WARN L181 SmtUtils]: Spent 1.61 s on a formula simplification that was a NOOP. DAG size: 36 [2019-01-01 19:41:00,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:00,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 73 [2019-01-01 19:41:01,007 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 56 [2019-01-01 19:41:01,009 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:41:01,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:41:01,074 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 48 treesize of output 46 [2019-01-01 19:41:01,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2019-01-01 19:41:01,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:01,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:01,091 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 51 treesize of output 49 [2019-01-01 19:41:01,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-01-01 19:41:01,094 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:41:01,120 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:41:01,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-01 19:41:01,152 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:84, output treesize:91 [2019-01-01 19:41:01,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:01,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-01-01 19:41:01,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-01 19:41:01,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:01,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2019-01-01 19:41:01,438 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:01,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:01,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:41:01,450 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:44, output treesize:11 [2019-01-01 19:41:01,522 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:41:01,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:41:01,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 53 [2019-01-01 19:41:01,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-01 19:41:01,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-01 19:41:01,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2711, Unknown=1, NotChecked=0, Total=2862 [2019-01-01 19:41:01,547 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 54 states. [2019-01-01 19:41:09,030 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 19:41:10,677 WARN L181 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 51 [2019-01-01 19:41:12,323 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2019-01-01 19:41:20,375 WARN L181 SmtUtils]: Spent 843.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-01 19:41:23,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:41:23,220 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2019-01-01 19:41:23,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-01 19:41:23,222 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 65 [2019-01-01 19:41:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:41:23,224 INFO L225 Difference]: With dead ends: 150 [2019-01-01 19:41:23,224 INFO L226 Difference]: Without dead ends: 150 [2019-01-01 19:41:23,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1327 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=569, Invalid=7435, Unknown=6, NotChecked=0, Total=8010 [2019-01-01 19:41:23,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-01 19:41:23,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 99. [2019-01-01 19:41:23,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-01 19:41:23,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2019-01-01 19:41:23,230 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 65 [2019-01-01 19:41:23,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:41:23,231 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2019-01-01 19:41:23,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-01 19:41:23,231 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2019-01-01 19:41:23,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-01 19:41:23,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:41:23,232 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:41:23,232 INFO L423 AbstractCegarLoop]: === Iteration 29 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:41:23,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:41:23,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2042101624, now seen corresponding path program 1 times [2019-01-01 19:41:23,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:41:23,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:41:23,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:23,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:23,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:41:24,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:41:24,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:41:24,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:24,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:41:24,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 60 [2019-01-01 19:41:24,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2019-01-01 19:41:24,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:24,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 54 [2019-01-01 19:41:24,990 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 19:41:25,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:41:25,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:41:25,056 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:67, output treesize:107 [2019-01-01 19:41:25,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:25,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 75 [2019-01-01 19:41:25,195 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 14 treesize of output 13 [2019-01-01 19:41:25,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:25,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:25,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:41:25,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:131, output treesize:63 [2019-01-01 19:41:25,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:25,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2019-01-01 19:41:25,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2019-01-01 19:41:25,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:25,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-01 19:41:25,554 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:25,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:25,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:25,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2019-01-01 19:41:25,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-01 19:41:25,618 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:25,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-01-01 19:41:25,630 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:25,636 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:25,643 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-01 19:41:25,643 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:74, output treesize:13 [2019-01-01 19:41:25,710 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:41:25,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:41:25,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 45 [2019-01-01 19:41:25,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-01 19:41:25,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-01 19:41:25,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1947, Unknown=0, NotChecked=0, Total=2070 [2019-01-01 19:41:25,733 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 46 states. [2019-01-01 19:41:29,555 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 45 [2019-01-01 19:41:37,456 WARN L181 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-01-01 19:41:40,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:41:40,416 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2019-01-01 19:41:40,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-01 19:41:40,420 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 65 [2019-01-01 19:41:40,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:41:40,422 INFO L225 Difference]: With dead ends: 158 [2019-01-01 19:41:40,422 INFO L226 Difference]: Without dead ends: 158 [2019-01-01 19:41:40,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=568, Invalid=5912, Unknown=0, NotChecked=0, Total=6480 [2019-01-01 19:41:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-01 19:41:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 130. [2019-01-01 19:41:40,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-01 19:41:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 151 transitions. [2019-01-01 19:41:40,428 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 151 transitions. Word has length 65 [2019-01-01 19:41:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:41:40,429 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 151 transitions. [2019-01-01 19:41:40,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-01 19:41:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 151 transitions. [2019-01-01 19:41:40,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-01 19:41:40,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:41:40,430 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:41:40,430 INFO L423 AbstractCegarLoop]: === Iteration 30 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:41:40,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:41:40,431 INFO L82 PathProgramCache]: Analyzing trace with hash 701482728, now seen corresponding path program 1 times [2019-01-01 19:41:40,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:41:40,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:41:40,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:40,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:40,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:41:40,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:41:40,785 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:41:40,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:40,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:41:40,954 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 9 treesize of output 7 [2019-01-01 19:41:40,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-01-01 19:41:40,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:40,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:40,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:40,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:3 [2019-01-01 19:41:41,686 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_remove_last_~snd_to_last~0.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_remove_last_#in~head.base|) |c_sll_remove_last_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) (+ sll_remove_last_~snd_to_last~0.offset 4) 0))))) is different from true [2019-01-01 19:41:41,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:41,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35 [2019-01-01 19:41:41,704 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 14 treesize of output 13 [2019-01-01 19:41:41,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:41,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:41,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:41:41,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-01-01 19:41:41,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:41,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-01 19:41:41,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2019-01-01 19:41:41,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:41:41,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-01 19:41:41,901 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:41,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:41,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:41,907 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:33, output treesize:5 [2019-01-01 19:41:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:41:41,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:41:41,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2019-01-01 19:41:41,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-01 19:41:41,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-01 19:41:41,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=676, Unknown=1, NotChecked=52, Total=812 [2019-01-01 19:41:41,937 INFO L87 Difference]: Start difference. First operand 130 states and 151 transitions. Second operand 29 states. [2019-01-01 19:41:53,697 WARN L181 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-01-01 19:42:03,874 WARN L181 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-01 19:42:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:42:09,041 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2019-01-01 19:42:09,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-01 19:42:09,042 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 69 [2019-01-01 19:42:09,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:42:09,044 INFO L225 Difference]: With dead ends: 157 [2019-01-01 19:42:09,044 INFO L226 Difference]: Without dead ends: 157 [2019-01-01 19:42:09,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=345, Invalid=2593, Unknown=36, NotChecked=106, Total=3080 [2019-01-01 19:42:09,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-01-01 19:42:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 133. [2019-01-01 19:42:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-01 19:42:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-01-01 19:42:09,050 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 69 [2019-01-01 19:42:09,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:42:09,051 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-01-01 19:42:09,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-01 19:42:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-01-01 19:42:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-01 19:42:09,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:42:09,052 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:42:09,052 INFO L423 AbstractCegarLoop]: === Iteration 31 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:42:09,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:42:09,052 INFO L82 PathProgramCache]: Analyzing trace with hash 229180759, now seen corresponding path program 1 times [2019-01-01 19:42:09,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:42:09,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:42:09,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:42:09,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:42:09,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:42:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:42:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:42:09,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:42:09,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:42:09,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:42:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:42:09,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:42:10,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 42 [2019-01-01 19:42:10,386 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 27 treesize of output 26 [2019-01-01 19:42:10,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:10,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39 [2019-01-01 19:42:10,421 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 19:42:10,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:42:10,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:42:10,446 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:25, output treesize:37 [2019-01-01 19:42:10,502 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 19:42:10,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:10,512 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 27 treesize of output 23 [2019-01-01 19:42:10,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-01 19:42:10,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:10,521 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:10,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:10,529 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:22 [2019-01-01 19:42:11,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 70 [2019-01-01 19:42:11,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2019-01-01 19:42:11,304 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:11,348 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2019-01-01 19:42:11,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:42:11,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 40 [2019-01-01 19:42:11,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:11,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 19:42:11,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:11,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:11,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:11,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 77 [2019-01-01 19:42:11,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2019-01-01 19:42:11,522 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:11,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2019-01-01 19:42:11,571 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:11,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2019-01-01 19:42:11,610 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:11,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-01-01 19:42:11,643 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:11,686 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2019-01-01 19:42:11,688 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:42:11,727 INFO L267 ElimStorePlain]: Start of recursive call 6: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 19:42:11,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2019-01-01 19:42:11,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-01 19:42:11,824 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:11,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-01 19:42:11,835 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:11,841 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:11,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 42 [2019-01-01 19:42:11,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-01-01 19:42:11,875 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:11,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-01-01 19:42:11,915 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:11,937 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:11,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2019-01-01 19:42:11,959 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2019-01-01 19:42:11,960 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2019-01-01 19:42:11,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2019-01-01 19:42:11,993 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:12,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-01 19:42:12,023 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:12,037 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:12,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:12,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2019-01-01 19:42:12,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2019-01-01 19:42:12,140 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:12,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:12,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2019-01-01 19:42:12,261 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:12,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-01 19:42:12,339 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:12,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2019-01-01 19:42:12,416 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:12,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-01-01 19:42:12,495 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:12,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 25 [2019-01-01 19:42:12,553 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:12,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:12,628 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-01-01 19:42:12,629 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:12,695 INFO L267 ElimStorePlain]: Start of recursive call 22: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 19:42:12,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:12,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2019-01-01 19:42:12,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2019-01-01 19:42:12,716 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:12,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2019-01-01 19:42:12,753 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:12,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2019-01-01 19:42:12,783 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:12,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2019-01-01 19:42:12,835 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:12,857 INFO L267 ElimStorePlain]: Start of recursive call 30: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:42:12,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:12,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 48 [2019-01-01 19:42:12,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2019-01-01 19:42:12,895 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:12,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2019-01-01 19:42:12,960 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:13,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2019-01-01 19:42:13,060 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:13,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:13,113 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-01-01 19:42:13,114 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:13,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-01-01 19:42:13,161 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:13,213 INFO L267 ElimStorePlain]: Start of recursive call 35: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:42:13,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 19:42:13,263 INFO L202 ElimStorePlain]: Needed 40 recursive calls to eliminate 8 variables, input treesize:143, output treesize:17 [2019-01-01 19:42:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:42:13,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:42:13,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2019-01-01 19:42:13,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-01 19:42:13,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-01 19:42:13,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=2227, Unknown=2, NotChecked=0, Total=2352 [2019-01-01 19:42:13,327 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 49 states. [2019-01-01 19:42:18,630 WARN L181 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 111 DAG size of output: 73 [2019-01-01 19:42:19,376 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 51 [2019-01-01 19:42:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:42:20,477 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2019-01-01 19:42:20,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-01 19:42:20,480 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 71 [2019-01-01 19:42:20,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:42:20,481 INFO L225 Difference]: With dead ends: 136 [2019-01-01 19:42:20,481 INFO L226 Difference]: Without dead ends: 136 [2019-01-01 19:42:20,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=593, Invalid=6207, Unknown=6, NotChecked=0, Total=6806 [2019-01-01 19:42:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-01 19:42:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2019-01-01 19:42:20,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-01 19:42:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2019-01-01 19:42:20,487 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 149 transitions. Word has length 71 [2019-01-01 19:42:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:42:20,487 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 149 transitions. [2019-01-01 19:42:20,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-01 19:42:20,488 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 149 transitions. [2019-01-01 19:42:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-01 19:42:20,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:42:20,488 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:42:20,489 INFO L423 AbstractCegarLoop]: === Iteration 32 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:42:20,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:42:20,489 INFO L82 PathProgramCache]: Analyzing trace with hash -184959925, now seen corresponding path program 1 times [2019-01-01 19:42:20,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:42:20,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:42:20,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:42:20,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:42:20,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:42:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:42:20,788 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-01 19:42:20,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:42:20,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 19:42:20,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 19:42:20,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 19:42:20,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:42:20,789 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. Second operand 9 states. [2019-01-01 19:42:20,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:42:20,947 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2019-01-01 19:42:20,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:42:20,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-01-01 19:42:20,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:42:20,952 INFO L225 Difference]: With dead ends: 131 [2019-01-01 19:42:20,952 INFO L226 Difference]: Without dead ends: 131 [2019-01-01 19:42:20,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:42:20,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-01 19:42:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2019-01-01 19:42:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-01 19:42:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2019-01-01 19:42:20,957 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 71 [2019-01-01 19:42:20,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:42:20,957 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2019-01-01 19:42:20,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 19:42:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2019-01-01 19:42:20,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-01 19:42:20,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:42:20,958 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:42:20,958 INFO L423 AbstractCegarLoop]: === Iteration 33 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:42:20,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:42:20,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1199432963, now seen corresponding path program 1 times [2019-01-01 19:42:20,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:42:20,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:42:20,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:42:20,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:42:20,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:42:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:42:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:42:21,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:42:21,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:42:21,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:42:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:42:21,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:42:22,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 65 [2019-01-01 19:42:22,565 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 52 treesize of output 51 [2019-01-01 19:42:22,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:22,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 60 [2019-01-01 19:42:22,628 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 19:42:22,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:42:22,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:42:22,689 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:51, output treesize:82 [2019-01-01 19:42:22,793 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 19:42:22,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:22,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:22,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2019-01-01 19:42:22,822 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 18 treesize of output 17 [2019-01-01 19:42:22,822 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:22,834 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:22,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:22,845 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:106, output treesize:47 [2019-01-01 19:42:23,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:23,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 71 [2019-01-01 19:42:23,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2019-01-01 19:42:23,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:23,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-01-01 19:42:23,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:23,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:23,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:23,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2019-01-01 19:42:23,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-01 19:42:23,233 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:23,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2019-01-01 19:42:23,243 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:23,247 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:23,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:23,253 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:78, output treesize:7 [2019-01-01 19:42:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:42:23,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:42:23,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2019-01-01 19:42:23,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-01 19:42:23,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-01 19:42:23,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1780, Unknown=4, NotChecked=0, Total=1892 [2019-01-01 19:42:23,333 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 44 states. [2019-01-01 19:42:26,027 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 42 [2019-01-01 19:42:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:42:26,259 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2019-01-01 19:42:26,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-01 19:42:26,261 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 73 [2019-01-01 19:42:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:42:26,263 INFO L225 Difference]: With dead ends: 119 [2019-01-01 19:42:26,263 INFO L226 Difference]: Without dead ends: 115 [2019-01-01 19:42:26,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=297, Invalid=3605, Unknown=4, NotChecked=0, Total=3906 [2019-01-01 19:42:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-01 19:42:26,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-01-01 19:42:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 19:42:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-01-01 19:42:26,267 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 73 [2019-01-01 19:42:26,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:42:26,267 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-01-01 19:42:26,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-01 19:42:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-01-01 19:42:26,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-01 19:42:26,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:42:26,268 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:42:26,268 INFO L423 AbstractCegarLoop]: === Iteration 34 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:42:26,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:42:26,269 INFO L82 PathProgramCache]: Analyzing trace with hash -696354863, now seen corresponding path program 1 times [2019-01-01 19:42:26,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:42:26,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:42:26,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:42:26,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:42:26,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:42:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:42:26,611 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-01-01 19:42:27,030 WARN L181 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-01 19:42:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:42:29,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:42:29,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:42:29,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:42:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:42:29,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:42:29,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:42:29,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:29,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:29,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-01-01 19:42:29,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:29,389 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 14 treesize of output 6 [2019-01-01 19:42:29,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:29,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:42:29,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:29,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:29,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2019-01-01 19:42:29,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:29,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:29,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:48 [2019-01-01 19:42:29,703 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-01 19:42:29,720 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-01 19:42:29,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:29,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:29,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:29,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:78 [2019-01-01 19:42:32,101 WARN L181 SmtUtils]: Spent 660.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-01 19:42:32,880 WARN L181 SmtUtils]: Spent 683.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-01 19:42:33,011 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-01-01 19:42:33,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:33,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 166 [2019-01-01 19:42:33,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:33,024 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:42:33,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 93 [2019-01-01 19:42:33,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:33,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:33,086 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 92 treesize of output 84 [2019-01-01 19:42:33,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2019-01-01 19:42:33,091 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:33,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:33,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:33,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 95 [2019-01-01 19:42:33,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 62 [2019-01-01 19:42:33,162 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:42:33,207 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:42:33,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-01 19:42:33,293 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:188, output treesize:191 [2019-01-01 19:42:33,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:33,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:33,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2019-01-01 19:42:33,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2019-01-01 19:42:33,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:33,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-01 19:42:33,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:33,838 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:33,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:33,881 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:184, output treesize:58 [2019-01-01 19:42:34,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:34,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:34,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 32 [2019-01-01 19:42:34,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:34,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:34,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:56 [2019-01-01 19:42:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-01 19:42:35,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:42:35,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31] total 54 [2019-01-01 19:42:35,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-01 19:42:35,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-01 19:42:35,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2820, Unknown=1, NotChecked=0, Total=2970 [2019-01-01 19:42:35,088 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 55 states. [2019-01-01 19:42:37,359 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 55 [2019-01-01 19:42:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:42:45,995 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2019-01-01 19:42:46,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-01 19:42:46,007 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 78 [2019-01-01 19:42:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:42:46,008 INFO L225 Difference]: With dead ends: 127 [2019-01-01 19:42:46,008 INFO L226 Difference]: Without dead ends: 121 [2019-01-01 19:42:46,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 60 SyntacticMatches, 10 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=286, Invalid=5114, Unknown=2, NotChecked=0, Total=5402 [2019-01-01 19:42:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-01 19:42:46,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2019-01-01 19:42:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 19:42:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2019-01-01 19:42:46,013 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 78 [2019-01-01 19:42:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:42:46,013 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2019-01-01 19:42:46,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-01 19:42:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2019-01-01 19:42:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-01 19:42:46,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:42:46,014 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:42:46,014 INFO L423 AbstractCegarLoop]: === Iteration 35 === [sll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr14REQUIRES_VIOLATION, sll_remove_lastErr3REQUIRES_VIOLATION, sll_remove_lastErr5REQUIRES_VIOLATION, sll_remove_lastErr4REQUIRES_VIOLATION, sll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr15REQUIRES_VIOLATION, sll_remove_lastErr17REQUIRES_VIOLATION, sll_remove_lastErr16REQUIRES_VIOLATION, sll_remove_lastErr18REQUIRES_VIOLATION, sll_remove_lastErr9REQUIRES_VIOLATION, sll_remove_lastErr10REQUIRES_VIOLATION, sll_remove_lastErr1REQUIRES_VIOLATION, sll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr0REQUIRES_VIOLATION, sll_remove_lastErr11REQUIRES_VIOLATION, sll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr2REQUIRES_VIOLATION, sll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_lastErr13REQUIRES_VIOLATION, sll_remove_lastErr12REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:42:46,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:42:46,017 INFO L82 PathProgramCache]: Analyzing trace with hash -107929965, now seen corresponding path program 1 times [2019-01-01 19:42:46,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:42:46,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:42:46,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:42:46,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:42:46,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:42:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:42:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-01 19:42:46,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:42:46,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 19:42:46,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:42:46,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:42:46,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:42:46,173 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand 6 states. [2019-01-01 19:42:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:42:46,213 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-01 19:42:46,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:42:46,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-01-01 19:42:46,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:42:46,214 INFO L225 Difference]: With dead ends: 68 [2019-01-01 19:42:46,214 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 19:42:46,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:42:46,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 19:42:46,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 19:42:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 19:42:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 19:42:46,216 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2019-01-01 19:42:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:42:46,216 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 19:42:46,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:42:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 19:42:46,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 19:42:46,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 07:42:46 BoogieIcfgContainer [2019-01-01 19:42:46,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 19:42:46,222 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 19:42:46,222 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 19:42:46,223 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 19:42:46,223 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:38:38" (3/4) ... [2019-01-01 19:42:46,227 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 19:42:46,235 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 19:42:46,235 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-01 19:42:46,235 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_remove_last [2019-01-01 19:42:46,236 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 19:42:46,236 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 19:42:46,236 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2019-01-01 19:42:46,236 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 19:42:46,236 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-01-01 19:42:46,243 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-01-01 19:42:46,243 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-01 19:42:46,243 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 19:42:46,296 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 19:42:46,297 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 19:42:46,298 INFO L168 Benchmark]: Toolchain (without parser) took 249896.10 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 291.0 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -76.1 MB). Peak memory consumption was 214.9 MB. Max. memory is 11.5 GB. [2019-01-01 19:42:46,300 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:42:46,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -170.3 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2019-01-01 19:42:46,300 INFO L168 Benchmark]: Boogie Preprocessor took 83.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 19:42:46,300 INFO L168 Benchmark]: RCFGBuilder took 1158.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. [2019-01-01 19:42:46,301 INFO L168 Benchmark]: TraceAbstraction took 247813.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.2 MB). Peak memory consumption was 175.1 MB. Max. memory is 11.5 GB. [2019-01-01 19:42:46,301 INFO L168 Benchmark]: Witness Printer took 74.25 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-01-01 19:42:46,303 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 761.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -170.3 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1158.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 247813.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.2 MB). Peak memory consumption was 175.1 MB. Max. memory is 11.5 GB. * Witness Printer took 74.25 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 596]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 98 locations, 31 error locations. SAFE Result, 247.7s OverallTime, 35 OverallIterations, 3 TraceHistogramMax, 177.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1969 SDtfs, 4356 SDslu, 18042 SDs, 0 SdLazy, 25092 SolverSat, 638 SolverUnsat, 33 SolverUnknown, 0 SolverNotchecked, 53.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2070 GetRequests, 984 SyntacticMatches, 43 SemanticMatches, 1043 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 9001 ImplicationChecksByTransitivity, 174.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=22, 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, 35 MinimizatonAttempts, 527 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 66.4s InterpolantComputationTime, 2869 NumberOfCodeBlocks, 2869 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 2813 ConstructedInterpolants, 158 QuantifiedInterpolants, 1831285 SizeOfPredicates, 316 NumberOfNonLiveVariables, 6456 ConjunctsInSsa, 1040 ConjunctsInUnsatCore, 56 InterpolantComputations, 16 PerfectInterpolantSequences, 601/974 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...