./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-simple/sll2n_update_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_update_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 dd9e7bf35989cde866740706d77fd71a632fd664 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:39:54,367 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 19:39:54,369 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 19:39:54,385 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 19:39:54,385 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 19:39:54,386 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 19:39:54,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 19:39:54,389 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 19:39:54,391 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 19:39:54,392 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 19:39:54,393 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 19:39:54,393 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 19:39:54,394 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 19:39:54,395 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 19:39:54,397 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 19:39:54,398 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 19:39:54,398 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 19:39:54,401 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 19:39:54,403 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 19:39:54,405 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 19:39:54,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 19:39:54,408 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 19:39:54,410 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 19:39:54,410 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 19:39:54,411 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 19:39:54,412 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 19:39:54,413 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 19:39:54,414 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 19:39:54,415 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 19:39:54,416 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 19:39:54,416 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 19:39:54,417 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 19:39:54,418 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 19:39:54,418 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 19:39:54,419 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 19:39:54,420 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 19:39:54,421 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:39:54,436 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 19:39:54,437 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 19:39:54,438 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 19:39:54,439 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 19:39:54,439 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 19:39:54,439 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 19:39:54,439 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 19:39:54,439 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 19:39:54,440 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 19:39:54,440 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 19:39:54,440 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 19:39:54,440 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 19:39:54,440 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 19:39:54,440 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 19:39:54,441 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 19:39:54,441 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 19:39:54,441 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 19:39:54,441 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 19:39:54,441 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 19:39:54,441 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 19:39:54,445 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 19:39:54,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 19:39:54,445 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 19:39:54,445 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 19:39:54,446 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 19:39:54,446 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 19:39:54,446 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 -> dd9e7bf35989cde866740706d77fd71a632fd664 [2019-01-01 19:39:54,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 19:39:54,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 19:39:54,529 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 19:39:54,531 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 19:39:54,532 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 19:39:54,532 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-01 19:39:54,609 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a378d87/9e071b813b5544e4ab06f5cf4ca29060/FLAG805cb2d04 [2019-01-01 19:39:55,201 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 19:39:55,204 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-01 19:39:55,224 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a378d87/9e071b813b5544e4ab06f5cf4ca29060/FLAG805cb2d04 [2019-01-01 19:39:55,452 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a378d87/9e071b813b5544e4ab06f5cf4ca29060 [2019-01-01 19:39:55,456 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 19:39:55,458 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 19:39:55,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 19:39:55,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 19:39:55,464 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 19:39:55,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:39:55" (1/1) ... [2019-01-01 19:39:55,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f40f54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:39:55, skipping insertion in model container [2019-01-01 19:39:55,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:39:55" (1/1) ... [2019-01-01 19:39:55,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 19:39:55,539 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 19:39:55,868 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:39:55,881 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 19:39:56,008 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:39:56,077 INFO L195 MainTranslator]: Completed translation [2019-01-01 19:39:56,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:39:56 WrapperNode [2019-01-01 19:39:56,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 19:39:56,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 19:39:56,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 19:39:56,080 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 19:39:56,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:39:56" (1/1) ... [2019-01-01 19:39:56,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:39:56" (1/1) ... [2019-01-01 19:39:56,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:39:56" (1/1) ... [2019-01-01 19:39:56,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:39:56" (1/1) ... [2019-01-01 19:39:56,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:39:56" (1/1) ... [2019-01-01 19:39:56,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:39:56" (1/1) ... [2019-01-01 19:39:56,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:39:56" (1/1) ... [2019-01-01 19:39:56,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 19:39:56,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 19:39:56,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 19:39:56,176 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 19:39:56,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:39:56" (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:39:56,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 19:39:56,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 19:39:56,243 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 19:39:56,243 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 19:39:56,243 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-01 19:39:56,243 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-01-01 19:39:56,243 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-01-01 19:39:56,243 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-01-01 19:39:56,243 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2019-01-01 19:39:56,244 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2019-01-01 19:39:56,244 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 19:39:56,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 19:39:56,244 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 19:39:56,244 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 19:39:56,244 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 19:39:56,244 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 19:39:56,245 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 19:39:56,245 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 19:39:56,245 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 19:39:56,245 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 19:39:56,245 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 19:39:56,245 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 19:39:56,245 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 19:39:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 19:39:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 19:39:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 19:39:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 19:39:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 19:39:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 19:39:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 19:39:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 19:39:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 19:39:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 19:39:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 19:39:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 19:39:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 19:39:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 19:39:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 19:39:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 19:39:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 19:39:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 19:39:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 19:39:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 19:39:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 19:39:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 19:39:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 19:39:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 19:39:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 19:39:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 19:39:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 19:39:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 19:39:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 19:39:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 19:39:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 19:39:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 19:39:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 19:39:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 19:39:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 19:39:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 19:39:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 19:39:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 19:39:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 19:39:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 19:39:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 19:39:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 19:39:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 19:39:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 19:39:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 19:39:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 19:39:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 19:39:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 19:39:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 19:39:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-01 19:39:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 19:39:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 19:39:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-01 19:39:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 19:39:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 19:39:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-01 19:39:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 19:39:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 19:39:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 19:39:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 19:39:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 19:39:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 19:39:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 19:39:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 19:39:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 19:39:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 19:39:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 19:39:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 19:39:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 19:39:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 19:39:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 19:39:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 19:39:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 19:39:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 19:39:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 19:39:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 19:39:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 19:39:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 19:39:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 19:39:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 19:39:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 19:39:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 19:39:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 19:39:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 19:39:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 19:39:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 19:39:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 19:39:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 19:39:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 19:39:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 19:39:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 19:39:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 19:39:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 19:39:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 19:39:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-01 19:39:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-01-01 19:39:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 19:39:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 19:39:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 19:39:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-01-01 19:39:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-01-01 19:39:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 19:39:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 19:39:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2019-01-01 19:39:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 19:39:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2019-01-01 19:39:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 19:39:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 19:39:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 19:39:57,142 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 19:39:57,142 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 19:39:57,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:39:57 BoogieIcfgContainer [2019-01-01 19:39:57,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 19:39:57,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 19:39:57,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 19:39:57,148 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 19:39:57,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 07:39:55" (1/3) ... [2019-01-01 19:39:57,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3e7a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:39:57, skipping insertion in model container [2019-01-01 19:39:57,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:39:56" (2/3) ... [2019-01-01 19:39:57,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3e7a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:39:57, skipping insertion in model container [2019-01-01 19:39:57,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:39:57" (3/3) ... [2019-01-01 19:39:57,152 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-01 19:39:57,161 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 19:39:57,170 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-01-01 19:39:57,189 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-01-01 19:39:57,219 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 19:39:57,220 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 19:39:57,220 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 19:39:57,220 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 19:39:57,220 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 19:39:57,221 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 19:39:57,221 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 19:39:57,221 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 19:39:57,221 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 19:39:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-01-01 19:39:57,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 19:39:57,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:57,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:57,256 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:57,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:57,262 INFO L82 PathProgramCache]: Analyzing trace with hash 360562924, now seen corresponding path program 1 times [2019-01-01 19:39:57,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:57,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:57,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:57,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:57,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:57,491 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:39:57,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:39:57,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:39:57,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:39:57,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:39:57,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:39:57,520 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2019-01-01 19:39:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:57,784 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2019-01-01 19:39:57,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:39:57,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-01 19:39:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:57,795 INFO L225 Difference]: With dead ends: 86 [2019-01-01 19:39:57,796 INFO L226 Difference]: Without dead ends: 79 [2019-01-01 19:39:57,797 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:39:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-01 19:39:57,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-01 19:39:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-01 19:39:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-01-01 19:39:57,841 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 13 [2019-01-01 19:39:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:57,841 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-01-01 19:39:57,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:39:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-01-01 19:39:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 19:39:57,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:57,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:57,844 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:57,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:57,844 INFO L82 PathProgramCache]: Analyzing trace with hash 360562925, now seen corresponding path program 1 times [2019-01-01 19:39:57,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:57,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:57,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:57,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:57,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:58,042 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-01 19:39:58,045 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:39:58,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:39:58,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:39:58,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:39:58,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:39:58,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:39:58,049 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 3 states. [2019-01-01 19:39:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:58,126 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-01-01 19:39:58,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:39:58,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-01 19:39:58,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:58,129 INFO L225 Difference]: With dead ends: 77 [2019-01-01 19:39:58,129 INFO L226 Difference]: Without dead ends: 77 [2019-01-01 19:39:58,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:39:58,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-01 19:39:58,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-01 19:39:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-01 19:39:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-01-01 19:39:58,141 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 13 [2019-01-01 19:39:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:58,142 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-01-01 19:39:58,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:39:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-01-01 19:39:58,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 19:39:58,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:58,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:58,143 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:58,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:58,144 INFO L82 PathProgramCache]: Analyzing trace with hash -611679416, now seen corresponding path program 1 times [2019-01-01 19:39:58,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:58,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:58,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:58,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:58,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:58,235 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:39:58,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:39:58,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:39:58,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:39:58,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:39:58,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:39:58,238 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-01-01 19:39:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:58,606 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2019-01-01 19:39:58,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:39:58,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-01-01 19:39:58,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:58,612 INFO L225 Difference]: With dead ends: 88 [2019-01-01 19:39:58,612 INFO L226 Difference]: Without dead ends: 85 [2019-01-01 19:39:58,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:39:58,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-01 19:39:58,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2019-01-01 19:39:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-01 19:39:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-01-01 19:39:58,626 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 18 [2019-01-01 19:39:58,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:58,627 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-01-01 19:39:58,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:39:58,627 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-01-01 19:39:58,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 19:39:58,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:58,628 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:39:58,628 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:58,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:58,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1012902948, now seen corresponding path program 1 times [2019-01-01 19:39:58,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:58,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:58,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:58,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:58,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:58,831 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:39:58,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:39:58,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:39:58,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:39:58,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:39:58,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:39:58,833 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 6 states. [2019-01-01 19:39:59,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:59,107 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-01-01 19:39:59,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:39:59,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-01 19:39:59,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:59,111 INFO L225 Difference]: With dead ends: 78 [2019-01-01 19:39:59,111 INFO L226 Difference]: Without dead ends: 78 [2019-01-01 19:39:59,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 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:39:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-01 19:39:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-01-01 19:39:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-01 19:39:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-01-01 19:39:59,120 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 19 [2019-01-01 19:39:59,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:59,120 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-01-01 19:39:59,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:39:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-01-01 19:39:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 19:39:59,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:59,122 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:39:59,122 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:59,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:59,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1012902949, now seen corresponding path program 1 times [2019-01-01 19:39:59,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:59,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:59,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:59,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:59,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:59,333 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:39:59,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:39:59,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:39:59,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:39:59,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:39:59,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:39:59,334 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2019-01-01 19:39:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:59,566 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-01-01 19:39:59,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:39:59,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-01 19:39:59,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:59,568 INFO L225 Difference]: With dead ends: 77 [2019-01-01 19:39:59,568 INFO L226 Difference]: Without dead ends: 77 [2019-01-01 19:39:59,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 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:39:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-01 19:39:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-01-01 19:39:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-01 19:39:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-01-01 19:39:59,576 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 19 [2019-01-01 19:39:59,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:59,577 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-01-01 19:39:59,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:39:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-01-01 19:39:59,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 19:39:59,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:59,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:59,579 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:59,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:59,580 INFO L82 PathProgramCache]: Analyzing trace with hash -343567322, now seen corresponding path program 1 times [2019-01-01 19:39:59,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:59,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:59,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:59,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:59,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:39:59,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:39:59,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:39:59,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:39:59,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:39:59,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:39:59,852 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 12 states. [2019-01-01 19:40:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:40:00,465 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-01-01 19:40:00,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:40:00,467 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-01-01 19:40:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:40:00,469 INFO L225 Difference]: With dead ends: 82 [2019-01-01 19:40:00,469 INFO L226 Difference]: Without dead ends: 82 [2019-01-01 19:40:00,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:40:00,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-01 19:40:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-01-01 19:40:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-01 19:40:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2019-01-01 19:40:00,477 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 31 [2019-01-01 19:40:00,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:40:00,477 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2019-01-01 19:40:00,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:40:00,477 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2019-01-01 19:40:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 19:40:00,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:40:00,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:40:00,479 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:40:00,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:40:00,479 INFO L82 PathProgramCache]: Analyzing trace with hash -343567321, now seen corresponding path program 1 times [2019-01-01 19:40:00,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:40:00,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:40:00,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:00,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:40:00,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:00,720 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:40:00,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:40:00,721 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:40:00,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:40:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:00,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:40:00,838 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:40:00,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:40:00,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 19:40:00,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:40:00,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:40:00,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:40:00,861 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 6 states. [2019-01-01 19:40:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:40:00,947 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2019-01-01 19:40:00,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:40:00,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-01-01 19:40:00,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:40:00,949 INFO L225 Difference]: With dead ends: 93 [2019-01-01 19:40:00,949 INFO L226 Difference]: Without dead ends: 90 [2019-01-01 19:40:00,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:40:00,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-01 19:40:00,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2019-01-01 19:40:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-01 19:40:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-01-01 19:40:00,958 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 31 [2019-01-01 19:40:00,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:40:00,959 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-01-01 19:40:00,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:40:00,959 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-01-01 19:40:00,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 19:40:00,961 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:40:00,961 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:40:00,962 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:40:00,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:40:00,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1504093175, now seen corresponding path program 2 times [2019-01-01 19:40:00,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:40:00,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:40:00,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:00,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:40:00,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:01,144 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:40:01,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:40:01,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 19:40:01,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:40:01,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:40:01,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:40:01,146 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 6 states. [2019-01-01 19:40:01,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:40:01,378 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2019-01-01 19:40:01,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:40:01,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-01-01 19:40:01,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:40:01,381 INFO L225 Difference]: With dead ends: 106 [2019-01-01 19:40:01,381 INFO L226 Difference]: Without dead ends: 106 [2019-01-01 19:40:01,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:40:01,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-01 19:40:01,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2019-01-01 19:40:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-01 19:40:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2019-01-01 19:40:01,400 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 44 [2019-01-01 19:40:01,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:40:01,401 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2019-01-01 19:40:01,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:40:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2019-01-01 19:40:01,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 19:40:01,402 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:40:01,402 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:40:01,403 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:40:01,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:40:01,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1504093120, now seen corresponding path program 1 times [2019-01-01 19:40:01,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:40:01,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:40:01,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:01,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:40:01,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:02,174 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-01 19:40:02,331 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:40:02,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:40:02,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 19:40:02,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 19:40:02,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 19:40:02,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:40:02,333 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand 13 states. [2019-01-01 19:40:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:40:02,967 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2019-01-01 19:40:02,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 19:40:02,968 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-01-01 19:40:02,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:40:02,970 INFO L225 Difference]: With dead ends: 101 [2019-01-01 19:40:02,970 INFO L226 Difference]: Without dead ends: 101 [2019-01-01 19:40:02,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-01-01 19:40:02,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-01 19:40:02,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-01-01 19:40:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-01 19:40:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-01-01 19:40:02,977 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 44 [2019-01-01 19:40:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:40:02,978 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-01-01 19:40:02,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 19:40:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-01-01 19:40:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 19:40:02,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:40:02,980 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:40:02,980 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:40:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:40:02,980 INFO L82 PathProgramCache]: Analyzing trace with hash 955614394, now seen corresponding path program 1 times [2019-01-01 19:40:02,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:40:02,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:40:02,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:02,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:40:02,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:03,371 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-01 19:40:04,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:40:04,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:40:04,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 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:40:04,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:40:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:04,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:40:11,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-01 19:40:11,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:11,995 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 1 xjuncts. [2019-01-01 19:40:11,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-01 19:40:12,030 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:12,033 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:12,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:12,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:12,041 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:12,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-01-01 19:40:14,904 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 21 treesize of output 17 [2019-01-01 19:40:14,908 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 17 treesize of output 5 [2019-01-01 19:40:14,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:14,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:14,915 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:40:14,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-01-01 19:40:14,948 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:40:14,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:40:14,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 30 [2019-01-01 19:40:14,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-01 19:40:14,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-01 19:40:14,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=835, Unknown=23, NotChecked=0, Total=930 [2019-01-01 19:40:14,970 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 31 states. [2019-01-01 19:40:15,302 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2019-01-01 19:40:15,924 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 19:40:16,358 WARN L181 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 19:40:17,078 WARN L181 SmtUtils]: Spent 651.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 19:40:50,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:40:50,203 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2019-01-01 19:40:50,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-01 19:40:50,204 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 47 [2019-01-01 19:40:50,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:40:50,207 INFO L225 Difference]: With dead ends: 130 [2019-01-01 19:40:50,207 INFO L226 Difference]: Without dead ends: 130 [2019-01-01 19:40:50,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=208, Invalid=2005, Unknown=43, NotChecked=0, Total=2256 [2019-01-01 19:40:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-01 19:40:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 101. [2019-01-01 19:40:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-01 19:40:50,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2019-01-01 19:40:50,226 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 47 [2019-01-01 19:40:50,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:40:50,226 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2019-01-01 19:40:50,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-01 19:40:50,227 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2019-01-01 19:40:50,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 19:40:50,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:40:50,228 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:40:50,228 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:40:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:40:50,234 INFO L82 PathProgramCache]: Analyzing trace with hash 955614395, now seen corresponding path program 1 times [2019-01-01 19:40:50,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:40:50,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:40:50,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:50,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:40:50,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:51,306 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:40:51,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:40:51,307 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:40:51,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:40:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:51,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:40:51,367 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:40:51,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:51,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:51,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 19:40:51,959 WARN L860 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base Int)) (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base 8))) is different from true [2019-01-01 19:40:51,968 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 19 treesize of output 14 [2019-01-01 19:40:51,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:51,975 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 1 xjuncts. [2019-01-01 19:40:51,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2019-01-01 19:40:52,020 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:52,023 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:52,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:52,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:52,040 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:52,043 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:52,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:52,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:52,059 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:40:52,059 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:40 [2019-01-01 19:40:52,422 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 40 treesize of output 34 [2019-01-01 19:40:52,426 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 34 treesize of output 19 [2019-01-01 19:40:52,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:52,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:52,442 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 32 treesize of output 26 [2019-01-01 19:40:52,446 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 11 [2019-01-01 19:40:52,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:40:52,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:40:52,457 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:40:52,457 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:16 [2019-01-01 19:40:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-01-01 19:40:52,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:40:52,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 38 [2019-01-01 19:40:52,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-01 19:40:52,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-01 19:40:52,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1324, Unknown=1, NotChecked=72, Total=1482 [2019-01-01 19:40:52,605 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 39 states. [2019-01-01 19:40:53,703 WARN L181 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-01-01 19:40:54,688 WARN L181 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-01-01 19:40:55,498 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-01-01 19:40:58,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:40:58,419 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2019-01-01 19:40:58,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 19:40:58,420 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 47 [2019-01-01 19:40:58,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:40:58,423 INFO L225 Difference]: With dead ends: 155 [2019-01-01 19:40:58,423 INFO L226 Difference]: Without dead ends: 155 [2019-01-01 19:40:58,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=210, Invalid=2445, Unknown=1, NotChecked=100, Total=2756 [2019-01-01 19:40:58,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-01 19:40:58,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 116. [2019-01-01 19:40:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-01 19:40:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2019-01-01 19:40:58,434 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 47 [2019-01-01 19:40:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:40:58,434 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2019-01-01 19:40:58,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-01 19:40:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2019-01-01 19:40:58,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-01 19:40:58,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:40:58,438 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-01 19:40:58,438 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:40:58,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:40:58,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1666795208, now seen corresponding path program 2 times [2019-01-01 19:40:58,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:40:58,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:40:58,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:58,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:40:58,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 19:40:58,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:40:58,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 19:40:58,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:40:58,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:40:58,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:40:58,573 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand 7 states. [2019-01-01 19:40:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:40:58,637 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2019-01-01 19:40:58,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:40:58,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-01-01 19:40:58,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:40:58,645 INFO L225 Difference]: With dead ends: 92 [2019-01-01 19:40:58,645 INFO L226 Difference]: Without dead ends: 92 [2019-01-01 19:40:58,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:40:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-01 19:40:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-01 19:40:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-01 19:40:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2019-01-01 19:40:58,651 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 50 [2019-01-01 19:40:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:40:58,653 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2019-01-01 19:40:58,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:40:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2019-01-01 19:40:58,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-01 19:40:58,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:40:58,655 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, 1, 1, 1, 1, 1] [2019-01-01 19:40:58,657 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:40:58,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:40:58,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1828517252, now seen corresponding path program 1 times [2019-01-01 19:40:58,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:40:58,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:40:58,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:58,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:40:58,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-01 19:40:58,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:40:58,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:40:58,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:40:58,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:40:58,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:40:58,853 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 12 states. [2019-01-01 19:40:59,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:40:59,369 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2019-01-01 19:40:59,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:40:59,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-01-01 19:40:59,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:40:59,372 INFO L225 Difference]: With dead ends: 97 [2019-01-01 19:40:59,372 INFO L226 Difference]: Without dead ends: 97 [2019-01-01 19:40:59,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:40:59,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-01 19:40:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-01-01 19:40:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-01 19:40:59,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2019-01-01 19:40:59,378 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 57 [2019-01-01 19:40:59,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:40:59,378 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2019-01-01 19:40:59,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:40:59,379 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2019-01-01 19:40:59,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-01 19:40:59,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:40:59,380 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, 1, 1, 1, 1, 1] [2019-01-01 19:40:59,380 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:40:59,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:40:59,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1828517253, now seen corresponding path program 1 times [2019-01-01 19:40:59,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:40:59,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:40:59,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:59,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:40:59,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-01 19:40:59,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:40:59,628 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:40:59,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:40:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:59,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:40:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-01 19:40:59,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:40:59,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 19:40:59,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:40:59,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:40:59,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:40:59,719 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 5 states. [2019-01-01 19:40:59,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:40:59,907 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2019-01-01 19:40:59,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:40:59,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-01-01 19:40:59,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:40:59,910 INFO L225 Difference]: With dead ends: 102 [2019-01-01 19:40:59,910 INFO L226 Difference]: Without dead ends: 102 [2019-01-01 19:40:59,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:40:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-01 19:40:59,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-01 19:40:59,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-01 19:40:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2019-01-01 19:40:59,914 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 57 [2019-01-01 19:40:59,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:40:59,915 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2019-01-01 19:40:59,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:40:59,915 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2019-01-01 19:40:59,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-01 19:40:59,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:40:59,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:40:59,917 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:40:59,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:40:59,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1316396204, now seen corresponding path program 1 times [2019-01-01 19:40:59,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:40:59,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:40:59,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:59,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:40:59,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-01 19:41:00,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:41:00,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 19:41:00,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:41:00,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:41:00,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:41:00,099 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 7 states. [2019-01-01 19:41:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:41:00,213 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2019-01-01 19:41:00,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:41:00,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-01-01 19:41:00,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:41:00,216 INFO L225 Difference]: With dead ends: 97 [2019-01-01 19:41:00,216 INFO L226 Difference]: Without dead ends: 97 [2019-01-01 19:41:00,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:41:00,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-01 19:41:00,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-01 19:41:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-01 19:41:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2019-01-01 19:41:00,221 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 58 [2019-01-01 19:41:00,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:41:00,221 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2019-01-01 19:41:00,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:41:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2019-01-01 19:41:00,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-01 19:41:00,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:41:00,222 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, 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:00,222 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:41:00,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:41:00,223 INFO L82 PathProgramCache]: Analyzing trace with hash 953803641, now seen corresponding path program 2 times [2019-01-01 19:41:00,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:41:00,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:41:00,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:00,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:00,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-01 19:41:00,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:41:00,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 19:41:00,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:41:00,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:41:00,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:41:00,384 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 6 states. [2019-01-01 19:41:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:41:00,450 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2019-01-01 19:41:00,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:41:00,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-01-01 19:41:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:41:00,453 INFO L225 Difference]: With dead ends: 111 [2019-01-01 19:41:00,453 INFO L226 Difference]: Without dead ends: 111 [2019-01-01 19:41:00,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:41:00,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-01 19:41:00,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2019-01-01 19:41:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 19:41:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2019-01-01 19:41:00,458 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 65 [2019-01-01 19:41:00,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:41:00,458 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2019-01-01 19:41:00,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:41:00,459 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2019-01-01 19:41:00,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-01 19:41:00,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:41:00,459 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, 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:00,460 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:41:00,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:41:00,460 INFO L82 PathProgramCache]: Analyzing trace with hash 953803696, now seen corresponding path program 1 times [2019-01-01 19:41:00,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:41:00,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:41:00,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:00,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:41:00,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:00,891 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 19:41:00,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:41:00,891 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:41:00,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:00,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:41:01,464 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 19:41:01,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:41:01,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 27 [2019-01-01 19:41:01,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-01 19:41:01,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-01 19:41:01,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2019-01-01 19:41:01,485 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand 28 states. [2019-01-01 19:41:02,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:41:02,113 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2019-01-01 19:41:02,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 19:41:02,114 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 65 [2019-01-01 19:41:02,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:41:02,115 INFO L225 Difference]: With dead ends: 113 [2019-01-01 19:41:02,115 INFO L226 Difference]: Without dead ends: 113 [2019-01-01 19:41:02,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2019-01-01 19:41:02,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-01 19:41:02,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2019-01-01 19:41:02,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 19:41:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2019-01-01 19:41:02,119 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 65 [2019-01-01 19:41:02,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:41:02,120 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2019-01-01 19:41:02,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-01 19:41:02,120 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2019-01-01 19:41:02,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-01 19:41:02,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:41:02,121 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, 1, 1, 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:02,121 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:41:02,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:41:02,121 INFO L82 PathProgramCache]: Analyzing trace with hash -737720004, now seen corresponding path program 1 times [2019-01-01 19:41:02,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:41:02,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:41:02,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:02,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:02,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:41:02,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:41:02,890 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:41:02,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:02,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:41:03,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:03,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:03,149 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:41:03,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:03,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:03,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-01 19:41:03,206 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:41:03,220 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:41:03,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:03,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:03,344 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:03,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-01-01 19:41:05,568 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 19:41:05,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:05,590 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 55 treesize of output 59 [2019-01-01 19:41:05,602 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 24 treesize of output 1 [2019-01-01 19:41:05,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:05,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:05,639 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:05,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:25 [2019-01-01 19:41:05,700 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 20 treesize of output 16 [2019-01-01 19:41:05,704 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:41:05,705 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 16 treesize of output 15 [2019-01-01 19:41:05,705 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:41:05,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:41:05,724 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:05,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-01-01 19:41:05,946 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 37 treesize of output 30 [2019-01-01 19:41:05,964 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:41:05,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:05,967 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 30 treesize of output 35 [2019-01-01 19:41:05,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:05,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:05,987 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:05,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2019-01-01 19:41:06,131 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 21 [2019-01-01 19:41:06,133 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:41:06,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-01 19:41:06,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:06,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:06,145 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:06,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:5 [2019-01-01 19:41:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 19:41:06,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:41:06,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 41 [2019-01-01 19:41:06,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-01 19:41:06,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-01 19:41:06,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1609, Unknown=0, NotChecked=0, Total=1722 [2019-01-01 19:41:06,227 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 42 states. [2019-01-01 19:41:09,654 WARN L181 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 19:41:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:41:11,252 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2019-01-01 19:41:11,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-01 19:41:11,254 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 68 [2019-01-01 19:41:11,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:41:11,256 INFO L225 Difference]: With dead ends: 138 [2019-01-01 19:41:11,256 INFO L226 Difference]: Without dead ends: 138 [2019-01-01 19:41:11,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 49 SyntacticMatches, 14 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=349, Invalid=3811, Unknown=0, NotChecked=0, Total=4160 [2019-01-01 19:41:11,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-01 19:41:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 115. [2019-01-01 19:41:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-01 19:41:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2019-01-01 19:41:11,262 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 68 [2019-01-01 19:41:11,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:41:11,263 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2019-01-01 19:41:11,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-01 19:41:11,263 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2019-01-01 19:41:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-01 19:41:11,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:41:11,264 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, 1, 1, 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:11,264 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:41:11,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:41:11,265 INFO L82 PathProgramCache]: Analyzing trace with hash -737720003, now seen corresponding path program 1 times [2019-01-01 19:41:11,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:41:11,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:41:11,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:11,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:11,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:11,588 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-01 19:41:13,012 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:41:13,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:41:13,012 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:41:13,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:13,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:41:13,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:13,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:13,512 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:41:13,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:13,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:13,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-01-01 19:41:13,606 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:41:13,610 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:41:13,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:13,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:13,630 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:41:13,632 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:41:13,632 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:13,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:13,648 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:13,648 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:17 [2019-01-01 19:41:14,303 INFO L303 Elim1Store]: Index analysis took 102 ms [2019-01-01 19:41:14,305 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 119 treesize of output 120 [2019-01-01 19:41:14,320 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 36 treesize of output 1 [2019-01-01 19:41:14,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:14,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:14,440 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 75 treesize of output 69 [2019-01-01 19:41:14,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 36 treesize of output 1 [2019-01-01 19:41:14,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:14,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:14,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:14,464 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:135, output treesize:45 [2019-01-01 19:41:14,547 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 29 treesize of output 25 [2019-01-01 19:41:14,551 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 25 treesize of output 17 [2019-01-01 19:41:14,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:14,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:14,589 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 22 treesize of output 18 [2019-01-01 19:41:14,593 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 18 treesize of output 10 [2019-01-01 19:41:14,596 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:41:14,602 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:41:14,614 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 1 xjuncts. [2019-01-01 19:41:14,615 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:12 [2019-01-01 19:41:20,883 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2019-01-01 19:41:20,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2019-01-01 19:41:20,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:20,904 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 37 treesize of output 35 [2019-01-01 19:41:20,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:20,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:20,941 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 45 treesize of output 38 [2019-01-01 19:41:20,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:20,946 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2019-01-01 19:41:20,947 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:20,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:20,975 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:20,975 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:50 [2019-01-01 19:41:21,215 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 39 treesize of output 33 [2019-01-01 19:41:21,222 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 33 treesize of output 18 [2019-01-01 19:41:21,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:21,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:21,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 26 [2019-01-01 19:41:21,252 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 11 [2019-01-01 19:41:21,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:21,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:21,292 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:21,293 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:11 [2019-01-01 19:41:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 19:41:21,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:41:21,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 57 [2019-01-01 19:41:21,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-01 19:41:21,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-01 19:41:21,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3134, Unknown=2, NotChecked=0, Total=3306 [2019-01-01 19:41:21,443 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand 58 states. [2019-01-01 19:41:26,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:41:26,263 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2019-01-01 19:41:26,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-01 19:41:26,264 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 68 [2019-01-01 19:41:26,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:41:26,266 INFO L225 Difference]: With dead ends: 141 [2019-01-01 19:41:26,266 INFO L226 Difference]: Without dead ends: 141 [2019-01-01 19:41:26,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=469, Invalid=6009, Unknown=2, NotChecked=0, Total=6480 [2019-01-01 19:41:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-01 19:41:26,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 114. [2019-01-01 19:41:26,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 19:41:26,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2019-01-01 19:41:26,274 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 68 [2019-01-01 19:41:26,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:41:26,275 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2019-01-01 19:41:26,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-01 19:41:26,275 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2019-01-01 19:41:26,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-01 19:41:26,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:41:26,276 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, 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:41:26,276 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:41:26,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:41:26,276 INFO L82 PathProgramCache]: Analyzing trace with hash -67314440, now seen corresponding path program 2 times [2019-01-01 19:41:26,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:41:26,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:41:26,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:26,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:26,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-01 19:41:26,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:41:26,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 19:41:26,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:41:26,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:41:26,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:41:26,455 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 7 states. [2019-01-01 19:41:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:41:26,579 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2019-01-01 19:41:26,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:41:26,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-01-01 19:41:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:41:26,582 INFO L225 Difference]: With dead ends: 100 [2019-01-01 19:41:26,582 INFO L226 Difference]: Without dead ends: 100 [2019-01-01 19:41:26,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:41:26,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-01 19:41:26,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-01 19:41:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-01 19:41:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-01-01 19:41:26,590 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 71 [2019-01-01 19:41:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:41:26,590 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-01-01 19:41:26,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:41:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-01-01 19:41:26,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-01 19:41:26,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:41:26,591 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, 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:41:26,591 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:41:26,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:41:26,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1871003433, now seen corresponding path program 1 times [2019-01-01 19:41:26,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:41:26,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:41:26,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:26,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:41:26,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-01 19:41:27,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:41:27,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:41:27,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:41:27,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:41:27,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:41:27,422 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 12 states. [2019-01-01 19:41:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:41:27,733 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2019-01-01 19:41:27,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 19:41:27,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-01-01 19:41:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:41:27,736 INFO L225 Difference]: With dead ends: 113 [2019-01-01 19:41:27,736 INFO L226 Difference]: Without dead ends: 113 [2019-01-01 19:41:27,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:41:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-01 19:41:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2019-01-01 19:41:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-01 19:41:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2019-01-01 19:41:27,741 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 90 [2019-01-01 19:41:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:41:27,741 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2019-01-01 19:41:27,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:41:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2019-01-01 19:41:27,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-01 19:41:27,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:41:27,742 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, 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:41:27,743 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:41:27,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:41:27,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1871003432, now seen corresponding path program 1 times [2019-01-01 19:41:27,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:41:27,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:41:27,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:27,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:27,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:28,224 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-01 19:41:28,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:41:28,225 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:41:28,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:28,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:41:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-01 19:41:28,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:41:28,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 20 [2019-01-01 19:41:28,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-01 19:41:28,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 19:41:28,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-01-01 19:41:28,692 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand 21 states. [2019-01-01 19:41:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:41:29,192 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2019-01-01 19:41:29,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 19:41:29,196 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 90 [2019-01-01 19:41:29,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:41:29,197 INFO L225 Difference]: With dead ends: 109 [2019-01-01 19:41:29,197 INFO L226 Difference]: Without dead ends: 109 [2019-01-01 19:41:29,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 74 SyntacticMatches, 14 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-01-01 19:41:29,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-01 19:41:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-01-01 19:41:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-01 19:41:29,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2019-01-01 19:41:29,201 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 90 [2019-01-01 19:41:29,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:41:29,202 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2019-01-01 19:41:29,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-01 19:41:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2019-01-01 19:41:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 19:41:29,203 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:41:29,203 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, 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:29,203 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:41:29,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:41:29,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1020976587, now seen corresponding path program 1 times [2019-01-01 19:41:29,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:41:29,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:41:29,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:29,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:29,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-01 19:41:29,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:41:29,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-01 19:41:29,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 19:41:29,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 19:41:29,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:41:29,999 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 13 states. [2019-01-01 19:41:30,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:41:30,243 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2019-01-01 19:41:30,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 19:41:30,245 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-01-01 19:41:30,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:41:30,246 INFO L225 Difference]: With dead ends: 108 [2019-01-01 19:41:30,247 INFO L226 Difference]: Without dead ends: 106 [2019-01-01 19:41:30,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-01-01 19:41:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-01 19:41:30,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2019-01-01 19:41:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-01 19:41:30,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2019-01-01 19:41:30,252 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 93 [2019-01-01 19:41:30,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:41:30,253 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2019-01-01 19:41:30,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 19:41:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2019-01-01 19:41:30,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 19:41:30,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:41:30,258 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, 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:30,258 INFO L423 AbstractCegarLoop]: === Iteration 24 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:41:30,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:41:30,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1022303986, now seen corresponding path program 1 times [2019-01-01 19:41:30,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:41:30,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:41:30,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:30,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:30,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-01 19:41:31,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:41:31,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:41:31,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:41:31,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:41:31,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:41:31,078 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand 12 states. [2019-01-01 19:41:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:41:31,434 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2019-01-01 19:41:31,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 19:41:31,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-01-01 19:41:31,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:41:31,437 INFO L225 Difference]: With dead ends: 104 [2019-01-01 19:41:31,437 INFO L226 Difference]: Without dead ends: 104 [2019-01-01 19:41:31,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-01-01 19:41:31,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-01 19:41:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-01 19:41:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 19:41:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2019-01-01 19:41:31,444 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 93 [2019-01-01 19:41:31,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:41:31,444 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2019-01-01 19:41:31,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:41:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2019-01-01 19:41:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-01 19:41:31,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:41:31,445 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, 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:41:31,449 INFO L423 AbstractCegarLoop]: === Iteration 25 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:41:31,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:41:31,450 INFO L82 PathProgramCache]: Analyzing trace with hash -154974852, now seen corresponding path program 1 times [2019-01-01 19:41:31,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:41:31,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:41:31,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:31,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:31,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 19:41:32,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:41:32,784 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:41:32,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:32,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:41:33,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:33,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:33,778 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:41:33,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:33,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:33,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-01 19:41:33,798 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:41:33,801 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:41:33,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:33,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:33,810 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:33,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-01-01 19:41:36,526 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 19:41:36,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:36,564 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 55 treesize of output 59 [2019-01-01 19:41:36,576 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 24 treesize of output 1 [2019-01-01 19:41:36,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:36,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:36,603 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:36,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:25 [2019-01-01 19:41:36,673 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 22 treesize of output 18 [2019-01-01 19:41:36,681 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 18 treesize of output 10 [2019-01-01 19:41:36,682 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:41:36,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:41:36,694 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:36,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2019-01-01 19:41:36,845 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 37 treesize of output 30 [2019-01-01 19:41:36,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:36,849 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-01-01 19:41:36,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:36,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:36,864 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:36,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:27 [2019-01-01 19:41:37,299 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 31 treesize of output 25 [2019-01-01 19:41:37,307 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 25 treesize of output 22 [2019-01-01 19:41:37,309 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:37,321 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:37,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:41:37,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:29 [2019-01-01 19:41:37,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:37,491 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-01 19:41:37,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:37,501 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 1 xjuncts. [2019-01-01 19:41:37,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-01-01 19:41:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 19:41:37,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:41:37,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 47 [2019-01-01 19:41:37,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-01 19:41:37,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-01 19:41:37,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2120, Unknown=0, NotChecked=0, Total=2256 [2019-01-01 19:41:37,593 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 48 states. [2019-01-01 19:41:38,876 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-01 19:41:41,333 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 19:41:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:41:45,172 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-01-01 19:41:45,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-01 19:41:45,174 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2019-01-01 19:41:45,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:41:45,175 INFO L225 Difference]: With dead ends: 121 [2019-01-01 19:41:45,176 INFO L226 Difference]: Without dead ends: 121 [2019-01-01 19:41:45,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 70 SyntacticMatches, 17 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=406, Invalid=4996, Unknown=0, NotChecked=0, Total=5402 [2019-01-01 19:41:45,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-01 19:41:45,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2019-01-01 19:41:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 19:41:45,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-01-01 19:41:45,181 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 96 [2019-01-01 19:41:45,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:41:45,184 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-01-01 19:41:45,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-01 19:41:45,184 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-01-01 19:41:45,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-01 19:41:45,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:41:45,185 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, 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:41:45,185 INFO L423 AbstractCegarLoop]: === Iteration 26 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:41:45,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:41:45,186 INFO L82 PathProgramCache]: Analyzing trace with hash -154974851, now seen corresponding path program 1 times [2019-01-01 19:41:45,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:41:45,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:41:45,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:45,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:45,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:41:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:46,083 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-01-01 19:41:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 19:41:46,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:41:46,848 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:41:46,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:41:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:41:46,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:41:47,098 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:41:47,101 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:41:47,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:47,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:47,127 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:41:47,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:41:47,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:47,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:47,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:47,147 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2019-01-01 19:41:47,878 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 19:41:47,908 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 25 treesize of output 20 [2019-01-01 19:41:47,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:47,930 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:41:47,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:47,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:47,960 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 25 treesize of output 20 [2019-01-01 19:41:47,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:47,969 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:41:47,969 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:47,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:47,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:47,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:36 [2019-01-01 19:41:48,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:48,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 19:41:48,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:48,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:48,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:41:48,149 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:41:48,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:48,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:48,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2019-01-01 19:41:48,353 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:41:48,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-01 19:41:48,357 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 9 [2019-01-01 19:41:48,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:48,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:48,382 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 23 treesize of output 18 [2019-01-01 19:41:48,386 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 18 treesize of output 9 [2019-01-01 19:41:48,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:48,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:48,405 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:41:48,406 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:42 [2019-01-01 19:41:48,722 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 22 treesize of output 18 [2019-01-01 19:41:48,725 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 18 treesize of output 10 [2019-01-01 19:41:48,726 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:41:48,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:41:48,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 treesize of output 7 [2019-01-01 19:41:48,757 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:48,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:41:48,760 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:41:48,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:41:48,776 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:21 [2019-01-01 19:42:23,301 WARN L181 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 19:42:23,314 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 88 treesize of output 82 [2019-01-01 19:42:23,319 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 24 treesize of output 1 [2019-01-01 19:42:23,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:23,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:23,361 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 43 treesize of output 44 [2019-01-01 19:42:23,365 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 24 treesize of output 1 [2019-01-01 19:42:23,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:23,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:23,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:23,389 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:122, output treesize:56 [2019-01-01 19:42:23,454 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 22 treesize of output 18 [2019-01-01 19:42:23,456 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 18 treesize of output 10 [2019-01-01 19:42:23,456 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:23,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:23,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 treesize of output 7 [2019-01-01 19:42:23,506 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:23,507 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:23,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:23,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:23,523 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:21 [2019-01-01 19:42:23,693 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 37 treesize of output 30 [2019-01-01 19:42:23,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:23,700 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-01-01 19:42:23,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:23,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:23,737 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 25 treesize of output 20 [2019-01-01 19:42:23,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:23,743 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:42:23,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:23,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:23,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-01 19:42:23,768 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:86, output treesize:56 [2019-01-01 19:42:24,401 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 31 treesize of output 25 [2019-01-01 19:42:24,411 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 25 treesize of output 22 [2019-01-01 19:42:24,412 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:42:24,426 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:42:24,454 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:42:24,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-01 19:42:24,467 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-01 19:42:24,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:42:24,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2019-01-01 19:42:24,504 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:94 [2019-01-01 19:42:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-01 19:42:25,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:42:25,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 35] total 59 [2019-01-01 19:42:25,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-01 19:42:25,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-01 19:42:25,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=3334, Unknown=13, NotChecked=0, Total=3540 [2019-01-01 19:42:25,213 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 60 states. [2019-01-01 19:42:26,875 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-01-01 19:42:30,047 WARN L181 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 43 [2019-01-01 19:42:31,186 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2019-01-01 19:42:32,683 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2019-01-01 19:42:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:42:32,748 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2019-01-01 19:42:32,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-01 19:42:32,749 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 96 [2019-01-01 19:42:32,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:42:32,751 INFO L225 Difference]: With dead ends: 118 [2019-01-01 19:42:32,751 INFO L226 Difference]: Without dead ends: 118 [2019-01-01 19:42:32,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 63 SyntacticMatches, 13 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1705 ImplicationChecksByTransitivity, 43.6s TimeCoverageRelationStatistics Valid=537, Invalid=6760, Unknown=13, NotChecked=0, Total=7310 [2019-01-01 19:42:32,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-01 19:42:32,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2019-01-01 19:42:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 19:42:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2019-01-01 19:42:32,764 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 96 [2019-01-01 19:42:32,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:42:32,767 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2019-01-01 19:42:32,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-01 19:42:32,767 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2019-01-01 19:42:32,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-01 19:42:32,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:42:32,770 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, 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, 1] [2019-01-01 19:42:32,770 INFO L423 AbstractCegarLoop]: === Iteration 27 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:42:32,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:42:32,774 INFO L82 PathProgramCache]: Analyzing trace with hash 232708870, now seen corresponding path program 1 times [2019-01-01 19:42:32,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:42:32,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:42:32,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:42:32,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:42:32,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:42:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:42:34,003 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 19:42:34,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:42:34,003 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:42:34,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:42:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:42:34,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:42:34,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:34,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:34,661 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:42:34,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:34,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:34,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-01-01 19:42:34,687 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:42:34,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:34,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:34,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:34,702 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:42:34,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2019-01-01 19:42:36,888 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (+ |c_sll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| .cse0) sll_update_at_~head.offset)))))) is different from true [2019-01-01 19:42:36,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:36,905 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 54 treesize of output 58 [2019-01-01 19:42:36,909 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 24 treesize of output 1 [2019-01-01 19:42:36,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:36,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:36,923 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:42:36,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:24 [2019-01-01 19:42:37,006 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 36 treesize of output 29 [2019-01-01 19:42:37,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:42:37,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-01-01 19:42:37,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:42:37,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:37,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:42:37,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-01-01 19:42:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 2 not checked. [2019-01-01 19:42:38,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:42:38,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35] total 51 [2019-01-01 19:42:38,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-01 19:42:38,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-01 19:42:38,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2290, Unknown=1, NotChecked=96, Total=2550 [2019-01-01 19:42:38,271 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 51 states. [2019-01-01 19:42:57,948 WARN L181 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2019-01-01 19:43:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:43:07,389 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2019-01-01 19:43:07,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-01 19:43:07,392 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-01-01 19:43:07,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:43:07,394 INFO L225 Difference]: With dead ends: 118 [2019-01-01 19:43:07,394 INFO L226 Difference]: Without dead ends: 116 [2019-01-01 19:43:07,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 71 SyntacticMatches, 17 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=458, Invalid=5093, Unknown=3, NotChecked=146, Total=5700 [2019-01-01 19:43:07,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-01 19:43:07,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-01-01 19:43:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 19:43:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2019-01-01 19:43:07,399 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 99 [2019-01-01 19:43:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:43:07,399 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2019-01-01 19:43:07,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-01 19:43:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2019-01-01 19:43:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-01 19:43:07,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:43:07,403 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, 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] [2019-01-01 19:43:07,403 INFO L423 AbstractCegarLoop]: === Iteration 28 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:43:07,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:43:07,404 INFO L82 PathProgramCache]: Analyzing trace with hash 234036269, now seen corresponding path program 1 times [2019-01-01 19:43:07,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:43:07,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:43:07,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:43:07,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:43:07,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:43:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:43:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 19:43:08,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:43:08,460 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:43:08,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:43:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:43:08,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:43:08,721 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:43:08,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:08,730 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:43:08,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-01 19:43:08,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:08,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:08,844 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:43:08,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:08,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:08,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-01-01 19:43:08,875 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:43:08,878 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:43:08,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:08,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:08,891 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:43:08,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2019-01-01 19:43:08,971 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 22 treesize of output 18 [2019-01-01 19:43:08,973 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 18 treesize of output 10 [2019-01-01 19:43:08,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:08,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:08,978 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:43:08,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:3 [2019-01-01 19:43:11,093 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (+ |c_sll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| .cse0) sll_update_at_~head.offset)))))) is different from true [2019-01-01 19:43:11,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:11,104 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 55 treesize of output 59 [2019-01-01 19:43:11,124 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 24 treesize of output 1 [2019-01-01 19:43:11,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:11,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:11,138 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:43:11,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:25 [2019-01-01 19:43:11,162 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 22 treesize of output 18 [2019-01-01 19:43:11,164 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 18 treesize of output 10 [2019-01-01 19:43:11,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:11,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:11,172 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:43:11,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:3 [2019-01-01 19:43:11,216 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 37 treesize of output 30 [2019-01-01 19:43:11,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:11,221 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-01-01 19:43:11,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:11,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:11,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:11,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 [2019-01-01 19:43:11,633 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 31 treesize of output 25 [2019-01-01 19:43:11,668 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 25 treesize of output 25 [2019-01-01 19:43:11,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-01-01 19:43:11,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 19:43:11,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:43:11,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:14 [2019-01-01 19:43:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 17 trivial. 2 not checked. [2019-01-01 19:43:11,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:43:11,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 47 [2019-01-01 19:43:11,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-01 19:43:11,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-01 19:43:11,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2021, Unknown=1, NotChecked=90, Total=2256 [2019-01-01 19:43:11,831 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 48 states. [2019-01-01 19:43:21,457 WARN L181 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2019-01-01 19:43:22,032 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-01 19:43:23,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:43:23,538 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2019-01-01 19:43:23,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-01 19:43:23,539 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 99 [2019-01-01 19:43:23,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:43:23,540 INFO L225 Difference]: With dead ends: 118 [2019-01-01 19:43:23,541 INFO L226 Difference]: Without dead ends: 118 [2019-01-01 19:43:23,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 75 SyntacticMatches, 15 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=480, Invalid=5072, Unknown=2, NotChecked=146, Total=5700 [2019-01-01 19:43:23,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-01 19:43:23,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2019-01-01 19:43:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-01 19:43:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2019-01-01 19:43:23,546 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 99 [2019-01-01 19:43:23,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:43:23,547 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2019-01-01 19:43:23,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-01 19:43:23,547 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2019-01-01 19:43:23,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 19:43:23,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:43:23,548 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, 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] [2019-01-01 19:43:23,548 INFO L423 AbstractCegarLoop]: === Iteration 29 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:43:23,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:43:23,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1442642529, now seen corresponding path program 2 times [2019-01-01 19:43:23,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:43:23,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:43:23,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:43:23,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:43:23,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:43:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:43:23,949 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 3 [2019-01-01 19:43:24,517 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2019-01-01 19:43:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-01 19:43:26,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:43:26,472 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:43:26,482 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:43:26,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 19:43:26,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:43:26,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:43:26,899 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:43:26,913 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:43:26,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:26,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:27,086 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:43:27,100 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:43:27,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:27,128 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:27,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:27,248 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-01-01 19:43:27,355 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 25 treesize of output 20 [2019-01-01 19:43:27,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:27,369 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:43:27,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:27,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:27,397 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 25 treesize of output 20 [2019-01-01 19:43:27,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:27,403 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:43:27,404 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:27,410 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:27,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:27,422 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:30 [2019-01-01 19:43:27,706 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:43:27,708 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 23 treesize of output 18 [2019-01-01 19:43:27,711 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 9 [2019-01-01 19:43:27,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:27,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:27,732 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:43:27,734 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 23 treesize of output 18 [2019-01-01 19:43:27,745 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 9 [2019-01-01 19:43:27,745 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:27,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:27,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:27,759 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:30 [2019-01-01 19:43:28,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:28,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:28,204 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:43:28,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:28,241 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 31 [2019-01-01 19:43:28,245 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:43:28,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:28,315 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:43:28,315 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:28,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:28,339 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:28,367 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 31 [2019-01-01 19:43:28,372 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:43:28,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:28,379 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:43:28,380 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:28,387 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:28,394 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:28,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:28,412 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:78, output treesize:50 [2019-01-01 19:43:28,592 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 32 treesize of output 31 [2019-01-01 19:43:28,598 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 18 treesize of output 9 [2019-01-01 19:43:28,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:28,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:28,633 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:43:28,635 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 32 treesize of output 37 [2019-01-01 19:43:28,639 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 9 [2019-01-01 19:43:28,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:28,646 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:28,663 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:43:28,664 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:56 [2019-01-01 19:43:29,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 164 [2019-01-01 19:43:29,500 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 19:43:29,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:29,709 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 102 treesize of output 66 [2019-01-01 19:43:29,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:29,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:29,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 101 treesize of output 126 [2019-01-01 19:43:29,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2019-01-01 19:43:30,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 93 [2019-01-01 19:43:30,320 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-01 19:43:30,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 19:43:30,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 86 [2019-01-01 19:43:30,517 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:43:30,519 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 44 treesize of output 11 [2019-01-01 19:43:30,519 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:30,530 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:30,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 68 [2019-01-01 19:43:30,549 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 70 [2019-01-01 19:43:30,550 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:43:30,566 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:43:30,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 106 [2019-01-01 19:43:30,664 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 96 [2019-01-01 19:43:30,667 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-01 19:43:30,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 69 [2019-01-01 19:43:30,884 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2019-01-01 19:43:31,022 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 78 treesize of output 42 [2019-01-01 19:43:31,022 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:31,229 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:43:31,507 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-01 19:43:31,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 70 [2019-01-01 19:43:31,527 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 67 treesize of output 48 [2019-01-01 19:43:31,527 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:31,540 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:31,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2019-01-01 19:43:31,659 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:135, output treesize:291 [2019-01-01 19:43:31,927 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-01-01 19:43:32,360 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 71 treesize of output 64 [2019-01-01 19:43:32,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:32,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:32,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:32,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:32,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-01 19:43:32,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:32,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:32,594 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 75 treesize of output 69 [2019-01-01 19:43:32,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:32,619 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2019-01-01 19:43:32,619 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:32,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:32,727 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 60 treesize of output 55 [2019-01-01 19:43:32,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:32,733 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 18 treesize of output 12 [2019-01-01 19:43:32,734 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:32,749 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:32,830 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 84 treesize of output 77 [2019-01-01 19:43:32,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:32,838 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-01-01 19:43:32,839 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:32,863 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:32,998 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 56 treesize of output 47 [2019-01-01 19:43:33,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:33,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:33,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:33,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 38 [2019-01-01 19:43:33,009 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:33,028 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:33,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 64 [2019-01-01 19:43:33,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:33,097 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2019-01-01 19:43:33,097 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:33,119 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:33,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-01 19:43:33,166 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:231, output treesize:141 [2019-01-01 19:43:35,080 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 48 [2019-01-01 19:43:35,084 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 29 treesize of output 23 [2019-01-01 19:43:35,084 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:43:35,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-01 19:43:35,107 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 19:43:35,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 19:43:35,149 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 38 treesize of output 32 [2019-01-01 19:43:35,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:35,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2019-01-01 19:43:35,157 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:35,162 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:35,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-01-01 19:43:35,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-01 19:43:35,177 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-01 19:43:35,188 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:43:35,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 19:43:35,215 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:68, output treesize:28 [2019-01-01 19:43:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-01 19:43:35,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:43:35,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 68 [2019-01-01 19:43:35,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-01 19:43:35,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-01 19:43:35,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=4294, Unknown=25, NotChecked=0, Total=4556 [2019-01-01 19:43:35,474 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand 68 states. [2019-01-01 19:43:36,557 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-01-01 19:43:38,839 WARN L181 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-01-01 19:43:40,486 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 48 [2019-01-01 19:43:40,897 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 68 [2019-01-01 19:43:41,225 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 68 [2019-01-01 19:43:42,121 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 55 [2019-01-01 19:43:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:43:43,839 INFO L93 Difference]: Finished difference Result 190 states and 202 transitions. [2019-01-01 19:43:43,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-01 19:43:43,841 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 102 [2019-01-01 19:43:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:43:43,842 INFO L225 Difference]: With dead ends: 190 [2019-01-01 19:43:43,842 INFO L226 Difference]: Without dead ends: 190 [2019-01-01 19:43:43,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 66 SyntacticMatches, 15 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2359 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=572, Invalid=8523, Unknown=25, NotChecked=0, Total=9120 [2019-01-01 19:43:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-01 19:43:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 174. [2019-01-01 19:43:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-01-01 19:43:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 186 transitions. [2019-01-01 19:43:43,849 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 186 transitions. Word has length 102 [2019-01-01 19:43:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:43:43,850 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 186 transitions. [2019-01-01 19:43:43,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-01 19:43:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 186 transitions. [2019-01-01 19:43:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-01 19:43:43,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:43:43,851 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, 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:43:43,851 INFO L423 AbstractCegarLoop]: === Iteration 30 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:43:43,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:43:43,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1975468031, now seen corresponding path program 2 times [2019-01-01 19:43:43,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:43:43,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:43:43,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:43:43,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:43:43,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:43:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:43:44,316 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-01-01 19:43:44,520 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 19:43:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-01 19:43:46,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:43:46,071 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:43:46,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:43:46,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 19:43:46,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:43:46,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:43:46,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:46,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:46,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2019-01-01 19:43:46,709 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:43:46,713 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:43:46,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:46,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:46,732 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:43:46,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:51 [2019-01-01 19:43:47,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:47,111 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-01 19:43:47,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:43:47,116 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 23 treesize of output 28 [2019-01-01 19:43:47,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:43:47,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:43:47,135 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 18 treesize of output 14 [2019-01-01 19:43:47,138 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 14 treesize of output 10 [2019-01-01 19:43:47,138 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:43:47,144 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:43:47,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:43:47,154 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:18 [2019-01-01 19:44:02,384 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 19:44:02,415 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 71 [2019-01-01 19:44:02,419 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 71 treesize of output 47 [2019-01-01 19:44:02,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:44:02,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:44:02,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:44:02,486 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 71 [2019-01-01 19:44:02,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-01 19:44:02,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:44:02,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-01 19:44:02,594 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:92, output treesize:122 [2019-01-01 19:44:02,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:44:02,827 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2019-01-01 19:44:02,831 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 25 treesize of output 10 [2019-01-01 19:44:02,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:44:02,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:44:02,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:44:02,888 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2019-01-01 19:44:02,892 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 29 treesize of output 18 [2019-01-01 19:44:02,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:44:02,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:44:02,931 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 26 treesize of output 22 [2019-01-01 19:44:02,935 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 14 treesize of output 10 [2019-01-01 19:44:02,936 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:44:02,944 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:44:02,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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:44:02,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, 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:44:02,995 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 19:44:03,007 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:44:03,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-01 19:44:03,033 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:95, output treesize:37 [2019-01-01 19:44:15,827 WARN L181 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 27 [2019-01-01 19:44:15,878 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 78 treesize of output 73 [2019-01-01 19:44:15,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:44:15,947 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:44:15,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:44:16,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:44:16,306 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 77 treesize of output 68 [2019-01-01 19:44:16,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:44:16,313 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 43 treesize of output 41 [2019-01-01 19:44:16,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:44:16,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:44:16,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-01 19:44:16,416 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:156, output treesize:120 [2019-01-01 19:44:16,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:44:16,582 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2019-01-01 19:44:16,586 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 25 treesize of output 10 [2019-01-01 19:44:16,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:44:16,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:44:16,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:44:16,630 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2019-01-01 19:44:16,633 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 29 treesize of output 18 [2019-01-01 19:44:16,634 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:44:16,642 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:44:16,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-01 19:44:16,665 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:89, output treesize:55 [2019-01-01 19:44:17,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:44:17,063 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2019-01-01 19:44:17,066 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 29 treesize of output 18 [2019-01-01 19:44:17,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:44:17,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:44:17,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:44:17,106 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2019-01-01 19:44:17,110 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 25 treesize of output 10 [2019-01-01 19:44:17,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:44:17,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:44:17,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-01 19:44:17,147 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:89, output treesize:55 [2019-01-01 19:44:17,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:44:17,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:44:17,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2019-01-01 19:44:17,502 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:44:17,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2019-01-01 19:44:17,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:44:17,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-01 19:44:17,547 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:95, output treesize:33 [2019-01-01 19:44:28,598 WARN L181 SmtUtils]: Spent 8.98 s on a formula simplification that was a NOOP. DAG size: 26 [2019-01-01 19:44:41,060 WARN L181 SmtUtils]: Spent 12.39 s on a formula simplification that was a NOOP. DAG size: 32 [2019-01-01 19:44:54,708 WARN L181 SmtUtils]: Spent 13.56 s on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 19:45:09,280 WARN L181 SmtUtils]: Spent 14.48 s on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 19:45:23,343 WARN L181 SmtUtils]: Spent 13.98 s on a formula simplification that was a NOOP. DAG size: 36 [2019-01-01 19:45:47,632 WARN L181 SmtUtils]: Spent 24.05 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 19:46:07,793 WARN L181 SmtUtils]: Spent 20.04 s on a formula simplification that was a NOOP. DAG size: 34 [2019-01-01 19:46:07,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:46:07,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:46:08,123 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 58 treesize of output 56 [2019-01-01 19:46:08,126 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 52 treesize of output 50 [2019-01-01 19:46:08,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:46:08,167 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:46:08,169 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 48 treesize of output 41 [2019-01-01 19:46:08,170 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:46:08,209 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:46:08,211 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 0 case distinctions, treesize of input 46 treesize of output 41 [2019-01-01 19:46:08,212 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:46:08,247 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 19:46:08,406 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 66 treesize of output 64 [2019-01-01 19:46:08,410 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:46:08,411 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 0 case distinctions, treesize of input 60 treesize of output 55 [2019-01-01 19:46:08,412 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:46:08,465 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 49 treesize of output 42 [2019-01-01 19:46:08,466 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 19:46:08,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:46:08,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:46:08,513 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:46:08,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2019-01-01 19:46:08,519 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:46:08,562 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 19:46:08,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-01 19:46:08,655 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 24 variables, input treesize:303, output treesize:105 [2019-01-01 19:46:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-01 19:46:41,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:46:41,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 58 [2019-01-01 19:46:41,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-01 19:46:41,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-01 19:46:41,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3187, Unknown=33, NotChecked=0, Total=3422 [2019-01-01 19:46:41,152 INFO L87 Difference]: Start difference. First operand 174 states and 186 transitions. Second operand 59 states. [2019-01-01 19:47:08,165 WARN L181 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2019-01-01 19:47:15,780 WARN L181 SmtUtils]: Spent 5.28 s on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-01-01 19:47:20,766 WARN L181 SmtUtils]: Spent 4.87 s on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2019-01-01 19:47:25,880 WARN L181 SmtUtils]: Spent 5.02 s on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-01-01 19:47:32,032 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 19:47:41,223 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 19:47:48,667 WARN L181 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-01-01 19:47:52,163 WARN L181 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2019-01-01 19:47:53,270 WARN L181 SmtUtils]: Spent 960.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-01-01 19:47:56,573 WARN L181 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2019-01-01 19:48:20,759 WARN L181 SmtUtils]: Spent 24.06 s on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 19:48:41,140 WARN L181 SmtUtils]: Spent 20.05 s on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 19:49:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:49:56,605 INFO L93 Difference]: Finished difference Result 214 states and 225 transitions. [2019-01-01 19:49:56,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-01 19:49:56,608 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 105 [2019-01-01 19:49:56,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:49:56,609 INFO L225 Difference]: With dead ends: 214 [2019-01-01 19:49:56,610 INFO L226 Difference]: Without dead ends: 137 [2019-01-01 19:49:56,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 79 SyntacticMatches, 15 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 276.1s TimeCoverageRelationStatistics Valid=615, Invalid=8082, Unknown=45, NotChecked=0, Total=8742 [2019-01-01 19:49:56,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-01 19:49:56,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 116. [2019-01-01 19:49:56,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-01 19:49:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2019-01-01 19:49:56,616 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 105 [2019-01-01 19:49:56,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:49:56,617 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2019-01-01 19:49:56,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-01 19:49:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2019-01-01 19:49:56,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-01 19:49:56,617 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:49:56,620 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2019-01-01 19:49:56,620 INFO L423 AbstractCegarLoop]: === Iteration 31 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:49:56,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:49:56,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2007564225, now seen corresponding path program 3 times [2019-01-01 19:49:56,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:49:56,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:49:56,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:49:56,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:49:56,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:49:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:49:56,832 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-01-01 19:49:56,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:49:56,832 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:49:56,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 19:49:57,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 19:49:57,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:49:57,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:49:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-01-01 19:49:57,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:49:57,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 19:49:57,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:49:57,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:49:57,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:49:57,071 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 7 states. [2019-01-01 19:49:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:49:57,117 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-01-01 19:49:57,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:49:57,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-01-01 19:49:57,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:49:57,119 INFO L225 Difference]: With dead ends: 37 [2019-01-01 19:49:57,119 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 19:49:57,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 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:49:57,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 19:49:57,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 19:49:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 19:49:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 19:49:57,121 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2019-01-01 19:49:57,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:49:57,121 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 19:49:57,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:49:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 19:49:57,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 19:49:57,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 07:49:57 BoogieIcfgContainer [2019-01-01 19:49:57,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 19:49:57,128 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 19:49:57,128 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 19:49:57,128 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 19:49:57,129 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:39:57" (3/4) ... [2019-01-01 19:49:57,133 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 19:49:57,141 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 19:49:57,141 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-01 19:49:57,141 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2019-01-01 19:49:57,141 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_update_at [2019-01-01 19:49:57,141 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 19:49:57,142 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 19:49:57,142 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2019-01-01 19:49:57,142 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_get_data_at [2019-01-01 19:49:57,142 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 19:49:57,142 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-01-01 19:49:57,149 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-01-01 19:49:57,150 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-01-01 19:49:57,150 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 19:49:57,215 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 19:49:57,215 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 19:49:57,216 INFO L168 Benchmark]: Toolchain (without parser) took 601759.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.4 MB). Free memory was 944.6 MB in the beginning and 848.4 MB in the end (delta: 96.2 MB). Peak memory consumption was 331.6 MB. Max. memory is 11.5 GB. [2019-01-01 19:49:57,217 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:49:57,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-01-01 19:49:57,218 INFO L168 Benchmark]: Boogie Preprocessor took 96.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:49:57,221 INFO L168 Benchmark]: RCFGBuilder took 967.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2019-01-01 19:49:57,221 INFO L168 Benchmark]: TraceAbstraction took 599983.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 96.5 MB). Free memory was 1.1 GB in the beginning and 848.4 MB in the end (delta: 211.0 MB). Peak memory consumption was 307.5 MB. Max. memory is 11.5 GB. [2019-01-01 19:49:57,221 INFO L168 Benchmark]: Witness Printer took 87.09 ms. Allocated memory is still 1.3 GB. Free memory is still 848.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:49:57,228 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 619.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 967.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 599983.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 96.5 MB). Free memory was 1.1 GB in the beginning and 848.4 MB in the end (delta: 211.0 MB). Peak memory consumption was 307.5 MB. Max. memory is 11.5 GB. * Witness Printer took 87.09 ms. Allocated memory is still 1.3 GB. Free memory is still 848.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free 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: 584]: free always succeeds For all program executions holds that free 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: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: 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: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 602]: 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 20 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 96 locations, 20 error locations. SAFE Result, 599.9s OverallTime, 31 OverallIterations, 3 TraceHistogramMax, 316.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1942 SDtfs, 3063 SDslu, 14028 SDs, 0 SdLazy, 26358 SolverSat, 823 SolverUnsat, 80 SolverUnknown, 0 SolverNotchecked, 156.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2025 GetRequests, 949 SyntacticMatches, 131 SemanticMatches, 945 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 11858 ImplicationChecksByTransitivity, 424.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=29, 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, 31 MinimizatonAttempts, 256 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 280.0s InterpolantComputationTime, 3148 NumberOfCodeBlocks, 3148 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 3102 ConstructedInterpolants, 291 QuantifiedInterpolants, 3610250 SizeOfPredicates, 273 NumberOfNonLiveVariables, 5451 ConjunctsInSsa, 1057 ConjunctsInUnsatCore, 46 InterpolantComputations, 18 PerfectInterpolantSequences, 919/1348 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...