./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/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-0ed9222-m [2019-01-14 00:22:39,275 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 00:22:39,278 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 00:22:39,294 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 00:22:39,295 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 00:22:39,297 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 00:22:39,299 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 00:22:39,302 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 00:22:39,305 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 00:22:39,307 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 00:22:39,309 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 00:22:39,310 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 00:22:39,310 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 00:22:39,313 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 00:22:39,321 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 00:22:39,324 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 00:22:39,325 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 00:22:39,328 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 00:22:39,333 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 00:22:39,335 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 00:22:39,338 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 00:22:39,340 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 00:22:39,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 00:22:39,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 00:22:39,346 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 00:22:39,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 00:22:39,348 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 00:22:39,351 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 00:22:39,352 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 00:22:39,353 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 00:22:39,353 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 00:22:39,353 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 00:22:39,354 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 00:22:39,356 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 00:22:39,357 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 00:22:39,358 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 00:22:39,360 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 00:22:39,382 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 00:22:39,384 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 00:22:39,385 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 00:22:39,386 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 00:22:39,386 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 00:22:39,386 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 00:22:39,386 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 00:22:39,386 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 00:22:39,387 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 00:22:39,391 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 00:22:39,391 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 00:22:39,391 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 00:22:39,391 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 00:22:39,391 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 00:22:39,392 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 00:22:39,392 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 00:22:39,393 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 00:22:39,393 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 00:22:39,393 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 00:22:39,393 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 00:22:39,393 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 00:22:39,393 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:22:39,394 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 00:22:39,394 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 00:22:39,394 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 00:22:39,394 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 00:22:39,394 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-14 00:22:39,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 00:22:39,484 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 00:22:39,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 00:22:39,492 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 00:22:39,493 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 00:22:39,494 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-14 00:22:39,555 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2bab665d/6a08cb54ea2f4f8d83cc7a93ccb6cd8c/FLAG402381ea8 [2019-01-14 00:22:40,017 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 00:22:40,018 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-14 00:22:40,032 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2bab665d/6a08cb54ea2f4f8d83cc7a93ccb6cd8c/FLAG402381ea8 [2019-01-14 00:22:40,331 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2bab665d/6a08cb54ea2f4f8d83cc7a93ccb6cd8c [2019-01-14 00:22:40,334 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 00:22:40,336 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 00:22:40,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 00:22:40,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 00:22:40,341 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 00:22:40,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:22:40" (1/1) ... [2019-01-14 00:22:40,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27853e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:40, skipping insertion in model container [2019-01-14 00:22:40,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:22:40" (1/1) ... [2019-01-14 00:22:40,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 00:22:40,402 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 00:22:40,802 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:22:40,822 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 00:22:40,968 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:22:41,024 INFO L195 MainTranslator]: Completed translation [2019-01-14 00:22:41,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:41 WrapperNode [2019-01-14 00:22:41,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 00:22:41,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 00:22:41,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 00:22:41,026 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 00:22:41,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:41" (1/1) ... [2019-01-14 00:22:41,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:41" (1/1) ... [2019-01-14 00:22:41,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:41" (1/1) ... [2019-01-14 00:22:41,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:41" (1/1) ... [2019-01-14 00:22:41,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:41" (1/1) ... [2019-01-14 00:22:41,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:41" (1/1) ... [2019-01-14 00:22:41,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:41" (1/1) ... [2019-01-14 00:22:41,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 00:22:41,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 00:22:41,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 00:22:41,117 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 00:22:41,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:41" (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-14 00:22:41,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 00:22:41,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 00:22:41,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 00:22:41,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 00:22:41,175 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-14 00:22:41,175 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-01-14 00:22:41,175 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-01-14 00:22:41,175 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-01-14 00:22:41,176 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2019-01-14 00:22:41,176 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2019-01-14 00:22:41,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 00:22:41,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 00:22:41,176 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 00:22:41,177 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 00:22:41,177 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 00:22:41,177 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 00:22:41,177 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 00:22:41,177 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 00:22:41,177 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 00:22:41,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 00:22:41,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 00:22:41,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 00:22:41,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 00:22:41,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 00:22:41,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 00:22:41,178 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 00:22:41,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 00:22:41,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 00:22:41,179 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 00:22:41,179 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 00:22:41,179 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 00:22:41,179 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 00:22:41,179 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 00:22:41,180 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 00:22:41,181 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 00:22:41,182 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 00:22:41,182 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 00:22:41,182 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 00:22:41,182 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 00:22:41,182 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 00:22:41,182 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 00:22:41,183 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 00:22:41,184 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 00:22:41,185 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 00:22:41,185 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 00:22:41,185 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 00:22:41,185 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 00:22:41,185 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 00:22:41,185 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 00:22:41,185 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 00:22:41,185 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 00:22:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 00:22:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 00:22:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 00:22:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 00:22:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 00:22:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 00:22:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 00:22:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 00:22:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 00:22:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 00:22:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 00:22:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 00:22:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 00:22:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 00:22:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 00:22:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 00:22:41,189 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 00:22:41,189 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 00:22:41,189 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 00:22:41,189 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 00:22:41,189 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 00:22:41,189 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-14 00:22:41,189 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 00:22:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 00:22:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-14 00:22:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 00:22:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 00:22:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-14 00:22:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 00:22:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 00:22:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 00:22:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 00:22:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 00:22:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 00:22:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 00:22:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 00:22:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 00:22:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 00:22:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 00:22:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 00:22:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 00:22:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 00:22:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 00:22:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 00:22:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 00:22:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 00:22:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 00:22:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 00:22:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 00:22:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 00:22:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 00:22:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 00:22:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 00:22:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 00:22:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 00:22:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 00:22:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 00:22:41,195 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 00:22:41,195 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 00:22:41,195 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 00:22:41,195 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 00:22:41,195 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 00:22:41,195 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 00:22:41,195 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 00:22:41,195 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 00:22:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 00:22:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-14 00:22:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-01-14 00:22:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 00:22:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 00:22:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 00:22:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-01-14 00:22:41,196 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-01-14 00:22:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 00:22:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 00:22:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2019-01-14 00:22:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 00:22:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2019-01-14 00:22:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 00:22:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 00:22:41,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 00:22:41,747 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-14 00:22:42,041 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 00:22:42,041 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 00:22:42,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:22:42 BoogieIcfgContainer [2019-01-14 00:22:42,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 00:22:42,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 00:22:42,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 00:22:42,047 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 00:22:42,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 12:22:40" (1/3) ... [2019-01-14 00:22:42,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af76e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:22:42, skipping insertion in model container [2019-01-14 00:22:42,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:22:41" (2/3) ... [2019-01-14 00:22:42,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af76e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:22:42, skipping insertion in model container [2019-01-14 00:22:42,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:22:42" (3/3) ... [2019-01-14 00:22:42,051 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-14 00:22:42,062 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 00:22:42,070 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-01-14 00:22:42,087 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-01-14 00:22:42,114 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 00:22:42,115 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 00:22:42,115 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 00:22:42,117 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 00:22:42,117 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 00:22:42,117 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 00:22:42,117 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 00:22:42,118 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 00:22:42,118 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 00:22:42,136 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-01-14 00:22:42,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 00:22:42,147 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:42,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:42,151 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:22:42,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:42,157 INFO L82 PathProgramCache]: Analyzing trace with hash 360562924, now seen corresponding path program 1 times [2019-01-14 00:22:42,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:42,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:42,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:42,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:42,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:42,384 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-14 00:22:42,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:42,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:22:42,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:22:42,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:22:42,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:22:42,415 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2019-01-14 00:22:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:42,588 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2019-01-14 00:22:42,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:22:42,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-14 00:22:42,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:42,601 INFO L225 Difference]: With dead ends: 86 [2019-01-14 00:22:42,601 INFO L226 Difference]: Without dead ends: 79 [2019-01-14 00:22:42,603 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-14 00:22:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-14 00:22:42,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-14 00:22:42,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 00:22:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-01-14 00:22:42,649 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 13 [2019-01-14 00:22:42,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:42,650 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-01-14 00:22:42,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:22:42,650 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-01-14 00:22:42,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 00:22:42,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:42,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:22:42,652 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:22:42,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:42,652 INFO L82 PathProgramCache]: Analyzing trace with hash 360562925, now seen corresponding path program 1 times [2019-01-14 00:22:42,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:42,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:42,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:42,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:42,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:42,944 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-14 00:22:42,948 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-14 00:22:42,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:42,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:22:42,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:22:42,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:22:42,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:22:42,955 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 3 states. [2019-01-14 00:22:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:43,027 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-01-14 00:22:43,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:22:43,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-14 00:22:43,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:43,030 INFO L225 Difference]: With dead ends: 77 [2019-01-14 00:22:43,030 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 00:22:43,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:22:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 00:22:43,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-14 00:22:43,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 00:22:43,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-01-14 00:22:43,041 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 13 [2019-01-14 00:22:43,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:43,041 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-01-14 00:22:43,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:22:43,041 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-01-14 00:22:43,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 00:22:43,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:43,043 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-14 00:22:43,043 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:22:43,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:43,044 INFO L82 PathProgramCache]: Analyzing trace with hash -611679416, now seen corresponding path program 1 times [2019-01-14 00:22:43,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:43,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:43,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:43,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:43,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:43,120 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-14 00:22:43,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:43,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:22:43,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:22:43,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:22:43,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:22:43,124 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-01-14 00:22:43,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:43,488 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2019-01-14 00:22:43,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:22:43,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-01-14 00:22:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:43,491 INFO L225 Difference]: With dead ends: 88 [2019-01-14 00:22:43,491 INFO L226 Difference]: Without dead ends: 85 [2019-01-14 00:22:43,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:22:43,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-14 00:22:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2019-01-14 00:22:43,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-14 00:22:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-01-14 00:22:43,513 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 18 [2019-01-14 00:22:43,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:43,513 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-01-14 00:22:43,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:22:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-01-14 00:22:43,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 00:22:43,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:43,515 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-14 00:22:43,515 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:22:43,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:43,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1012902948, now seen corresponding path program 1 times [2019-01-14 00:22:43,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:43,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:43,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:43,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:43,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:43,711 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-14 00:22:43,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:43,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:22:43,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:22:43,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:22:43,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:22:43,712 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 6 states. [2019-01-14 00:22:43,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:43,940 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-01-14 00:22:43,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:22:43,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 00:22:43,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:43,948 INFO L225 Difference]: With dead ends: 78 [2019-01-14 00:22:43,948 INFO L226 Difference]: Without dead ends: 78 [2019-01-14 00:22:43,949 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-14 00:22:43,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-14 00:22:43,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-01-14 00:22:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 00:22:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-01-14 00:22:43,959 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 19 [2019-01-14 00:22:43,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:43,960 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-01-14 00:22:43,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:22:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-01-14 00:22:43,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 00:22:43,961 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:43,961 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-14 00:22:43,961 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:22:43,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:43,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1012902949, now seen corresponding path program 1 times [2019-01-14 00:22:43,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:43,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:43,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:43,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:43,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:44,157 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-14 00:22:44,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:44,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:22:44,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:22:44,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:22:44,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:22:44,159 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2019-01-14 00:22:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:44,418 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-01-14 00:22:44,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:22:44,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 00:22:44,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:44,420 INFO L225 Difference]: With dead ends: 77 [2019-01-14 00:22:44,420 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 00:22:44,421 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-14 00:22:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 00:22:44,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-01-14 00:22:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-14 00:22:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-01-14 00:22:44,428 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 19 [2019-01-14 00:22:44,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:44,429 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-01-14 00:22:44,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:22:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-01-14 00:22:44,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 00:22:44,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:44,430 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-14 00:22:44,431 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:22:44,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:44,431 INFO L82 PathProgramCache]: Analyzing trace with hash -343567322, now seen corresponding path program 1 times [2019-01-14 00:22:44,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:44,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:44,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:44,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:44,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:44,681 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-14 00:22:44,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:44,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 00:22:44,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:22:44,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:22:44,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:22:44,685 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 12 states. [2019-01-14 00:22:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:45,257 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-01-14 00:22:45,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:22:45,258 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-01-14 00:22:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:45,260 INFO L225 Difference]: With dead ends: 82 [2019-01-14 00:22:45,260 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 00:22:45,261 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-14 00:22:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 00:22:45,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-01-14 00:22:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 00:22:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2019-01-14 00:22:45,268 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 31 [2019-01-14 00:22:45,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:45,269 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2019-01-14 00:22:45,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:22:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2019-01-14 00:22:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 00:22:45,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:45,270 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-14 00:22:45,271 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:22:45,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:45,271 INFO L82 PathProgramCache]: Analyzing trace with hash -343567321, now seen corresponding path program 1 times [2019-01-14 00:22:45,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:45,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:45,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:45,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:45,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:45,391 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-14 00:22:45,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:45,392 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-14 00:22:45,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:45,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:45,515 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-14 00:22:45,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:22:45,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 00:22:45,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:22:45,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:22:45,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:22:45,536 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 6 states. [2019-01-14 00:22:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:45,625 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2019-01-14 00:22:45,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:22:45,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-01-14 00:22:45,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:45,627 INFO L225 Difference]: With dead ends: 93 [2019-01-14 00:22:45,627 INFO L226 Difference]: Without dead ends: 90 [2019-01-14 00:22:45,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:22:45,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-14 00:22:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2019-01-14 00:22:45,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-14 00:22:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-01-14 00:22:45,635 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 31 [2019-01-14 00:22:45,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:45,635 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-01-14 00:22:45,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:22:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-01-14 00:22:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 00:22:45,638 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:45,638 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-14 00:22:45,638 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:22:45,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:45,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1504093175, now seen corresponding path program 2 times [2019-01-14 00:22:45,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:45,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:45,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:45,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:45,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:45,807 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-14 00:22:45,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:45,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 00:22:45,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:22:45,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:22:45,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:22:45,808 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 6 states. [2019-01-14 00:22:45,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:45,987 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2019-01-14 00:22:45,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:22:45,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-01-14 00:22:45,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:45,989 INFO L225 Difference]: With dead ends: 106 [2019-01-14 00:22:45,990 INFO L226 Difference]: Without dead ends: 106 [2019-01-14 00:22:45,990 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-14 00:22:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-14 00:22:45,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2019-01-14 00:22:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 00:22:45,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2019-01-14 00:22:45,999 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 44 [2019-01-14 00:22:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:45,999 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2019-01-14 00:22:45,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:22:45,999 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2019-01-14 00:22:46,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 00:22:46,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:46,001 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-14 00:22:46,001 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:22:46,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:46,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1504093120, now seen corresponding path program 1 times [2019-01-14 00:22:46,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:46,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:46,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:46,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:22:46,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:46,279 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-14 00:22:46,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:22:46,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 00:22:46,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:22:46,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:22:46,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:22:46,280 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand 13 states. [2019-01-14 00:22:46,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:22:46,850 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2019-01-14 00:22:46,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 00:22:46,851 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-01-14 00:22:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:22:46,852 INFO L225 Difference]: With dead ends: 101 [2019-01-14 00:22:46,852 INFO L226 Difference]: Without dead ends: 101 [2019-01-14 00:22:46,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-01-14 00:22:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-14 00:22:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-01-14 00:22:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 00:22:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-01-14 00:22:46,860 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 44 [2019-01-14 00:22:46,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:22:46,860 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-01-14 00:22:46,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:22:46,860 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-01-14 00:22:46,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 00:22:46,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:22:46,862 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-14 00:22:46,862 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:22:46,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:22:46,862 INFO L82 PathProgramCache]: Analyzing trace with hash 955614394, now seen corresponding path program 1 times [2019-01-14 00:22:46,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:22:46,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:22:46,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:46,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:46,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:22:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:47,960 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-14 00:22:47,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:22:47,961 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-14 00:22:47,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:22:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:22:48,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:22:55,180 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-14 00:22:55,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:55,189 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-14 00:22:55,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-14 00:22:55,205 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-14 00:22:55,207 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-14 00:22:55,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:55,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:55,215 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-14 00:22:55,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-01-14 00:22:57,812 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-14 00:22:57,815 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-14 00:22:57,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:22:57,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:22:57,820 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-14 00:22:57,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-01-14 00:22:57,853 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-14 00:22:57,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:22:57,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 30 [2019-01-14 00:22:57,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-14 00:22:57,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-14 00:22:57,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=835, Unknown=23, NotChecked=0, Total=930 [2019-01-14 00:22:57,873 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 31 states. [2019-01-14 00:22:58,177 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2019-01-14 00:22:58,730 WARN L181 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 00:22:59,127 WARN L181 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 00:22:59,786 WARN L181 SmtUtils]: Spent 596.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 00:23:30,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:30,614 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2019-01-14 00:23:30,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 00:23:30,615 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 47 [2019-01-14 00:23:30,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:30,617 INFO L225 Difference]: With dead ends: 130 [2019-01-14 00:23:30,618 INFO L226 Difference]: Without dead ends: 130 [2019-01-14 00:23:30,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=208, Invalid=2005, Unknown=43, NotChecked=0, Total=2256 [2019-01-14 00:23:30,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-14 00:23:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 101. [2019-01-14 00:23:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 00:23:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2019-01-14 00:23:30,628 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 47 [2019-01-14 00:23:30,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:30,628 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2019-01-14 00:23:30,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-14 00:23:30,628 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2019-01-14 00:23:30,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 00:23:30,633 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:30,633 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-14 00:23:30,633 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:23:30,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:30,636 INFO L82 PathProgramCache]: Analyzing trace with hash 955614395, now seen corresponding path program 1 times [2019-01-14 00:23:30,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:30,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:30,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:30,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:30,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:30,967 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-14 00:23:31,579 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-14 00:23:31,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:23:31,579 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-14 00:23:31,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:31,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:23:31,654 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-14 00:23:31,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:31,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:31,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 00:23:32,310 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-14 00:23:32,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 0 case distinctions, treesize of input 19 treesize of output 14 [2019-01-14 00:23:32,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:32,326 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-14 00:23:32,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2019-01-14 00:23:32,370 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-14 00:23:32,373 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-14 00:23:32,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:32,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:32,390 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-14 00:23:32,393 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-14 00:23:32,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:32,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:32,407 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-14 00:23:32,408 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:40 [2019-01-14 00:23:32,749 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-14 00:23:32,753 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-14 00:23:32,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:32,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:32,782 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-14 00:23:32,786 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-14 00:23:32,787 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:32,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:32,797 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-14 00:23:32,798 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:16 [2019-01-14 00:23:32,921 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-14 00:23:32,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:23:32,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 38 [2019-01-14 00:23:32,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-14 00:23:32,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-14 00:23:32,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1324, Unknown=1, NotChecked=72, Total=1482 [2019-01-14 00:23:32,941 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 39 states. [2019-01-14 00:23:33,917 WARN L181 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-01-14 00:23:34,849 WARN L181 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-01-14 00:23:35,677 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-01-14 00:23:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:38,492 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2019-01-14 00:23:38,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 00:23:38,493 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 47 [2019-01-14 00:23:38,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:38,495 INFO L225 Difference]: With dead ends: 155 [2019-01-14 00:23:38,496 INFO L226 Difference]: Without dead ends: 155 [2019-01-14 00:23:38,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=210, Invalid=2445, Unknown=1, NotChecked=100, Total=2756 [2019-01-14 00:23:38,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-14 00:23:38,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 116. [2019-01-14 00:23:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-14 00:23:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2019-01-14 00:23:38,506 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 47 [2019-01-14 00:23:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:38,507 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2019-01-14 00:23:38,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-14 00:23:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2019-01-14 00:23:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 00:23:38,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:38,511 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-14 00:23:38,511 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:23:38,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:38,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1666795208, now seen corresponding path program 2 times [2019-01-14 00:23:38,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:38,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:38,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:38,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:38,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:38,656 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-14 00:23:38,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:23:38,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 00:23:38,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:23:38,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:23:38,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:23:38,658 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand 7 states. [2019-01-14 00:23:38,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:38,723 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2019-01-14 00:23:38,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:23:38,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-01-14 00:23:38,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:38,726 INFO L225 Difference]: With dead ends: 92 [2019-01-14 00:23:38,727 INFO L226 Difference]: Without dead ends: 92 [2019-01-14 00:23:38,727 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-14 00:23:38,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-14 00:23:38,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-14 00:23:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 00:23:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2019-01-14 00:23:38,733 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 50 [2019-01-14 00:23:38,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:38,733 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2019-01-14 00:23:38,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:23:38,733 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2019-01-14 00:23:38,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 00:23:38,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:38,737 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-14 00:23:38,737 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:23:38,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:38,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1828517252, now seen corresponding path program 1 times [2019-01-14 00:23:38,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:38,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:38,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:38,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:23:38,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:39,376 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-14 00:23:39,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:23:39,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 00:23:39,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:23:39,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:23:39,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:23:39,377 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 12 states. [2019-01-14 00:23:39,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:39,869 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2019-01-14 00:23:39,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:23:39,870 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-01-14 00:23:39,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:39,872 INFO L225 Difference]: With dead ends: 97 [2019-01-14 00:23:39,872 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 00:23:39,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:23:39,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 00:23:39,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-01-14 00:23:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-14 00:23:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2019-01-14 00:23:39,877 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 57 [2019-01-14 00:23:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:39,878 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2019-01-14 00:23:39,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:23:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2019-01-14 00:23:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 00:23:39,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:39,881 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-14 00:23:39,881 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:23:39,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:39,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1828517253, now seen corresponding path program 1 times [2019-01-14 00:23:39,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:39,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:39,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:39,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:39,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:40,101 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-14 00:23:40,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:23:40,101 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-14 00:23:40,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:40,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:23:40,171 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-14 00:23:40,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:23:40,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 00:23:40,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:23:40,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:23:40,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:23:40,191 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 5 states. [2019-01-14 00:23:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:40,404 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2019-01-14 00:23:40,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:23:40,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-01-14 00:23:40,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:40,407 INFO L225 Difference]: With dead ends: 102 [2019-01-14 00:23:40,407 INFO L226 Difference]: Without dead ends: 102 [2019-01-14 00:23:40,407 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-14 00:23:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-14 00:23:40,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-14 00:23:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-14 00:23:40,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2019-01-14 00:23:40,412 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 57 [2019-01-14 00:23:40,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:40,412 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2019-01-14 00:23:40,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:23:40,412 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2019-01-14 00:23:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 00:23:40,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:40,415 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-14 00:23:40,417 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:23:40,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:40,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1316396204, now seen corresponding path program 1 times [2019-01-14 00:23:40,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:40,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:40,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:40,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:40,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:40,496 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-14 00:23:40,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:23:40,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 00:23:40,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:23:40,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:23:40,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:23:40,498 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 7 states. [2019-01-14 00:23:40,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:40,597 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2019-01-14 00:23:40,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:23:40,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-01-14 00:23:40,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:40,600 INFO L225 Difference]: With dead ends: 97 [2019-01-14 00:23:40,600 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 00:23:40,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:23:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 00:23:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-14 00:23:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 00:23:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2019-01-14 00:23:40,606 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 58 [2019-01-14 00:23:40,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:40,607 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2019-01-14 00:23:40,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:23:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2019-01-14 00:23:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 00:23:40,609 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:40,609 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-14 00:23:40,609 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:23:40,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:40,610 INFO L82 PathProgramCache]: Analyzing trace with hash 953803641, now seen corresponding path program 2 times [2019-01-14 00:23:40,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:40,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:40,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:40,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:40,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:40,842 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-14 00:23:40,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:23:40,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 00:23:40,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:23:40,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:23:40,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:23:40,847 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 6 states. [2019-01-14 00:23:40,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:40,908 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2019-01-14 00:23:40,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:23:40,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-01-14 00:23:40,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:40,910 INFO L225 Difference]: With dead ends: 111 [2019-01-14 00:23:40,910 INFO L226 Difference]: Without dead ends: 111 [2019-01-14 00:23:40,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:23:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-14 00:23:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2019-01-14 00:23:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 00:23:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2019-01-14 00:23:40,920 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 65 [2019-01-14 00:23:40,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:40,920 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2019-01-14 00:23:40,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:23:40,920 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2019-01-14 00:23:40,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 00:23:40,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:40,921 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-14 00:23:40,921 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:23:40,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:40,925 INFO L82 PathProgramCache]: Analyzing trace with hash 953803696, now seen corresponding path program 1 times [2019-01-14 00:23:40,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:40,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:40,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:40,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:23:40,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:41,641 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-14 00:23:41,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:23:41,641 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-14 00:23:41,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:41,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:23:42,481 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-14 00:23:42,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:23:42,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 27 [2019-01-14 00:23:42,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 00:23:42,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 00:23:42,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2019-01-14 00:23:42,503 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand 28 states. [2019-01-14 00:23:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:43,151 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2019-01-14 00:23:43,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 00:23:43,152 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 65 [2019-01-14 00:23:43,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:43,153 INFO L225 Difference]: With dead ends: 113 [2019-01-14 00:23:43,154 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 00:23:43,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2019-01-14 00:23:43,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 00:23:43,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2019-01-14 00:23:43,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 00:23:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2019-01-14 00:23:43,160 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 65 [2019-01-14 00:23:43,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:43,160 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2019-01-14 00:23:43,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 00:23:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2019-01-14 00:23:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-14 00:23:43,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:43,163 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-14 00:23:43,164 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:23:43,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:43,164 INFO L82 PathProgramCache]: Analyzing trace with hash -737720004, now seen corresponding path program 1 times [2019-01-14 00:23:43,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:43,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:43,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:43,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:43,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:43,976 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-14 00:23:43,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:23:43,976 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-14 00:23:43,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:44,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:23:44,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:44,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:44,270 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-14 00:23:44,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:44,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:44,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-14 00:23:44,337 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-14 00:23:44,348 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-14 00:23:44,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:44,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:44,414 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-14 00:23:44,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-01-14 00:23:46,632 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 00:23:46,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:46,653 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-14 00:23:46,658 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-14 00:23:46,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:46,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:46,670 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-14 00:23:46,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:25 [2019-01-14 00:23:46,717 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-14 00:23:46,720 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:46,721 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-14 00:23:46,722 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-14 00:23:46,726 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-14 00:23:46,731 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-14 00:23:46,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-01-14 00:23:46,958 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-14 00:23:46,982 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:47,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:47,025 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-14 00:23:47,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:47,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:47,045 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-14 00:23:47,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2019-01-14 00:23:47,207 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-14 00:23:47,220 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:23:47,224 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-14 00:23:47,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:47,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:47,241 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-14 00:23:47,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:5 [2019-01-14 00:23:47,367 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-14 00:23:47,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:23:47,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 41 [2019-01-14 00:23:47,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-14 00:23:47,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-14 00:23:47,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1609, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 00:23:47,387 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 42 states. [2019-01-14 00:23:49,969 WARN L181 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 00:23:51,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:51,363 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2019-01-14 00:23:51,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 00:23:51,364 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 68 [2019-01-14 00:23:51,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:51,365 INFO L225 Difference]: With dead ends: 138 [2019-01-14 00:23:51,365 INFO L226 Difference]: Without dead ends: 138 [2019-01-14 00:23:51,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 49 SyntacticMatches, 14 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=349, Invalid=3811, Unknown=0, NotChecked=0, Total=4160 [2019-01-14 00:23:51,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-14 00:23:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 115. [2019-01-14 00:23:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-14 00:23:51,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2019-01-14 00:23:51,374 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 68 [2019-01-14 00:23:51,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:51,374 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2019-01-14 00:23:51,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-14 00:23:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2019-01-14 00:23:51,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-14 00:23:51,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:51,382 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-14 00:23:51,382 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:23:51,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:51,382 INFO L82 PathProgramCache]: Analyzing trace with hash -737720003, now seen corresponding path program 1 times [2019-01-14 00:23:51,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:51,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:51,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:51,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:51,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:53,123 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-14 00:23:53,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:23:53,124 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-14 00:23:53,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:53,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:23:53,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:53,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:53,592 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-14 00:23:53,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:53,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:53,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-01-14 00:23:53,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, 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-14 00:23:53,696 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-14 00:23:53,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:53,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:53,713 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-14 00:23:53,716 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-14 00:23:53,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:53,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:53,729 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-14 00:23:53,730 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:17 [2019-01-14 00:23:54,284 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-14 00:23:54,296 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-14 00:23:54,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:54,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:54,403 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-14 00:23:54,407 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-14 00:23:54,407 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:54,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:54,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:54,423 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:135, output treesize:45 [2019-01-14 00:23:54,509 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-14 00:23:54,513 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-14 00:23:54,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:54,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:54,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-14 00:23:54,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-14 00:23:54,546 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-14 00:23:54,551 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-14 00:23:54,563 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-14 00:23:54,563 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:12 [2019-01-14 00:23:58,772 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-14 00:23:58,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:58,778 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-14 00:23:58,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:58,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:58,810 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-14 00:23:58,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:23:58,814 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-14 00:23:58,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:58,823 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:58,843 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-14 00:23:58,844 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:50 [2019-01-14 00:23:59,039 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-14 00:23:59,041 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-14 00:23:59,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:59,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:59,061 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-14 00:23:59,064 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-14 00:23:59,065 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:59,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:59,079 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-14 00:23:59,079 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:11 [2019-01-14 00:23:59,197 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-14 00:23:59,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:23:59,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 57 [2019-01-14 00:23:59,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-14 00:23:59,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-14 00:23:59,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3134, Unknown=2, NotChecked=0, Total=3306 [2019-01-14 00:23:59,217 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand 58 states. [2019-01-14 00:24:02,342 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-01-14 00:24:03,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:24:03,855 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2019-01-14 00:24:03,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-14 00:24:03,856 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 68 [2019-01-14 00:24:03,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:24:03,858 INFO L225 Difference]: With dead ends: 141 [2019-01-14 00:24:03,858 INFO L226 Difference]: Without dead ends: 141 [2019-01-14 00:24:03,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=469, Invalid=6009, Unknown=2, NotChecked=0, Total=6480 [2019-01-14 00:24:03,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-14 00:24:03,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 114. [2019-01-14 00:24:03,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 00:24:03,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2019-01-14 00:24:03,866 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 68 [2019-01-14 00:24:03,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:24:03,866 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2019-01-14 00:24:03,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-14 00:24:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2019-01-14 00:24:03,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-14 00:24:03,870 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:24:03,870 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-14 00:24:03,870 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:24:03,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:24:03,873 INFO L82 PathProgramCache]: Analyzing trace with hash -67314440, now seen corresponding path program 2 times [2019-01-14 00:24:03,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:24:03,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:24:03,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:03,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:03,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:04,079 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-14 00:24:04,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:24:04,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 00:24:04,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:24:04,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:24:04,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:24:04,081 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 7 states. [2019-01-14 00:24:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:24:04,154 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2019-01-14 00:24:04,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:24:04,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-01-14 00:24:04,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:24:04,157 INFO L225 Difference]: With dead ends: 100 [2019-01-14 00:24:04,157 INFO L226 Difference]: Without dead ends: 100 [2019-01-14 00:24:04,158 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-14 00:24:04,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-14 00:24:04,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-14 00:24:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 00:24:04,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-01-14 00:24:04,163 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 71 [2019-01-14 00:24:04,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:24:04,163 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-01-14 00:24:04,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:24:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-01-14 00:24:04,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-14 00:24:04,164 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:24:04,165 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-14 00:24:04,167 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:24:04,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:24:04,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1871003433, now seen corresponding path program 1 times [2019-01-14 00:24:04,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:24:04,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:24:04,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:04,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:24:04,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:04,603 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-14 00:24:04,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:24:04,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 00:24:04,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:24:04,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:24:04,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:24:04,605 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 12 states. [2019-01-14 00:24:04,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:24:04,923 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2019-01-14 00:24:04,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 00:24:04,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-01-14 00:24:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:24:04,927 INFO L225 Difference]: With dead ends: 113 [2019-01-14 00:24:04,927 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 00:24:04,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:24:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 00:24:04,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2019-01-14 00:24:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 00:24:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2019-01-14 00:24:04,933 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 90 [2019-01-14 00:24:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:24:04,933 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2019-01-14 00:24:04,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:24:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2019-01-14 00:24:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-14 00:24:04,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:24:04,934 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-14 00:24:04,937 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:24:04,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:24:04,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1871003432, now seen corresponding path program 1 times [2019-01-14 00:24:04,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:24:04,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:24:04,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:04,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:04,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:05,585 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-14 00:24:05,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:24:05,585 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-14 00:24:05,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:05,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:24:05,956 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-14 00:24:05,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:24:05,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 20 [2019-01-14 00:24:05,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 00:24:05,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 00:24:05,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-01-14 00:24:05,976 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand 21 states. [2019-01-14 00:24:06,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:24:06,510 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2019-01-14 00:24:06,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 00:24:06,513 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 90 [2019-01-14 00:24:06,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:24:06,514 INFO L225 Difference]: With dead ends: 109 [2019-01-14 00:24:06,515 INFO L226 Difference]: Without dead ends: 109 [2019-01-14 00:24:06,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 74 SyntacticMatches, 14 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-01-14 00:24:06,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-14 00:24:06,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-01-14 00:24:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 00:24:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2019-01-14 00:24:06,520 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 90 [2019-01-14 00:24:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:24:06,521 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2019-01-14 00:24:06,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 00:24:06,523 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2019-01-14 00:24:06,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-14 00:24:06,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:24:06,524 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-14 00:24:06,525 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:24:06,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:24:06,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1020976587, now seen corresponding path program 1 times [2019-01-14 00:24:06,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:24:06,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:24:06,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:06,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:06,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:06,835 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-14 00:24:06,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:24:06,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-14 00:24:06,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:24:06,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:24:06,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:24:06,837 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 13 states. [2019-01-14 00:24:07,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:24:07,101 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2019-01-14 00:24:07,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 00:24:07,103 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-01-14 00:24:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:24:07,104 INFO L225 Difference]: With dead ends: 108 [2019-01-14 00:24:07,105 INFO L226 Difference]: Without dead ends: 106 [2019-01-14 00:24:07,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-01-14 00:24:07,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-14 00:24:07,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2019-01-14 00:24:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 00:24:07,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2019-01-14 00:24:07,110 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 93 [2019-01-14 00:24:07,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:24:07,110 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2019-01-14 00:24:07,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:24:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2019-01-14 00:24:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-14 00:24:07,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:24:07,111 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-14 00:24:07,112 INFO L423 AbstractCegarLoop]: === Iteration 24 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:24:07,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:24:07,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1022303986, now seen corresponding path program 1 times [2019-01-14 00:24:07,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:24:07,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:24:07,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:07,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:07,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:07,692 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-14 00:24:07,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:24:07,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 00:24:07,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:24:07,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:24:07,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:24:07,693 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand 12 states. [2019-01-14 00:24:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:24:07,979 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2019-01-14 00:24:07,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 00:24:07,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-01-14 00:24:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:24:07,983 INFO L225 Difference]: With dead ends: 104 [2019-01-14 00:24:07,983 INFO L226 Difference]: Without dead ends: 104 [2019-01-14 00:24:07,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-01-14 00:24:07,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-14 00:24:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-14 00:24:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 00:24:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2019-01-14 00:24:07,988 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 93 [2019-01-14 00:24:07,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:24:07,988 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2019-01-14 00:24:07,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:24:07,988 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2019-01-14 00:24:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-14 00:24:07,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:24:07,989 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-14 00:24:07,989 INFO L423 AbstractCegarLoop]: === Iteration 25 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:24:07,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:24:07,990 INFO L82 PathProgramCache]: Analyzing trace with hash -154974852, now seen corresponding path program 1 times [2019-01-14 00:24:07,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:24:07,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:24:07,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:07,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:07,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:09,062 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-14 00:24:09,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:24:09,062 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-14 00:24:09,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:09,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:24:09,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:09,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:09,699 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-14 00:24:09,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:09,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:09,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-14 00:24:09,717 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-14 00:24:09,719 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-14 00:24:09,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:09,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:09,737 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-14 00:24:09,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-01-14 00:24:12,452 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 00:24:12,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:12,470 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-14 00:24:12,474 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-14 00:24:12,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:12,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:12,500 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-14 00:24:12,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:25 [2019-01-14 00:24:12,540 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-14 00:24:12,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-14 00:24:12,550 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-14 00:24:12,555 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-14 00:24:12,567 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-14 00:24:12,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2019-01-14 00:24:12,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, 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-14 00:24:12,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:12,881 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-14 00:24:12,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:12,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:12,895 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-14 00:24:12,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:27 [2019-01-14 00:24:13,301 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-14 00:24:13,309 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-14 00:24:13,311 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-14 00:24:13,322 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-14 00:24:13,336 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-14 00:24:13,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:29 [2019-01-14 00:24:13,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:13,506 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-14 00:24:13,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:13,511 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-14 00:24:13,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-01-14 00:24:13,581 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-14 00:24:13,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:24:13,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 47 [2019-01-14 00:24:13,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-14 00:24:13,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-14 00:24:13,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2120, Unknown=0, NotChecked=0, Total=2256 [2019-01-14 00:24:13,601 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 48 states. [2019-01-14 00:24:17,111 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 00:24:20,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:24:20,881 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-01-14 00:24:20,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 00:24:20,883 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2019-01-14 00:24:20,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:24:20,884 INFO L225 Difference]: With dead ends: 121 [2019-01-14 00:24:20,884 INFO L226 Difference]: Without dead ends: 121 [2019-01-14 00:24:20,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 70 SyntacticMatches, 17 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=406, Invalid=4996, Unknown=0, NotChecked=0, Total=5402 [2019-01-14 00:24:20,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-14 00:24:20,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2019-01-14 00:24:20,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 00:24:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-01-14 00:24:20,890 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 96 [2019-01-14 00:24:20,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:24:20,891 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-01-14 00:24:20,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-14 00:24:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-01-14 00:24:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-14 00:24:20,892 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:24:20,896 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-14 00:24:20,896 INFO L423 AbstractCegarLoop]: === Iteration 26 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:24:20,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:24:20,897 INFO L82 PathProgramCache]: Analyzing trace with hash -154974851, now seen corresponding path program 1 times [2019-01-14 00:24:20,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:24:20,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:24:20,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:20,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:20,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:24:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:21,763 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-01-14 00:24:22,487 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-14 00:24:22,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:24:22,487 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-14 00:24:22,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:24:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:24:22,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:24:22,797 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-14 00:24:22,799 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-14 00:24:22,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:22,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:22,824 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-14 00:24:22,830 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-14 00:24:22,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:22,838 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:22,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:22,853 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2019-01-14 00:24:22,953 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-14 00:24:22,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:22,960 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-14 00:24:22,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:22,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:22,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 25 treesize of output 20 [2019-01-14 00:24:23,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:23,010 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-14 00:24:23,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:23,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:23,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:23,037 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:36 [2019-01-14 00:24:23,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:23,192 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-14 00:24:23,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:23,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:23,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:23,216 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-14 00:24:23,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:23,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:23,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2019-01-14 00:24:23,395 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:24:23,396 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-14 00:24:23,398 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-14 00:24:23,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:23,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:23,420 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-14 00:24:23,424 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-14 00:24:23,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:23,427 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:23,440 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-14 00:24:23,441 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:42 [2019-01-14 00:24:23,748 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-14 00:24:23,750 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-14 00:24:23,751 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-14 00:24:23,758 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-14 00:24:23,778 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-14 00:24:23,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-14 00:24:23,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:23,784 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:23,796 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-14 00:24:23,797 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:21 [2019-01-14 00:24:53,553 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 00:24:53,570 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-14 00:24:53,574 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-14 00:24:53,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:53,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:53,622 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-14 00:24:53,625 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-14 00:24:53,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:53,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:53,662 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-14 00:24:53,662 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:122, output treesize:56 [2019-01-14 00:24:53,748 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-14 00:24:53,755 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-14 00:24:53,756 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-14 00:24:53,769 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-14 00:24:53,798 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-14 00:24:53,820 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-14 00:24:53,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:53,823 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:53,842 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-14 00:24:53,843 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:21 [2019-01-14 00:24:54,037 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-14 00:24:54,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:54,043 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-14 00:24:54,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:54,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:54,079 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-14 00:24:54,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:54,085 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-14 00:24:54,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:54,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:54,110 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-14 00:24:54,110 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:86, output treesize:56 [2019-01-14 00:24:54,699 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-14 00:24:54,707 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-14 00:24:54,708 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-14 00:24:54,720 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-14 00:24:54,749 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-14 00:24:54,759 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-14 00:24:54,760 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 00:24:54,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:24:54,793 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-14 00:24:54,795 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:94 [2019-01-14 00:24:55,537 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-14 00:24:55,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:24:55,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 35] total 59 [2019-01-14 00:24:55,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-14 00:24:55,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-14 00:24:55,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=3334, Unknown=13, NotChecked=0, Total=3540 [2019-01-14 00:24:55,558 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 60 states. [2019-01-14 00:24:57,229 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-01-14 00:25:00,616 WARN L181 SmtUtils]: Spent 2.24 s on a formula simplification that was a NOOP. DAG size: 43 [2019-01-14 00:25:01,829 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2019-01-14 00:25:03,295 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2019-01-14 00:25:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:25:03,358 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2019-01-14 00:25:03,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-14 00:25:03,360 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 96 [2019-01-14 00:25:03,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:25:03,361 INFO L225 Difference]: With dead ends: 118 [2019-01-14 00:25:03,361 INFO L226 Difference]: Without dead ends: 118 [2019-01-14 00:25:03,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 63 SyntacticMatches, 13 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1704 ImplicationChecksByTransitivity, 38.4s TimeCoverageRelationStatistics Valid=537, Invalid=6760, Unknown=13, NotChecked=0, Total=7310 [2019-01-14 00:25:03,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-14 00:25:03,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2019-01-14 00:25:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 00:25:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2019-01-14 00:25:03,369 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 96 [2019-01-14 00:25:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:25:03,370 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2019-01-14 00:25:03,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-14 00:25:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2019-01-14 00:25:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 00:25:03,370 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:25:03,371 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-14 00:25:03,371 INFO L423 AbstractCegarLoop]: === Iteration 27 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:25:03,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:25:03,371 INFO L82 PathProgramCache]: Analyzing trace with hash 232708870, now seen corresponding path program 1 times [2019-01-14 00:25:03,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:25:03,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:25:03,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:03,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:25:03,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:25:04,604 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-14 00:25:04,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:25:04,604 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-14 00:25:04,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:25:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:25:04,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:25:05,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:05,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:05,228 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-14 00:25:05,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:05,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:05,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-01-14 00:25:05,248 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-14 00:25:05,251 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-14 00:25:05,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:05,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:05,259 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-14 00:25:05,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2019-01-14 00:25:07,441 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-14 00:25:07,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:07,451 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-14 00:25:07,454 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-14 00:25:07,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:07,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:07,464 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-14 00:25:07,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:24 [2019-01-14 00:25:07,546 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-14 00:25:07,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:07,550 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-14 00:25:07,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:07,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:07,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:07,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-01-14 00:25:09,340 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-14 00:25:09,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:25:09,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35] total 51 [2019-01-14 00:25:09,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-14 00:25:09,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-14 00:25:09,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2290, Unknown=1, NotChecked=96, Total=2550 [2019-01-14 00:25:09,360 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 51 states. [2019-01-14 00:25:24,714 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 00:25:25,235 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 00:25:25,860 WARN L181 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 00:25:33,985 WARN L181 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2019-01-14 00:25:43,071 WARN L181 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-14 00:25:43,704 WARN L181 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-01-14 00:25:44,409 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 00:25:44,781 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 00:25:45,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:25:45,031 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2019-01-14 00:25:45,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 00:25:45,037 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-01-14 00:25:45,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:25:45,038 INFO L225 Difference]: With dead ends: 118 [2019-01-14 00:25:45,038 INFO L226 Difference]: Without dead ends: 116 [2019-01-14 00:25:45,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 71 SyntacticMatches, 17 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=458, Invalid=5092, Unknown=4, NotChecked=146, Total=5700 [2019-01-14 00:25:45,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-14 00:25:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-01-14 00:25:45,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 00:25:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2019-01-14 00:25:45,046 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 99 [2019-01-14 00:25:45,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:25:45,046 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2019-01-14 00:25:45,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-14 00:25:45,046 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2019-01-14 00:25:45,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 00:25:45,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:25:45,047 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-14 00:25:45,048 INFO L423 AbstractCegarLoop]: === Iteration 28 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:25:45,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:25:45,049 INFO L82 PathProgramCache]: Analyzing trace with hash 234036269, now seen corresponding path program 1 times [2019-01-14 00:25:45,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:25:45,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:25:45,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:45,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:25:45,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:25:45,372 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-14 00:25:47,043 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-14 00:25:47,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:25:47,044 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-14 00:25:47,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:25:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:25:47,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:25:47,248 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-14 00:25:47,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:47,257 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-14 00:25:47,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-14 00:25:47,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:47,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:47,315 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-14 00:25:47,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:47,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:47,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-01-14 00:25:47,368 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-14 00:25:47,370 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-14 00:25:47,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:47,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:47,384 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-14 00:25:47,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2019-01-14 00:25:47,462 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-14 00:25:47,464 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-14 00:25:47,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:47,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:47,468 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-14 00:25:47,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:3 [2019-01-14 00:25:49,579 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-14 00:25:49,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:49,589 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-14 00:25:49,594 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-14 00:25:49,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:49,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:49,607 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-14 00:25:49,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:25 [2019-01-14 00:25:49,632 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-14 00:25:49,634 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-14 00:25:49,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:49,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:49,640 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-14 00:25:49,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:3 [2019-01-14 00:25:49,685 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-14 00:25:49,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:49,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-14 00:25:49,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:49,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:49,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:49,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 [2019-01-14 00:25:50,314 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-14 00:25:50,383 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-14 00:25:50,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-01-14 00:25:50,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 00:25:50,415 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-14 00:25:50,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:14 [2019-01-14 00:25:50,525 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-14 00:25:50,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:25:50,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 47 [2019-01-14 00:25:50,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-14 00:25:50,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-14 00:25:50,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2021, Unknown=1, NotChecked=90, Total=2256 [2019-01-14 00:25:50,548 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 48 states. [2019-01-14 00:25:57,851 WARN L181 SmtUtils]: Spent 3.67 s on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2019-01-14 00:25:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:25:59,680 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2019-01-14 00:25:59,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-14 00:25:59,682 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 99 [2019-01-14 00:25:59,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:25:59,684 INFO L225 Difference]: With dead ends: 118 [2019-01-14 00:25:59,684 INFO L226 Difference]: Without dead ends: 118 [2019-01-14 00:25:59,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 75 SyntacticMatches, 15 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=480, Invalid=5073, Unknown=1, NotChecked=146, Total=5700 [2019-01-14 00:25:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-14 00:25:59,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2019-01-14 00:25:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-14 00:25:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2019-01-14 00:25:59,690 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 99 [2019-01-14 00:25:59,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:25:59,690 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2019-01-14 00:25:59,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-14 00:25:59,691 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2019-01-14 00:25:59,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-14 00:25:59,694 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:25:59,695 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-14 00:25:59,695 INFO L423 AbstractCegarLoop]: === Iteration 29 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:25:59,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:25:59,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1442642529, now seen corresponding path program 2 times [2019-01-14 00:25:59,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:25:59,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:25:59,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:59,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:25:59,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:26:00,106 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 3 [2019-01-14 00:26:00,378 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-14 00:26:00,812 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2019-01-14 00:26:02,784 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-14 00:26:02,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:26:02,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 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-14 00:26:02,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:26:02,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:26:02,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:26:02,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:26:03,000 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-14 00:26:03,003 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-14 00:26:03,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:03,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:03,021 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-14 00:26:03,024 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-14 00:26:03,025 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:03,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:03,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:03,038 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-01-14 00:26:03,117 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-14 00:26:03,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:03,126 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-14 00:26:03,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:03,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:03,155 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-14 00:26:03,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:03,161 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-14 00:26:03,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:03,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:03,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:03,182 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:30 [2019-01-14 00:26:03,479 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:26:03,480 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-14 00:26:03,483 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-14 00:26:03,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:03,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:03,506 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:26:03,507 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-14 00:26:03,511 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-14 00:26:03,511 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:03,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:03,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:03,530 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:30 [2019-01-14 00:26:04,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:04,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:04,138 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-14 00:26:04,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:04,169 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-14 00:26:04,173 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-14 00:26:04,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:04,233 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-14 00:26:04,233 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:04,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:04,247 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:04,275 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-14 00:26:04,280 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-14 00:26:04,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:04,288 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-14 00:26:04,288 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:04,295 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:04,303 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:04,322 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-14 00:26:04,323 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:78, output treesize:50 [2019-01-14 00:26:04,503 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-14 00:26:04,508 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-14 00:26:04,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:04,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:04,540 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:26:04,542 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-14 00:26:04,546 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-14 00:26:04,546 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:04,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:04,570 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-14 00:26:04,570 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:56 [2019-01-14 00:26:05,317 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-14 00:26:05,330 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 00:26:05,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:05,558 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-14 00:26:05,559 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:05,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:05,725 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-14 00:26:05,728 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2019-01-14 00:26:05,862 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-14 00:26:05,863 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-14 00:26:05,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 00:26:06,045 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-14 00:26:06,051 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-14 00:26:06,052 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:26:06,069 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:26:06,079 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-14 00:26:06,083 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:26:06,086 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-14 00:26:06,087 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:06,094 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:06,145 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-14 00:26:06,182 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-14 00:26:06,185 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-14 00:26:06,417 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-14 00:26:06,417 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:06,534 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-14 00:26:06,535 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2019-01-14 00:26:06,697 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-14 00:26:07,008 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-14 00:26:07,020 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-14 00:26:07,025 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-14 00:26:07,025 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:07,037 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:07,143 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-14 00:26:07,143 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:135, output treesize:291 [2019-01-14 00:26:07,405 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-01-14 00:26:07,572 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-14 00:26:07,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:07,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:07,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:07,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:07,583 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-14 00:26:07,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:07,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:07,719 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-14 00:26:07,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:07,726 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-14 00:26:07,726 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:07,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:07,833 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-14 00:26:07,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:07,839 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-14 00:26:07,839 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:07,850 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:07,932 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-14 00:26:07,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:07,938 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-14 00:26:07,939 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:07,960 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:08,027 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-14 00:26:08,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:08,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:08,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:08,035 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-14 00:26:08,036 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:08,054 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:08,117 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-14 00:26:08,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:08,123 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-14 00:26:08,124 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:08,142 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:08,189 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-14 00:26:08,190 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:231, output treesize:141 [2019-01-14 00:26:10,248 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-14 00:26:10,251 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-14 00:26:10,251 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-14 00:26:10,278 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-14 00:26:10,278 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 00:26:10,294 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-14 00:26:10,328 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-14 00:26:10,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:10,340 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-14 00:26:10,340 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:10,349 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:10,353 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-14 00:26:10,365 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-14 00:26:10,365 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-14 00:26:10,382 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:26:10,420 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-14 00:26:10,421 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:68, output treesize:28 [2019-01-14 00:26:10,720 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-14 00:26:10,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:26:10,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 68 [2019-01-14 00:26:10,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-14 00:26:10,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-14 00:26:10,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=4291, Unknown=28, NotChecked=0, Total=4556 [2019-01-14 00:26:10,745 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand 68 states. [2019-01-14 00:26:11,855 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-01-14 00:26:14,688 WARN L181 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 76 [2019-01-14 00:26:16,557 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 48 [2019-01-14 00:26:16,926 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 69 [2019-01-14 00:26:17,237 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 68 [2019-01-14 00:26:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:26:19,827 INFO L93 Difference]: Finished difference Result 190 states and 202 transitions. [2019-01-14 00:26:19,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 00:26:19,830 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 102 [2019-01-14 00:26:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:26:19,831 INFO L225 Difference]: With dead ends: 190 [2019-01-14 00:26:19,831 INFO L226 Difference]: Without dead ends: 190 [2019-01-14 00:26:19,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 66 SyntacticMatches, 15 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2358 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=572, Invalid=8520, Unknown=28, NotChecked=0, Total=9120 [2019-01-14 00:26:19,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-14 00:26:19,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 174. [2019-01-14 00:26:19,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-01-14 00:26:19,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 186 transitions. [2019-01-14 00:26:19,842 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 186 transitions. Word has length 102 [2019-01-14 00:26:19,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:26:19,842 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 186 transitions. [2019-01-14 00:26:19,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-14 00:26:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 186 transitions. [2019-01-14 00:26:19,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-14 00:26:19,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:26:19,847 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-14 00:26:19,847 INFO L423 AbstractCegarLoop]: === Iteration 30 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:26:19,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:26:19,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1975468031, now seen corresponding path program 2 times [2019-01-14 00:26:19,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:26:19,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:26:19,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:26:19,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:26:19,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:26:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:26:20,386 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-01-14 00:26:21,829 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-14 00:26:21,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:26:21,829 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-14 00:26:21,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:26:21,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:26:21,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:26:21,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:26:22,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:22,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:22,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2019-01-14 00:26:22,449 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-14 00:26:22,452 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-14 00:26:22,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:22,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:22,472 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-14 00:26:22,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:51 [2019-01-14 00:26:22,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:22,839 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-14 00:26:22,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:22,845 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-14 00:26:22,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:22,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:22,866 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-14 00:26:22,869 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-14 00:26:22,870 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-14 00:26:22,876 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-14 00:26:22,886 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-14 00:26:22,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:18 [2019-01-14 00:26:37,577 WARN L181 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 00:26:37,606 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-14 00:26:37,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, 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-14 00:26:37,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:37,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:37,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:37,677 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-14 00:26:37,680 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-14 00:26:37,734 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-14 00:26:37,783 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-14 00:26:37,783 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:92, output treesize:122 [2019-01-14 00:26:38,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:38,022 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-14 00:26:38,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2019-01-14 00:26:38,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:38,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:38,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:38,080 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-14 00:26:38,083 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-14 00:26:38,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:38,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:38,119 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-14 00:26:38,122 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-14 00:26:38,123 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-14 00:26:38,130 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-14 00:26:38,157 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-14 00:26:38,160 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-14 00:26:38,160 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:38,170 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:38,209 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-14 00:26:38,209 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:95, output treesize:37 [2019-01-14 00:26:51,559 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 00:26:51,570 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-14 00:26:51,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:51,576 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-14 00:26:51,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:51,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:51,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, 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-14 00:26:51,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:51,695 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-14 00:26:51,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:51,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:51,789 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-14 00:26:51,789 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:156, output treesize:120 [2019-01-14 00:26:51,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:51,949 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-14 00:26:51,952 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-14 00:26:51,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:51,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:51,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:51,993 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-14 00:26:51,996 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-14 00:26:51,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:52,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:52,021 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-14 00:26:52,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:89, output treesize:55 [2019-01-14 00:26:52,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:52,411 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-14 00:26:52,415 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-14 00:26:52,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:52,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:52,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:52,454 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-14 00:26:52,457 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-14 00:26:52,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:52,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:52,491 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-14 00:26:52,491 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:89, output treesize:55 [2019-01-14 00:26:52,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:52,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:52,857 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-14 00:26:52,858 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:52,883 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-14 00:26:52,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:52,904 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-14 00:26:52,904 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:95, output treesize:33 [2019-01-14 00:27:03,860 WARN L181 SmtUtils]: Spent 8.89 s on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 00:27:16,292 WARN L181 SmtUtils]: Spent 12.36 s on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 00:27:30,103 WARN L181 SmtUtils]: Spent 13.72 s on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 00:27:44,486 WARN L181 SmtUtils]: Spent 14.31 s on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 00:27:58,020 WARN L181 SmtUtils]: Spent 13.45 s on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 00:28:22,205 WARN L181 SmtUtils]: Spent 24.05 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 00:28:42,365 WARN L181 SmtUtils]: Spent 20.04 s on a formula simplification that was a NOOP. DAG size: 34 [2019-01-14 00:28:42,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:28:42,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:28:42,655 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-14 00:28:42,659 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-14 00:28:42,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:28:42,696 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:28:42,698 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-14 00:28:42,699 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-14 00:28:42,738 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:28:42,739 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-14 00:28:42,740 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-14 00:28:42,774 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-14 00:28:42,932 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-14 00:28:42,936 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:28:42,937 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-14 00:28:42,938 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-14 00:28:42,990 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-14 00:28:42,990 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:28:43,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:28:43,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:28:43,040 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:28:43,043 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-14 00:28:43,044 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-14 00:28:43,083 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-14 00:28:43,178 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-14 00:28:43,178 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 24 variables, input treesize:303, output treesize:105 [2019-01-14 00:29:15,163 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-14 00:29:15,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:29:15,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 58 [2019-01-14 00:29:15,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-14 00:29:15,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-14 00:29:15,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3187, Unknown=33, NotChecked=0, Total=3422 [2019-01-14 00:29:15,184 INFO L87 Difference]: Start difference. First operand 174 states and 186 transitions. Second operand 59 states. [2019-01-14 00:29:38,321 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2019-01-14 00:29:39,356 WARN L181 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2019-01-14 00:29:42,448 WARN L181 SmtUtils]: Spent 935.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-01-14 00:29:43,693 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2019-01-14 00:29:44,930 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-01-14 00:29:51,071 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 00:30:00,212 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 00:30:04,563 WARN L181 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-01-14 00:30:09,812 WARN L181 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2019-01-14 00:30:13,104 WARN L181 SmtUtils]: Spent 3.16 s on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-01-14 00:30:15,504 WARN L181 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-01-14 00:30:21,137 WARN L181 SmtUtils]: Spent 5.54 s on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2019-01-14 00:30:45,346 WARN L181 SmtUtils]: Spent 24.05 s on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 00:31:05,703 WARN L181 SmtUtils]: Spent 20.04 s on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 00:32:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:32:20,751 INFO L93 Difference]: Finished difference Result 214 states and 225 transitions. [2019-01-14 00:32:20,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-14 00:32:20,753 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 105 [2019-01-14 00:32:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:32:20,754 INFO L225 Difference]: With dead ends: 214 [2019-01-14 00:32:20,755 INFO L226 Difference]: Without dead ends: 137 [2019-01-14 00:32:20,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 79 SyntacticMatches, 15 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 265.4s TimeCoverageRelationStatistics Valid=615, Invalid=8082, Unknown=45, NotChecked=0, Total=8742 [2019-01-14 00:32:20,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-14 00:32:20,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 116. [2019-01-14 00:32:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-14 00:32:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2019-01-14 00:32:20,760 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 105 [2019-01-14 00:32:20,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:32:20,761 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2019-01-14 00:32:20,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-14 00:32:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2019-01-14 00:32:20,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-14 00:32:20,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:32:20,764 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-14 00:32:20,764 INFO L423 AbstractCegarLoop]: === Iteration 31 === [sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2019-01-14 00:32:20,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:32:20,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2007564225, now seen corresponding path program 3 times [2019-01-14 00:32:20,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:32:20,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:32:20,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:20,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:32:20,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:32:20,960 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-14 00:32:20,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:32:20,960 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-14 00:32:20,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 00:32:21,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 00:32:21,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:32:21,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:32:21,174 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-14 00:32:21,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:32:21,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 00:32:21,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:32:21,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:32:21,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:32:21,210 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 7 states. [2019-01-14 00:32:21,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:32:21,282 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-01-14 00:32:21,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:32:21,283 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-01-14 00:32:21,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:32:21,284 INFO L225 Difference]: With dead ends: 37 [2019-01-14 00:32:21,284 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 00:32:21,285 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-14 00:32:21,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 00:32:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 00:32:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 00:32:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 00:32:21,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2019-01-14 00:32:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:32:21,286 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 00:32:21,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:32:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 00:32:21,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 00:32:21,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:32:21 BoogieIcfgContainer [2019-01-14 00:32:21,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 00:32:21,292 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 00:32:21,292 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 00:32:21,293 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 00:32:21,293 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:22:42" (3/4) ... [2019-01-14 00:32:21,297 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 00:32:21,305 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 00:32:21,305 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-14 00:32:21,305 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2019-01-14 00:32:21,306 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_update_at [2019-01-14 00:32:21,306 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 00:32:21,306 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 00:32:21,306 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2019-01-14 00:32:21,306 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_get_data_at [2019-01-14 00:32:21,306 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 00:32:21,307 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-01-14 00:32:21,313 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-01-14 00:32:21,314 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-01-14 00:32:21,314 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 00:32:21,367 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 00:32:21,367 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 00:32:21,368 INFO L168 Benchmark]: Toolchain (without parser) took 581032.78 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.1 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -55.6 MB). Peak memory consumption was 172.5 MB. Max. memory is 11.5 GB. [2019-01-14 00:32:21,368 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:32:21,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 688.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-01-14 00:32:21,369 INFO L168 Benchmark]: Boogie Preprocessor took 90.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 00:32:21,369 INFO L168 Benchmark]: RCFGBuilder took 926.62 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: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2019-01-14 00:32:21,369 INFO L168 Benchmark]: TraceAbstraction took 579247.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 84.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.2 MB). Peak memory consumption was 141.1 MB. Max. memory is 11.5 GB. [2019-01-14 00:32:21,372 INFO L168 Benchmark]: Witness Printer took 74.52 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:32:21,374 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 688.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 926.62 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: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 579247.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 84.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.2 MB). Peak memory consumption was 141.1 MB. Max. memory is 11.5 GB. * Witness Printer took 74.52 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free 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: 584]: free always succeeds For all program executions holds that free 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: 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: 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: 593]: 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: 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, 95 locations, 20 error locations. SAFE Result, 579.1s OverallTime, 31 OverallIterations, 3 TraceHistogramMax, 307.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1942 SDtfs, 3063 SDslu, 14027 SDs, 0 SdLazy, 26358 SolverSat, 823 SolverUnsat, 81 SolverUnknown, 0 SolverNotchecked, 155.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2025 GetRequests, 949 SyntacticMatches, 131 SemanticMatches, 945 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 11857 ImplicationChecksByTransitivity, 405.2s 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.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 268.8s 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...