./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 20:34:42,510 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 20:34:42,512 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 20:34:42,529 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 20:34:42,529 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 20:34:42,530 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 20:34:42,531 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 20:34:42,533 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 20:34:42,535 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 20:34:42,536 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 20:34:42,537 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 20:34:42,537 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 20:34:42,543 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 20:34:42,544 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 20:34:42,545 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 20:34:42,546 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 20:34:42,549 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 20:34:42,552 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 20:34:42,557 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 20:34:42,559 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 20:34:42,560 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 20:34:42,562 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 20:34:42,564 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 20:34:42,564 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 20:34:42,564 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 20:34:42,566 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 20:34:42,567 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 20:34:42,567 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 20:34:42,568 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 20:34:42,569 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 20:34:42,570 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 20:34:42,570 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 20:34:42,571 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 20:34:42,571 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 20:34:42,572 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 20:34:42,572 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 20:34:42,573 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 20:34:42,587 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 20:34:42,588 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 20:34:42,589 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 20:34:42,589 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 20:34:42,590 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 20:34:42,590 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 20:34:42,590 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 20:34:42,590 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 20:34:42,590 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 20:34:42,590 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 20:34:42,591 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 20:34:42,591 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 20:34:42,591 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 20:34:42,591 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 20:34:42,591 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 20:34:42,591 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 20:34:42,593 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 20:34:42,593 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 20:34:42,593 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 20:34:42,594 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 20:34:42,594 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 20:34:42,594 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 20:34:42,594 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 20:34:42,594 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 20:34:42,594 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 20:34:42,596 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 20:34:42,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 20:34:42,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 20:34:42,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 20:34:42,661 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 20:34:42,662 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 20:34:42,663 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 20:34:42,725 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a55468c6/aa621e6352544757a3e1d7076e5fd517/FLAG848640d60 [2019-01-14 20:34:43,282 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 20:34:43,283 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-14 20:34:43,307 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a55468c6/aa621e6352544757a3e1d7076e5fd517/FLAG848640d60 [2019-01-14 20:34:43,558 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a55468c6/aa621e6352544757a3e1d7076e5fd517 [2019-01-14 20:34:43,561 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 20:34:43,562 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 20:34:43,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 20:34:43,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 20:34:43,568 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 20:34:43,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:34:43" (1/1) ... [2019-01-14 20:34:43,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32cee918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:34:43, skipping insertion in model container [2019-01-14 20:34:43,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:34:43" (1/1) ... [2019-01-14 20:34:43,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 20:34:43,641 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 20:34:43,983 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:34:43,998 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 20:34:44,134 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:34:44,187 INFO L195 MainTranslator]: Completed translation [2019-01-14 20:34:44,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:34:44 WrapperNode [2019-01-14 20:34:44,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 20:34:44,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 20:34:44,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 20:34:44,189 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 20:34:44,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:34:44" (1/1) ... [2019-01-14 20:34:44,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:34:44" (1/1) ... [2019-01-14 20:34:44,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:34:44" (1/1) ... [2019-01-14 20:34:44,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:34:44" (1/1) ... [2019-01-14 20:34:44,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:34:44" (1/1) ... [2019-01-14 20:34:44,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:34:44" (1/1) ... [2019-01-14 20:34:44,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:34:44" (1/1) ... [2019-01-14 20:34:44,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 20:34:44,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 20:34:44,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 20:34:44,267 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 20:34:44,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:34:44" (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 20:34:44,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 20:34:44,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 20:34:44,325 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 20:34:44,325 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 20:34:44,325 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-14 20:34:44,326 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-01-14 20:34:44,326 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-01-14 20:34:44,326 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-01-14 20:34:44,326 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2019-01-14 20:34:44,326 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2019-01-14 20:34:44,326 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 20:34:44,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 20:34:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 20:34:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 20:34:44,328 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 20:34:44,329 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 20:34:44,329 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 20:34:44,329 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 20:34:44,329 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 20:34:44,330 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 20:34:44,330 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 20:34:44,330 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 20:34:44,331 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 20:34:44,331 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 20:34:44,331 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 20:34:44,331 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 20:34:44,331 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 20:34:44,331 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 20:34:44,331 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 20:34:44,332 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 20:34:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 20:34:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 20:34:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 20:34:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 20:34:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 20:34:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 20:34:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 20:34:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 20:34:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 20:34:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 20:34:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 20:34:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 20:34:44,335 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 20:34:44,336 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 20:34:44,336 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 20:34:44,336 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 20:34:44,336 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 20:34:44,337 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 20:34:44,337 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 20:34:44,337 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 20:34:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 20:34:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 20:34:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 20:34:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 20:34:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 20:34:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 20:34:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 20:34:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 20:34:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 20:34:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 20:34:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 20:34:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 20:34:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 20:34:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 20:34:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 20:34:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 20:34:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 20:34:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 20:34:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 20:34:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 20:34:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 20:34:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 20:34:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-14 20:34:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 20:34:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 20:34:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-14 20:34:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 20:34:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 20:34:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-14 20:34:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 20:34:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 20:34:44,344 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 20:34:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 20:34:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 20:34:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 20:34:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 20:34:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 20:34:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 20:34:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 20:34:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 20:34:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 20:34:44,347 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 20:34:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 20:34:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 20:34:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 20:34:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 20:34:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 20:34:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 20:34:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 20:34:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 20:34:44,349 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 20:34:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 20:34:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 20:34:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 20:34:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 20:34:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 20:34:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 20:34:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 20:34:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 20:34:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 20:34:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 20:34:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 20:34:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 20:34:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 20:34:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 20:34:44,352 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 20:34:44,353 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 20:34:44,353 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-14 20:34:44,353 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-01-14 20:34:44,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 20:34:44,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 20:34:44,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 20:34:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-01-14 20:34:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-01-14 20:34:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 20:34:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 20:34:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2019-01-14 20:34:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 20:34:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2019-01-14 20:34:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 20:34:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 20:34:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 20:34:44,861 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-14 20:34:45,177 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 20:34:45,177 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 20:34:45,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:34:45 BoogieIcfgContainer [2019-01-14 20:34:45,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 20:34:45,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 20:34:45,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 20:34:45,183 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 20:34:45,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 08:34:43" (1/3) ... [2019-01-14 20:34:45,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b60c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:34:45, skipping insertion in model container [2019-01-14 20:34:45,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:34:44" (2/3) ... [2019-01-14 20:34:45,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b60c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:34:45, skipping insertion in model container [2019-01-14 20:34:45,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:34:45" (3/3) ... [2019-01-14 20:34:45,187 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-14 20:34:45,196 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 20:34:45,204 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-01-14 20:34:45,221 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-01-14 20:34:45,247 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 20:34:45,248 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 20:34:45,248 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 20:34:45,249 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 20:34:45,249 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 20:34:45,250 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 20:34:45,250 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 20:34:45,250 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 20:34:45,250 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 20:34:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-01-14 20:34:45,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 20:34:45,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:45,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:45,282 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:45,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:45,289 INFO L82 PathProgramCache]: Analyzing trace with hash 360562924, now seen corresponding path program 1 times [2019-01-14 20:34:45,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:45,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:45,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:45,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:45,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:45,486 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 20:34:45,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:34:45,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:34:45,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:34:45,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:34:45,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:34:45,509 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2019-01-14 20:34:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:45,675 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2019-01-14 20:34:45,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:34:45,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-14 20:34:45,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:45,686 INFO L225 Difference]: With dead ends: 86 [2019-01-14 20:34:45,686 INFO L226 Difference]: Without dead ends: 79 [2019-01-14 20:34:45,688 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 20:34:45,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-14 20:34:45,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-14 20:34:45,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 20:34:45,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-01-14 20:34:45,725 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 13 [2019-01-14 20:34:45,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:45,726 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-01-14 20:34:45,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:34:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-01-14 20:34:45,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 20:34:45,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:45,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:34:45,727 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:45,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:45,728 INFO L82 PathProgramCache]: Analyzing trace with hash 360562925, now seen corresponding path program 1 times [2019-01-14 20:34:45,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:45,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:45,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:45,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:45,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:45,827 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 20:34:45,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:34:45,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:34:45,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:34:45,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:34:45,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:34:45,830 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 3 states. [2019-01-14 20:34:45,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:45,927 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-01-14 20:34:45,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:34:45,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-14 20:34:45,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:45,929 INFO L225 Difference]: With dead ends: 77 [2019-01-14 20:34:45,930 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 20:34:45,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:34:45,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 20:34:45,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-14 20:34:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 20:34:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-01-14 20:34:45,940 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 13 [2019-01-14 20:34:45,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:45,941 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-01-14 20:34:45,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:34:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-01-14 20:34:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 20:34:45,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:45,942 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 20:34:45,943 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:45,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:45,943 INFO L82 PathProgramCache]: Analyzing trace with hash -611679416, now seen corresponding path program 1 times [2019-01-14 20:34:45,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:45,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:45,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:45,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:45,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:46,047 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 20:34:46,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:34:46,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:34:46,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 20:34:46,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 20:34:46,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:34:46,050 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-01-14 20:34:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:46,375 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2019-01-14 20:34:46,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 20:34:46,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-01-14 20:34:46,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:46,379 INFO L225 Difference]: With dead ends: 88 [2019-01-14 20:34:46,380 INFO L226 Difference]: Without dead ends: 85 [2019-01-14 20:34:46,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:34:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-14 20:34:46,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2019-01-14 20:34:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-14 20:34:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-01-14 20:34:46,395 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 18 [2019-01-14 20:34:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:46,395 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-01-14 20:34:46,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 20:34:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-01-14 20:34:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 20:34:46,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:46,397 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 20:34:46,398 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:46,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:46,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1012902948, now seen corresponding path program 1 times [2019-01-14 20:34:46,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:46,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:46,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:46,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:46,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:46,614 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 20:34:46,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:34:46,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:34:46,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:34:46,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:34:46,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:34:46,616 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 6 states. [2019-01-14 20:34:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:46,914 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-01-14 20:34:46,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:34:46,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 20:34:46,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:46,920 INFO L225 Difference]: With dead ends: 78 [2019-01-14 20:34:46,920 INFO L226 Difference]: Without dead ends: 78 [2019-01-14 20:34:46,921 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 20:34:46,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-14 20:34:46,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-01-14 20:34:46,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 20:34:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-01-14 20:34:46,932 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 19 [2019-01-14 20:34:46,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:46,932 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-01-14 20:34:46,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:34:46,932 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-01-14 20:34:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 20:34:46,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:46,935 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 20:34:46,935 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:46,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:46,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1012902949, now seen corresponding path program 1 times [2019-01-14 20:34:46,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:46,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:46,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:46,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:46,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:47,099 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 20:34:47,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:34:47,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:34:47,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:34:47,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:34:47,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:34:47,102 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2019-01-14 20:34:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:47,343 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-01-14 20:34:47,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:34:47,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 20:34:47,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:47,346 INFO L225 Difference]: With dead ends: 77 [2019-01-14 20:34:47,346 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 20:34:47,347 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 20:34:47,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 20:34:47,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-01-14 20:34:47,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-14 20:34:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-01-14 20:34:47,354 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 19 [2019-01-14 20:34:47,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:47,354 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-01-14 20:34:47,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:34:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-01-14 20:34:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 20:34:47,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:47,356 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 20:34:47,356 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:47,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:47,357 INFO L82 PathProgramCache]: Analyzing trace with hash -343567322, now seen corresponding path program 1 times [2019-01-14 20:34:47,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:47,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:47,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:47,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:47,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:47,583 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 20:34:47,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:34:47,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 20:34:47,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:34:47,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:34:47,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:34:47,585 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 12 states. [2019-01-14 20:34:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:48,300 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-01-14 20:34:48,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:34:48,302 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-01-14 20:34:48,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:48,303 INFO L225 Difference]: With dead ends: 82 [2019-01-14 20:34:48,304 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 20:34:48,305 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 20:34:48,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 20:34:48,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-01-14 20:34:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 20:34:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2019-01-14 20:34:48,311 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 31 [2019-01-14 20:34:48,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:48,312 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2019-01-14 20:34:48,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:34:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2019-01-14 20:34:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 20:34:48,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:48,313 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 20:34:48,313 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:48,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:48,314 INFO L82 PathProgramCache]: Analyzing trace with hash -343567321, now seen corresponding path program 1 times [2019-01-14 20:34:48,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:48,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:48,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:48,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:48,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:48,551 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 20:34:48,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:34:48,551 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 20:34:48,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:48,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:34:48,667 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 20:34:48,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:34:48,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 20:34:48,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:34:48,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:34:48,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:34:48,688 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 6 states. [2019-01-14 20:34:48,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:48,784 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2019-01-14 20:34:48,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:34:48,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-01-14 20:34:48,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:48,786 INFO L225 Difference]: With dead ends: 93 [2019-01-14 20:34:48,786 INFO L226 Difference]: Without dead ends: 90 [2019-01-14 20:34:48,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:34:48,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-14 20:34:48,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2019-01-14 20:34:48,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-14 20:34:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-01-14 20:34:48,794 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 31 [2019-01-14 20:34:48,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:48,794 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-01-14 20:34:48,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:34:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-01-14 20:34:48,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 20:34:48,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:48,796 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 20:34:48,797 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:48,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:48,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1504093175, now seen corresponding path program 2 times [2019-01-14 20:34:48,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:48,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:48,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:48,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:48,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:48,936 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 20:34:48,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:34:48,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 20:34:48,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:34:48,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:34:48,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:34:48,939 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 6 states. [2019-01-14 20:34:49,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:49,148 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2019-01-14 20:34:49,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:34:49,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-01-14 20:34:49,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:49,151 INFO L225 Difference]: With dead ends: 106 [2019-01-14 20:34:49,151 INFO L226 Difference]: Without dead ends: 106 [2019-01-14 20:34:49,151 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 20:34:49,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-14 20:34:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2019-01-14 20:34:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 20:34:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2019-01-14 20:34:49,162 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 44 [2019-01-14 20:34:49,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:49,166 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2019-01-14 20:34:49,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:34:49,166 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2019-01-14 20:34:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 20:34:49,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:49,171 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 20:34:49,172 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:49,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:49,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1504093120, now seen corresponding path program 1 times [2019-01-14 20:34:49,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:49,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:49,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:34:49,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:49,498 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 20:34:49,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:34:49,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 20:34:49,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 20:34:49,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 20:34:49,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:34:49,500 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand 13 states. [2019-01-14 20:34:50,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:34:50,040 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2019-01-14 20:34:50,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 20:34:50,043 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-01-14 20:34:50,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:34:50,045 INFO L225 Difference]: With dead ends: 101 [2019-01-14 20:34:50,045 INFO L226 Difference]: Without dead ends: 101 [2019-01-14 20:34:50,046 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 20:34:50,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-14 20:34:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-01-14 20:34:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 20:34:50,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-01-14 20:34:50,053 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 44 [2019-01-14 20:34:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:34:50,054 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-01-14 20:34:50,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 20:34:50,054 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-01-14 20:34:50,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 20:34:50,057 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:34:50,057 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 20:34:50,057 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:34:50,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:34:50,059 INFO L82 PathProgramCache]: Analyzing trace with hash 955614394, now seen corresponding path program 1 times [2019-01-14 20:34:50,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:34:50,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:34:50,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:50,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:50,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:34:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:50,409 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-14 20:34:51,149 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 20:34:51,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:34:51,149 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 20:34:51,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:34:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:34:51,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:34:58,399 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 20:34:58,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:58,404 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 20:34:58,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-14 20:34:58,430 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 20:34:58,433 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 20:34:58,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:34:58,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:34:58,438 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 20:34:58,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-01-14 20:35:01,030 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 20:35:01,048 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 20:35:01,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:01,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:01,064 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 20:35:01,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-01-14 20:35:01,091 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 20:35:01,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:35:01,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 30 [2019-01-14 20:35:01,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-14 20:35:01,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-14 20:35:01,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=835, Unknown=23, NotChecked=0, Total=930 [2019-01-14 20:35:01,111 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 31 states. [2019-01-14 20:35:01,402 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2019-01-14 20:35:01,946 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 20:35:02,349 WARN L181 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 20:35:03,015 WARN L181 SmtUtils]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 20:35:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:35:33,209 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2019-01-14 20:35:33,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 20:35:33,210 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 47 [2019-01-14 20:35:33,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:35:33,212 INFO L225 Difference]: With dead ends: 130 [2019-01-14 20:35:33,212 INFO L226 Difference]: Without dead ends: 130 [2019-01-14 20:35:33,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=208, Invalid=2005, Unknown=43, NotChecked=0, Total=2256 [2019-01-14 20:35:33,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-14 20:35:33,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 101. [2019-01-14 20:35:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 20:35:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2019-01-14 20:35:33,222 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 47 [2019-01-14 20:35:33,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:35:33,223 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2019-01-14 20:35:33,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-14 20:35:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2019-01-14 20:35:33,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 20:35:33,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:35:33,226 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 20:35:33,226 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:35:33,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:35:33,226 INFO L82 PathProgramCache]: Analyzing trace with hash 955614395, now seen corresponding path program 1 times [2019-01-14 20:35:33,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:35:33,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:35:33,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:33,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:35:33,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:33,651 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-14 20:35:33,958 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-01-14 20:35:34,886 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 20:35:34,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:35:34,886 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 20:35:34,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:35:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:34,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:35:34,948 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 20:35:34,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:34,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:34,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-14 20:35:35,535 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 20:35:35,544 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 20:35:35,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:35,552 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 20:35:35,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2019-01-14 20:35:35,593 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 20:35:35,596 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 20:35:35,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:35,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:35,614 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 20:35:35,617 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 20:35:35,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:35,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:35,630 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 20:35:35,631 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:40 [2019-01-14 20:35:35,996 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 20:35:36,013 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 20:35:36,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:36,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:36,041 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 20:35:36,043 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 20:35:36,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:36,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:36,052 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 20:35:36,053 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:16 [2019-01-14 20:35:36,180 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 20:35:36,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:35:36,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 38 [2019-01-14 20:35:36,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-14 20:35:36,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-14 20:35:36,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1324, Unknown=1, NotChecked=72, Total=1482 [2019-01-14 20:35:36,202 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 39 states. [2019-01-14 20:35:37,210 WARN L181 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-01-14 20:35:38,157 WARN L181 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-01-14 20:35:38,961 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-01-14 20:35:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:35:42,095 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2019-01-14 20:35:42,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 20:35:42,096 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 47 [2019-01-14 20:35:42,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:35:42,098 INFO L225 Difference]: With dead ends: 155 [2019-01-14 20:35:42,098 INFO L226 Difference]: Without dead ends: 155 [2019-01-14 20:35:42,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=210, Invalid=2445, Unknown=1, NotChecked=100, Total=2756 [2019-01-14 20:35:42,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-14 20:35:42,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 116. [2019-01-14 20:35:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-14 20:35:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2019-01-14 20:35:42,107 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 47 [2019-01-14 20:35:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:35:42,109 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2019-01-14 20:35:42,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-14 20:35:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2019-01-14 20:35:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 20:35:42,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:35:42,112 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 20:35:42,112 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:35:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:35:42,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1666795208, now seen corresponding path program 2 times [2019-01-14 20:35:42,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:35:42,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:35:42,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:42,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:35:42,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:42,413 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 20:35:42,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:35:42,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 20:35:42,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:35:42,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:35:42,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:35:42,415 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand 7 states. [2019-01-14 20:35:42,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:35:42,475 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2019-01-14 20:35:42,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:35:42,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-01-14 20:35:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:35:42,478 INFO L225 Difference]: With dead ends: 92 [2019-01-14 20:35:42,478 INFO L226 Difference]: Without dead ends: 92 [2019-01-14 20:35:42,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:35:42,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-14 20:35:42,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-14 20:35:42,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 20:35:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2019-01-14 20:35:42,485 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 50 [2019-01-14 20:35:42,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:35:42,485 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2019-01-14 20:35:42,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:35:42,485 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2019-01-14 20:35:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 20:35:42,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:35:42,489 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 20:35:42,489 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:35:42,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:35:42,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1828517252, now seen corresponding path program 1 times [2019-01-14 20:35:42,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:35:42,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:35:42,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:42,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:35:42,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:42,644 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 20:35:42,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:35:42,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 20:35:42,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:35:42,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:35:42,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:35:42,646 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 12 states. [2019-01-14 20:35:43,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:35:43,458 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2019-01-14 20:35:43,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:35:43,459 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-01-14 20:35:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:35:43,461 INFO L225 Difference]: With dead ends: 97 [2019-01-14 20:35:43,462 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 20:35:43,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 20:35:43,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 20:35:43,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-01-14 20:35:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-14 20:35:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2019-01-14 20:35:43,468 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 57 [2019-01-14 20:35:43,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:35:43,468 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2019-01-14 20:35:43,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:35:43,468 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2019-01-14 20:35:43,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 20:35:43,471 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:35:43,471 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 20:35:43,472 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:35:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:35:43,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1828517253, now seen corresponding path program 1 times [2019-01-14 20:35:43,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:35:43,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:35:43,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:43,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:35:43,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:43,704 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 20:35:43,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:35:43,705 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 20:35:43,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:35:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:43,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:35:43,772 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 20:35:43,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:35:43,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 20:35:43,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 20:35:43,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 20:35:43,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:35:43,796 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 5 states. [2019-01-14 20:35:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:35:44,005 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2019-01-14 20:35:44,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 20:35:44,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-01-14 20:35:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:35:44,007 INFO L225 Difference]: With dead ends: 102 [2019-01-14 20:35:44,007 INFO L226 Difference]: Without dead ends: 102 [2019-01-14 20:35:44,007 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 20:35:44,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-14 20:35:44,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-14 20:35:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-14 20:35:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2019-01-14 20:35:44,012 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 57 [2019-01-14 20:35:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:35:44,012 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2019-01-14 20:35:44,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 20:35:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2019-01-14 20:35:44,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 20:35:44,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:35:44,013 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 20:35:44,013 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:35:44,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:35:44,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1316396204, now seen corresponding path program 1 times [2019-01-14 20:35:44,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:35:44,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:35:44,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:44,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:35:44,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:44,466 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 20:35:44,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:35:44,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 20:35:44,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:35:44,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:35:44,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:35:44,467 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 7 states. [2019-01-14 20:35:44,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:35:44,653 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2019-01-14 20:35:44,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 20:35:44,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-01-14 20:35:44,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:35:44,657 INFO L225 Difference]: With dead ends: 97 [2019-01-14 20:35:44,657 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 20:35:44,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:35:44,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 20:35:44,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-14 20:35:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 20:35:44,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2019-01-14 20:35:44,661 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 58 [2019-01-14 20:35:44,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:35:44,662 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2019-01-14 20:35:44,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:35:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2019-01-14 20:35:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 20:35:44,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:35:44,663 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 20:35:44,663 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:35:44,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:35:44,663 INFO L82 PathProgramCache]: Analyzing trace with hash 953803641, now seen corresponding path program 2 times [2019-01-14 20:35:44,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:35:44,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:35:44,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:44,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:35:44,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:44,806 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 20:35:44,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:35:44,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 20:35:44,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:35:44,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:35:44,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:35:44,807 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 6 states. [2019-01-14 20:35:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:35:44,873 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2019-01-14 20:35:44,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:35:44,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-01-14 20:35:44,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:35:44,876 INFO L225 Difference]: With dead ends: 111 [2019-01-14 20:35:44,876 INFO L226 Difference]: Without dead ends: 111 [2019-01-14 20:35:44,876 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 20:35:44,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-14 20:35:44,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2019-01-14 20:35:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 20:35:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2019-01-14 20:35:44,880 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 65 [2019-01-14 20:35:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:35:44,881 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2019-01-14 20:35:44,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:35:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2019-01-14 20:35:44,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 20:35:44,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:35:44,882 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 20:35:44,882 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:35:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:35:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash 953803696, now seen corresponding path program 1 times [2019-01-14 20:35:44,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:35:44,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:35:44,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:44,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:35:44,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:45,328 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 20:35:45,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:35:45,329 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 20:35:45,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:35:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:45,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:35:45,838 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 20:35:45,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:35:45,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 27 [2019-01-14 20:35:45,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 20:35:45,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 20:35:45,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2019-01-14 20:35:45,859 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand 28 states. [2019-01-14 20:35:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:35:46,498 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2019-01-14 20:35:46,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 20:35:46,499 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 65 [2019-01-14 20:35:46,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:35:46,501 INFO L225 Difference]: With dead ends: 113 [2019-01-14 20:35:46,501 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 20:35:46,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2019-01-14 20:35:46,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 20:35:46,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2019-01-14 20:35:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 20:35:46,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2019-01-14 20:35:46,506 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 65 [2019-01-14 20:35:46,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:35:46,507 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2019-01-14 20:35:46,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 20:35:46,507 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2019-01-14 20:35:46,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-14 20:35:46,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:35:46,508 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 20:35:46,508 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:35:46,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:35:46,509 INFO L82 PathProgramCache]: Analyzing trace with hash -737720004, now seen corresponding path program 1 times [2019-01-14 20:35:46,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:35:46,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:35:46,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:46,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:35:46,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:47,339 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 20:35:47,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:35:47,340 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 20:35:47,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:35:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:47,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:35:47,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:47,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:47,608 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 20:35:47,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:47,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:47,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-14 20:35:47,673 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 20:35:47,691 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 20:35:47,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:47,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:47,809 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 20:35:47,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-01-14 20:35:50,062 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 20:35:50,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:50,083 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 20:35:50,104 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 20:35:50,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:50,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:50,123 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 20:35:50,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:25 [2019-01-14 20:35:50,174 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 20:35:50,177 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:35:50,178 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 20:35:50,179 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 20:35:50,183 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 20:35:50,189 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 20:35:50,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-01-14 20:35:50,356 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 20:35:50,390 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:35:50,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:50,417 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 20:35:50,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:50,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:50,441 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 20:35:50,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2019-01-14 20:35:50,615 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 20:35:50,634 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:35:50,635 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 20:35:50,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:50,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:50,645 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 20:35:50,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:5 [2019-01-14 20:35:50,734 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 20:35:50,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:35:50,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 41 [2019-01-14 20:35:50,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-14 20:35:50,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-14 20:35:50,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1609, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 20:35:50,754 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 42 states. [2019-01-14 20:35:53,953 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 20:35:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:35:55,530 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2019-01-14 20:35:55,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 20:35:55,531 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 68 [2019-01-14 20:35:55,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:35:55,533 INFO L225 Difference]: With dead ends: 138 [2019-01-14 20:35:55,534 INFO L226 Difference]: Without dead ends: 138 [2019-01-14 20:35:55,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 49 SyntacticMatches, 14 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=349, Invalid=3811, Unknown=0, NotChecked=0, Total=4160 [2019-01-14 20:35:55,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-14 20:35:55,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 115. [2019-01-14 20:35:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-14 20:35:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2019-01-14 20:35:55,541 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 68 [2019-01-14 20:35:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:35:55,541 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2019-01-14 20:35:55,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-14 20:35:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2019-01-14 20:35:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-14 20:35:55,543 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:35:55,544 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 20:35:55,544 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:35:55,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:35:55,544 INFO L82 PathProgramCache]: Analyzing trace with hash -737720003, now seen corresponding path program 1 times [2019-01-14 20:35:55,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:35:55,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:35:55,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:55,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:35:55,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:35:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:55,860 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-14 20:35:57,301 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 20:35:57,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:35:57,301 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 20:35:57,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:35:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:35:57,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:35:57,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:57,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:35:57,726 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 20:35:57,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:57,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:57,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-01-14 20:35:57,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, 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 20:35:57,827 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 20:35:57,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:57,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:57,848 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 20:35:57,852 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 20:35:57,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:57,854 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:57,865 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 20:35:57,866 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:17 [2019-01-14 20:35:58,482 INFO L303 Elim1Store]: Index analysis took 106 ms [2019-01-14 20:35:58,483 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 20:35:58,495 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 20:35:58,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:58,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:58,602 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 20:35:58,606 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 20:35:58,607 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:58,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:58,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:58,624 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:135, output treesize:45 [2019-01-14 20:35:58,702 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 20:35:58,706 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 20:35:58,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:35:58,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:35:58,729 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 20:35:58,732 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 20:35:58,733 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 20:35:58,740 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 20:35:58,753 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 20:35:58,754 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:12 [2019-01-14 20:36:04,966 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 20:36:04,985 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 20:36:04,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:04,991 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 20:36:04,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:05,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:05,028 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 20:36:05,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:05,033 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 20:36:05,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:05,042 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:05,063 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 20:36:05,063 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:50 [2019-01-14 20:36:05,346 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 20:36:05,349 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 20:36:05,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:05,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:05,376 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 20:36:05,381 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 20:36:05,382 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:05,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:05,402 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 20:36:05,402 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:11 [2019-01-14 20:36:05,609 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 20:36:05,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:36:05,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 57 [2019-01-14 20:36:05,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-14 20:36:05,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-14 20:36:05,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3134, Unknown=2, NotChecked=0, Total=3306 [2019-01-14 20:36:05,630 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand 58 states. [2019-01-14 20:36:10,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:36:10,323 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2019-01-14 20:36:10,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-14 20:36:10,325 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 68 [2019-01-14 20:36:10,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:36:10,327 INFO L225 Difference]: With dead ends: 141 [2019-01-14 20:36:10,327 INFO L226 Difference]: Without dead ends: 141 [2019-01-14 20:36:10,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=469, Invalid=6009, Unknown=2, NotChecked=0, Total=6480 [2019-01-14 20:36:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-14 20:36:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 114. [2019-01-14 20:36:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 20:36:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2019-01-14 20:36:10,335 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 68 [2019-01-14 20:36:10,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:36:10,335 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2019-01-14 20:36:10,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-14 20:36:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2019-01-14 20:36:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-14 20:36:10,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:36:10,336 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 20:36:10,336 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:36:10,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:36:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash -67314440, now seen corresponding path program 2 times [2019-01-14 20:36:10,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:36:10,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:36:10,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:10,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:36:10,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:36:10,578 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 20:36:10,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:36:10,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 20:36:10,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:36:10,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:36:10,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:36:10,579 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 7 states. [2019-01-14 20:36:10,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:36:10,701 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2019-01-14 20:36:10,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:36:10,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-01-14 20:36:10,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:36:10,703 INFO L225 Difference]: With dead ends: 100 [2019-01-14 20:36:10,703 INFO L226 Difference]: Without dead ends: 100 [2019-01-14 20:36:10,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:36:10,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-14 20:36:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-14 20:36:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 20:36:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-01-14 20:36:10,707 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 71 [2019-01-14 20:36:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:36:10,707 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-01-14 20:36:10,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:36:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-01-14 20:36:10,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-14 20:36:10,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:36:10,708 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 20:36:10,709 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:36:10,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:36:10,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1871003433, now seen corresponding path program 1 times [2019-01-14 20:36:10,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:36:10,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:36:10,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:10,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:36:10,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:36:11,286 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 20:36:11,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:36:11,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 20:36:11,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:36:11,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:36:11,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:36:11,288 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 12 states. [2019-01-14 20:36:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:36:11,609 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2019-01-14 20:36:11,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 20:36:11,611 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-01-14 20:36:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:36:11,612 INFO L225 Difference]: With dead ends: 113 [2019-01-14 20:36:11,613 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 20:36:11,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 20:36:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 20:36:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2019-01-14 20:36:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 20:36:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2019-01-14 20:36:11,617 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 90 [2019-01-14 20:36:11,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:36:11,617 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2019-01-14 20:36:11,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:36:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2019-01-14 20:36:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-14 20:36:11,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:36:11,621 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 20:36:11,621 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:36:11,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:36:11,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1871003432, now seen corresponding path program 1 times [2019-01-14 20:36:11,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:36:11,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:36:11,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:11,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:36:11,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:36:11,968 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 20:36:11,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:36:11,969 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 20:36:11,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:36:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:36:12,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:36:12,409 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 20:36:12,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:36:12,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 20 [2019-01-14 20:36:12,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 20:36:12,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 20:36:12,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-01-14 20:36:12,429 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand 21 states. [2019-01-14 20:36:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:36:12,954 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2019-01-14 20:36:12,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 20:36:12,958 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 90 [2019-01-14 20:36:12,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:36:12,959 INFO L225 Difference]: With dead ends: 109 [2019-01-14 20:36:12,960 INFO L226 Difference]: Without dead ends: 109 [2019-01-14 20:36:12,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 74 SyntacticMatches, 14 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-01-14 20:36:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-14 20:36:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-01-14 20:36:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 20:36:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2019-01-14 20:36:12,965 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 90 [2019-01-14 20:36:12,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:36:12,965 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2019-01-14 20:36:12,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 20:36:12,965 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2019-01-14 20:36:12,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-14 20:36:12,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:36:12,968 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 20:36:12,968 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:36:12,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:36:12,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1020976587, now seen corresponding path program 1 times [2019-01-14 20:36:12,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:36:12,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:36:12,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:12,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:36:12,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:36:13,302 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 20:36:13,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:36:13,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-14 20:36:13,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 20:36:13,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 20:36:13,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:36:13,303 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 13 states. [2019-01-14 20:36:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:36:13,576 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2019-01-14 20:36:13,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 20:36:13,577 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-01-14 20:36:13,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:36:13,579 INFO L225 Difference]: With dead ends: 108 [2019-01-14 20:36:13,580 INFO L226 Difference]: Without dead ends: 106 [2019-01-14 20:36:13,581 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 20:36:13,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-14 20:36:13,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2019-01-14 20:36:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 20:36:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2019-01-14 20:36:13,584 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 93 [2019-01-14 20:36:13,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:36:13,584 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2019-01-14 20:36:13,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 20:36:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2019-01-14 20:36:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-14 20:36:13,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:36:13,585 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 20:36:13,589 INFO L423 AbstractCegarLoop]: === Iteration 24 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:36:13,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:36:13,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1022303986, now seen corresponding path program 1 times [2019-01-14 20:36:13,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:36:13,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:36:13,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:13,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:36:13,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:36:14,093 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 20:36:14,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:36:14,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 20:36:14,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:36:14,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:36:14,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:36:14,094 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand 12 states. [2019-01-14 20:36:14,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:36:14,391 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2019-01-14 20:36:14,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 20:36:14,394 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-01-14 20:36:14,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:36:14,395 INFO L225 Difference]: With dead ends: 104 [2019-01-14 20:36:14,395 INFO L226 Difference]: Without dead ends: 104 [2019-01-14 20:36:14,396 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 20:36:14,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-14 20:36:14,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-14 20:36:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 20:36:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2019-01-14 20:36:14,399 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 93 [2019-01-14 20:36:14,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:36:14,399 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2019-01-14 20:36:14,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:36:14,400 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2019-01-14 20:36:14,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-14 20:36:14,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:36:14,401 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 20:36:14,404 INFO L423 AbstractCegarLoop]: === Iteration 25 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:36:14,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:36:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash -154974852, now seen corresponding path program 1 times [2019-01-14 20:36:14,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:36:14,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:36:14,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:14,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:36:14,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:36:15,789 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 20:36:15,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:36:15,790 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 20:36:15,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:36:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:36:15,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:36:16,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:16,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:16,561 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 20:36:16,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:16,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:16,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-14 20:36:16,596 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 20:36:16,598 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 20:36:16,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:16,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:16,605 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 20:36:16,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-01-14 20:36:19,256 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 20:36:19,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:19,273 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 20:36:19,278 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 20:36:19,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:19,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:19,300 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 20:36:19,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:25 [2019-01-14 20:36:19,333 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 20:36:19,340 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 20:36:19,341 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 20:36:19,346 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 20:36:19,351 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 20:36:19,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2019-01-14 20:36:19,494 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 20:36:19,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:19,498 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 20:36:19,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:19,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:19,511 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 20:36:19,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:27 [2019-01-14 20:36:19,936 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 20:36:19,944 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 20:36:19,946 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 20:36:19,957 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 20:36:19,969 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 20:36:19,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:29 [2019-01-14 20:36:20,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:20,124 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 20:36:20,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:20,130 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 20:36:20,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-01-14 20:36:20,198 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 20:36:20,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:36:20,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 47 [2019-01-14 20:36:20,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-14 20:36:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-14 20:36:20,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2120, Unknown=0, NotChecked=0, Total=2256 [2019-01-14 20:36:20,218 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 48 states. [2019-01-14 20:36:21,663 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 20:36:24,405 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 20:36:28,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:36:28,103 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-01-14 20:36:28,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 20:36:28,105 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2019-01-14 20:36:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:36:28,107 INFO L225 Difference]: With dead ends: 121 [2019-01-14 20:36:28,107 INFO L226 Difference]: Without dead ends: 121 [2019-01-14 20:36:28,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 70 SyntacticMatches, 17 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=406, Invalid=4996, Unknown=0, NotChecked=0, Total=5402 [2019-01-14 20:36:28,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-14 20:36:28,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2019-01-14 20:36:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 20:36:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-01-14 20:36:28,115 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 96 [2019-01-14 20:36:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:36:28,115 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-01-14 20:36:28,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-14 20:36:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-01-14 20:36:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-14 20:36:28,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:36:28,121 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 20:36:28,122 INFO L423 AbstractCegarLoop]: === Iteration 26 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:36:28,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:36:28,122 INFO L82 PathProgramCache]: Analyzing trace with hash -154974851, now seen corresponding path program 1 times [2019-01-14 20:36:28,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:36:28,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:36:28,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:28,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:36:28,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:36:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:36:28,353 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 3 [2019-01-14 20:36:29,000 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-01-14 20:36:29,658 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 20:36:29,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:36:29,658 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:36:29,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:36:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:36:29,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:36:29,923 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 20:36:29,928 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 20:36:29,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:29,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:29,950 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 20:36:29,954 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 20:36:29,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:29,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:29,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:29,968 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2019-01-14 20:36:30,053 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 20:36:30,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:30,060 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 20:36:30,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:30,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:30,087 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 20:36:30,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:30,094 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 20:36:30,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:30,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:30,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:30,116 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:36 [2019-01-14 20:36:30,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:30,242 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 20:36:30,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:30,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:30,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:36:30,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 20:36:30,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:30,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:30,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2019-01-14 20:36:30,420 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:36:30,421 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 20:36:30,426 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 20:36:30,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:30,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:30,451 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 20:36:30,456 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 20:36:30,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:30,459 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:30,474 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 20:36:30,474 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:42 [2019-01-14 20:36:30,840 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 20:36:30,842 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 20:36:30,843 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 20:36:30,852 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 20:36:30,878 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 20:36:30,883 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 20:36:30,883 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:36:30,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:36:30,911 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 20:36:30,911 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:21 [2019-01-14 20:37:04,143 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 20:37:04,196 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 20:37:04,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-14 20:37:04,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,240 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 20:37:04,243 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 20:37:04,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,247 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,265 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 20:37:04,266 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:122, output treesize:56 [2019-01-14 20:37:04,331 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 20:37:04,333 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 20:37:04,333 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 20:37:04,338 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 20:37:04,362 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 20:37:04,384 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 20:37:04,384 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,400 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 20:37:04,400 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:21 [2019-01-14 20:37:04,559 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 20:37:04,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:04,566 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 20:37:04,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,603 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 20:37:04,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:04,621 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 20:37:04,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:04,646 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 20:37:04,647 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:86, output treesize:56 [2019-01-14 20:37:05,303 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 20:37:05,312 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 20:37:05,313 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 20:37:05,329 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 20:37:05,357 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 20:37:05,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 20:37:05,367 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 20:37:05,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:37:05,402 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 20:37:05,402 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:94 [2019-01-14 20:37:06,128 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 20:37:06,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:37:06,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 35] total 59 [2019-01-14 20:37:06,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-14 20:37:06,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-14 20:37:06,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=3332, Unknown=15, NotChecked=0, Total=3540 [2019-01-14 20:37:06,149 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 60 states. [2019-01-14 20:37:07,909 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-01-14 20:37:11,045 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 43 [2019-01-14 20:37:12,301 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2019-01-14 20:37:13,752 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2019-01-14 20:37:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:37:13,817 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2019-01-14 20:37:13,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-14 20:37:13,819 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 96 [2019-01-14 20:37:13,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:37:13,821 INFO L225 Difference]: With dead ends: 118 [2019-01-14 20:37:13,821 INFO L226 Difference]: Without dead ends: 118 [2019-01-14 20:37:13,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 63 SyntacticMatches, 13 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1704 ImplicationChecksByTransitivity, 41.6s TimeCoverageRelationStatistics Valid=537, Invalid=6758, Unknown=15, NotChecked=0, Total=7310 [2019-01-14 20:37:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-14 20:37:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2019-01-14 20:37:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 20:37:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2019-01-14 20:37:13,830 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 96 [2019-01-14 20:37:13,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:37:13,830 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2019-01-14 20:37:13,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-14 20:37:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2019-01-14 20:37:13,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 20:37:13,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:37:13,831 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 20:37:13,832 INFO L423 AbstractCegarLoop]: === Iteration 27 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:37:13,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:37:13,832 INFO L82 PathProgramCache]: Analyzing trace with hash 232708870, now seen corresponding path program 1 times [2019-01-14 20:37:13,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:37:13,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:37:13,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:37:13,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:37:13,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:37:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:37:15,279 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 20:37:15,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:37:15,279 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 20:37:15,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:37:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:37:15,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:37:15,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:15,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:15,942 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 20:37:15,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:15,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:15,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-01-14 20:37:15,968 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 20:37:15,973 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 20:37:15,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:15,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:15,985 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 20:37:15,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2019-01-14 20:37:18,019 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 20:37:18,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:18,041 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 20:37:18,044 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 20:37:18,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:18,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:18,056 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 20:37:18,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:24 [2019-01-14 20:37:18,139 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 20:37:18,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:18,158 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 20:37:18,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:18,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:18,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:18,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-01-14 20:37:19,352 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 20:37:19,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:37:19,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35] total 51 [2019-01-14 20:37:19,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-14 20:37:19,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-14 20:37:19,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2290, Unknown=1, NotChecked=96, Total=2550 [2019-01-14 20:37:19,375 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 51 states. [2019-01-14 20:37:30,684 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 20:37:31,003 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-01-14 20:37:31,830 WARN L181 SmtUtils]: Spent 555.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-14 20:37:32,134 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 20:37:39,892 WARN L181 SmtUtils]: Spent 3.65 s on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2019-01-14 20:37:48,582 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-14 20:37:48,952 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-01-14 20:37:49,390 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2019-01-14 20:37:49,903 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 20:37:50,270 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 20:37:50,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:37:50,424 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2019-01-14 20:37:50,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 20:37:50,430 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-01-14 20:37:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:37:50,431 INFO L225 Difference]: With dead ends: 118 [2019-01-14 20:37:50,432 INFO L226 Difference]: Without dead ends: 116 [2019-01-14 20:37:50,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 71 SyntacticMatches, 17 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=458, Invalid=5093, Unknown=3, NotChecked=146, Total=5700 [2019-01-14 20:37:50,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-14 20:37:50,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-01-14 20:37:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 20:37:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2019-01-14 20:37:50,442 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 99 [2019-01-14 20:37:50,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:37:50,442 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2019-01-14 20:37:50,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-14 20:37:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2019-01-14 20:37:50,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 20:37:50,443 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:37:50,443 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 20:37:50,444 INFO L423 AbstractCegarLoop]: === Iteration 28 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:37:50,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:37:50,444 INFO L82 PathProgramCache]: Analyzing trace with hash 234036269, now seen corresponding path program 1 times [2019-01-14 20:37:50,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:37:50,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:37:50,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:37:50,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:37:50,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:37:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:37:50,775 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-14 20:37:50,930 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 20:37:52,036 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 20:37:52,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:37:52,036 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 20:37:52,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:37:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:37:52,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:37:52,231 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 20:37:52,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:52,236 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 20:37:52,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-14 20:37:52,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:52,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:52,297 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 20:37:52,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:52,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:52,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-01-14 20:37:52,320 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 20:37:52,322 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 20:37:52,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:52,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:52,331 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 20:37:52,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2019-01-14 20:37:52,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-14 20:37:52,409 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 20:37:52,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:52,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:52,413 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 20:37:52,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:3 [2019-01-14 20:37:53,979 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 20:37:53,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37:53,989 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 20:37:53,994 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 20:37:53,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:53,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:54,006 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 20:37:54,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:25 [2019-01-14 20:37:54,030 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 20:37:54,032 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 20:37:54,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:54,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:54,038 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 20:37:54,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:3 [2019-01-14 20:37:54,080 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 20:37:54,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:37: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, 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 20:37:54,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:37:54,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:54,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:37:54,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 [2019-01-14 20:37:54,473 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 20:37:54,508 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 20:37:54,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-01-14 20:37:54,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 20:37:54,536 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 20:37:54,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:14 [2019-01-14 20:37:54,638 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 20:37:54,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:37:54,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 47 [2019-01-14 20:37:54,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-14 20:37:54,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-14 20:37:54,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2021, Unknown=1, NotChecked=90, Total=2256 [2019-01-14 20:37:54,659 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 48 states. [2019-01-14 20:38:01,697 WARN L181 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2019-01-14 20:38:03,729 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 20:38:03,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:38:03,789 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2019-01-14 20:38:03,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-14 20:38:03,791 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 99 [2019-01-14 20:38:03,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:38:03,792 INFO L225 Difference]: With dead ends: 118 [2019-01-14 20:38:03,792 INFO L226 Difference]: Without dead ends: 118 [2019-01-14 20:38:03,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 75 SyntacticMatches, 15 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=480, Invalid=5073, Unknown=1, NotChecked=146, Total=5700 [2019-01-14 20:38:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-14 20:38:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2019-01-14 20:38:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-14 20:38:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2019-01-14 20:38:03,798 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 99 [2019-01-14 20:38:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:38:03,798 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2019-01-14 20:38:03,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-14 20:38:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2019-01-14 20:38:03,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-14 20:38:03,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:38:03,799 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 20:38:03,800 INFO L423 AbstractCegarLoop]: === Iteration 29 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:38:03,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:38:03,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1442642529, now seen corresponding path program 2 times [2019-01-14 20:38:03,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:38:03,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:38:03,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:38:03,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:38:03,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:38:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:38:04,455 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-14 20:38:04,825 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 20:38:05,259 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2019-01-14 20:38:07,174 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 20:38:07,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:38:07,175 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 20:38:07,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:38:07,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 20:38:07,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:38:07,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:38:07,453 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 20:38:07,456 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 20:38:07,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:07,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:07,475 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 20:38:07,478 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 20:38:07,478 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:07,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:07,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:07,492 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-01-14 20:38:07,562 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 20:38:07,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:07,569 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 20:38:07,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:07,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:07,643 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 20:38:07,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:07,650 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 20:38:07,650 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:07,655 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:07,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:07,667 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:30 [2019-01-14 20:38:07,960 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:38:07,961 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 20:38:07,964 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 20:38:07,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:07,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:07,985 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:38:07,987 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 20:38:07,990 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 20:38:07,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:07,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:08,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:08,005 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:30 [2019-01-14 20:38:09,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:09,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:09,158 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 20:38:09,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:09,194 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 20:38:09,198 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 20:38:09,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:09,272 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 20:38:09,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:09,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:09,290 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:09,315 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 20:38:09,318 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 20:38:09,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:09,325 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 20:38:09,325 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:09,332 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:09,340 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:09,360 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 20:38:09,360 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:78, output treesize:50 [2019-01-14 20:38:09,540 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 20:38:09,545 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 20:38:09,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:09,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:09,579 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:38:09,581 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 20:38:09,585 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 20:38:09,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:09,594 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:09,612 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 20:38:09,612 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:56 [2019-01-14 20:38:10,277 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 20:38:10,289 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 20:38:10,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:10,490 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 20:38:10,490 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:10,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:10,667 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 20:38:10,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2019-01-14 20:38:11,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 20:38:11,098 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-14 20:38:11,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 20:38:11,288 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 20:38:11,292 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:38:11,294 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 20:38:11,295 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:11,361 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:11,374 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 20:38:11,380 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 20:38:11,380 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:38:11,397 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:38:11,448 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 20:38:11,491 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 20:38:11,494 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 20:38:11,734 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 20:38:11,735 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2019-01-14 20:38:11,884 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 20:38:11,885 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:12,056 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 20:38:12,353 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 20:38:12,366 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 20:38:12,372 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 20:38:12,373 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:12,385 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:12,494 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 20:38:12,495 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:135, output treesize:291 [2019-01-14 20:38:12,774 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-01-14 20:38:13,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 64 [2019-01-14 20:38:13,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:13,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:13,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:13,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:13,325 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 20:38:13,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:13,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:13,507 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 20:38:13,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:13,521 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 20:38:13,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:13,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:13,639 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 20:38:13,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:13,645 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 20:38:13,645 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:13,658 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:13,742 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 20:38:13,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:13,751 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 20:38:13,752 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:13,773 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:13,839 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 20:38:13,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:13,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:13,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:13,849 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 20:38:13,849 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:13,867 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:13,932 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 20:38:13,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:13,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 26 treesize of output 39 [2019-01-14 20:38:13,938 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:13,956 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:13,998 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 20:38:13,998 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:231, output treesize:141 [2019-01-14 20:38:15,958 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 20:38:15,961 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 20:38:15,961 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 20:38:15,981 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 20:38:15,981 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 20:38:15,993 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 20:38:16,022 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 20:38:16,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:16,027 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 20:38:16,027 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:16,030 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:16,033 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 20:38:16,042 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 20:38:16,042 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-14 20:38:16,051 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:38:16,072 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 20:38:16,072 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:68, output treesize:28 [2019-01-14 20:38:16,294 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 20:38:16,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:38:16,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 68 [2019-01-14 20:38:16,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-14 20:38:16,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-14 20:38:16,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=4295, Unknown=24, NotChecked=0, Total=4556 [2019-01-14 20:38:16,314 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand 68 states. [2019-01-14 20:38:17,431 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-01-14 20:38:21,209 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 48 [2019-01-14 20:38:21,600 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 68 [2019-01-14 20:38:21,941 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 68 [2019-01-14 20:38:22,500 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2019-01-14 20:38:22,842 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 55 [2019-01-14 20:38:24,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:38:24,763 INFO L93 Difference]: Finished difference Result 190 states and 202 transitions. [2019-01-14 20:38:24,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 20:38:24,766 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 102 [2019-01-14 20:38:24,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:38:24,769 INFO L225 Difference]: With dead ends: 190 [2019-01-14 20:38:24,769 INFO L226 Difference]: Without dead ends: 190 [2019-01-14 20:38:24,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 66 SyntacticMatches, 15 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2359 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=572, Invalid=8524, Unknown=24, NotChecked=0, Total=9120 [2019-01-14 20:38:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-14 20:38:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 174. [2019-01-14 20:38:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-01-14 20:38:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 186 transitions. [2019-01-14 20:38:24,778 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 186 transitions. Word has length 102 [2019-01-14 20:38:24,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:38:24,781 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 186 transitions. [2019-01-14 20:38:24,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-14 20:38:24,781 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 186 transitions. [2019-01-14 20:38:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-14 20:38:24,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:38:24,783 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 20:38:24,783 INFO L423 AbstractCegarLoop]: === Iteration 30 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:38:24,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:38:24,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1975468031, now seen corresponding path program 2 times [2019-01-14 20:38:24,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:38:24,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:38:24,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:38:24,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:38:24,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:38:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:38:25,142 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-01-14 20:38:26,440 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 20:38:26,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:38:26,441 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 20:38:26,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:38:26,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 20:38:26,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:38:26,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:38:26,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:26,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:26,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2019-01-14 20:38:27,028 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 20:38:27,030 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 20:38:27,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:27,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:27,045 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 20:38:27,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:51 [2019-01-14 20:38:27,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:27,393 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 20:38:27,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:27,398 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 20:38:27,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:27,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:27,412 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 20:38:27,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-01-14 20:38:27,415 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 20:38:27,420 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 20:38:27,427 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 20:38:27,428 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:18 [2019-01-14 20:38:43,929 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 20:38:43,971 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 20:38:43,975 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 20:38:43,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:44,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:44,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:44,053 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 20:38:44,056 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 20:38:44,111 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 20:38:44,158 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 20:38:44,159 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:92, output treesize:122 [2019-01-14 20:38:44,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:44,410 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 20:38:44,413 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 20:38:44,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:44,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:44,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:44,463 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 20:38:44,466 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 20:38:44,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:44,472 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:44,501 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 20:38:44,503 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 20:38:44,504 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 20:38:44,510 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 20:38:44,556 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 20:38:44,559 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 20:38:44,560 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:44,571 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:44,595 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 20:38:44,595 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:95, output treesize:37 [2019-01-14 20:38:55,292 WARN L181 SmtUtils]: Spent 871.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 20:38:55,340 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 20:38:55,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:55,404 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 20:38:55,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:55,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:55,736 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 20:38:55,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:55,742 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 20:38:55,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:55,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:55,833 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 20:38:55,833 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:156, output treesize:120 [2019-01-14 20:38:55,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:55,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2019-01-14 20:38:56,000 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 20:38:56,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:56,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:56,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:56,042 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 20:38:56,045 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 20:38:56,046 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:56,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:56,073 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 20:38:56,073 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:89, output treesize:55 [2019-01-14 20:38:56,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:56,450 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 20:38:56,452 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 20:38:56,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:56,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:56,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:38:56,501 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 20:38:56,505 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 20:38:56,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:56,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:38:56,537 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 20:38:56,537 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:89, output treesize:55 [2019-01-14 20:38:56,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:56,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:56,886 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 20:38:56,886 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:56,913 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 20:38:56,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:38:56,933 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 20:38:56,933 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:95, output treesize:33 [2019-01-14 20:39:07,862 WARN L181 SmtUtils]: Spent 8.86 s on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 20:39:20,346 WARN L181 SmtUtils]: Spent 12.41 s on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 20:39:34,009 WARN L181 SmtUtils]: Spent 13.58 s on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 20:39:48,557 WARN L181 SmtUtils]: Spent 14.47 s on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 20:40:02,246 WARN L181 SmtUtils]: Spent 13.61 s on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 20:40:26,390 WARN L181 SmtUtils]: Spent 24.05 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 20:40:46,582 WARN L181 SmtUtils]: Spent 20.04 s on a formula simplification that was a NOOP. DAG size: 34 [2019-01-14 20:40:46,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:40:46,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:40:46,880 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 20:40:46,882 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 20:40:46,883 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:40:46,923 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:40:46,925 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 20:40:46,926 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 20:40:46,977 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:40:46,977 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 20:40:46,978 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 20:40:47,014 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 20:40:47,180 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 20:40:47,184 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:40:47,185 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 20:40:47,186 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 20:40:47,235 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 20:40:47,236 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 20:40:47,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:40:47,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:40:47,281 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:40:47,283 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 20:40:47,284 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 20:40:47,327 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 20:40:47,418 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 20:40:47,418 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 24 variables, input treesize:303, output treesize:105 [2019-01-14 20:41:18,183 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 20:41:18,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:41:18,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 58 [2019-01-14 20:41:18,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-14 20:41:18,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-14 20:41:18,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3187, Unknown=33, NotChecked=0, Total=3422 [2019-01-14 20:41:18,204 INFO L87 Difference]: Start difference. First operand 174 states and 186 transitions. Second operand 59 states. [2019-01-14 20:41:42,460 WARN L181 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2019-01-14 20:41:45,932 WARN L181 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-01-14 20:41:46,956 WARN L181 SmtUtils]: Spent 910.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2019-01-14 20:41:47,771 WARN L181 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-01-14 20:41:53,915 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 20:42:02,542 WARN L181 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 20:42:06,651 WARN L181 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-01-14 20:42:11,153 WARN L181 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2019-01-14 20:42:13,817 WARN L181 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-01-14 20:42:16,096 WARN L181 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-01-14 20:42:21,974 WARN L181 SmtUtils]: Spent 5.77 s on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2019-01-14 20:42:46,149 WARN L181 SmtUtils]: Spent 24.05 s on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 20:43:06,494 WARN L181 SmtUtils]: Spent 20.04 s on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 20:44:21,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:44:21,457 INFO L93 Difference]: Finished difference Result 214 states and 225 transitions. [2019-01-14 20:44:21,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-14 20:44:21,459 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 105 [2019-01-14 20:44:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:44:21,461 INFO L225 Difference]: With dead ends: 214 [2019-01-14 20:44:21,461 INFO L226 Difference]: Without dead ends: 137 [2019-01-14 20:44:21,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 79 SyntacticMatches, 15 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 262.0s TimeCoverageRelationStatistics Valid=615, Invalid=8082, Unknown=45, NotChecked=0, Total=8742 [2019-01-14 20:44:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-14 20:44:21,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 116. [2019-01-14 20:44:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-14 20:44:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2019-01-14 20:44:21,469 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 105 [2019-01-14 20:44:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:44:21,469 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2019-01-14 20:44:21,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-14 20:44:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2019-01-14 20:44:21,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-14 20:44:21,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:44:21,470 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 20:44:21,471 INFO L423 AbstractCegarLoop]: === Iteration 31 === [sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 20:44:21,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:44:21,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2007564225, now seen corresponding path program 3 times [2019-01-14 20:44:21,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:44:21,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:44:21,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:44:21,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:44:21,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:44:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:44:21,686 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 20:44:21,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:44:21,686 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 20:44:21,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 20:44:21,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 20:44:21,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:44:21,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:44:21,906 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 20:44:21,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:44:21,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 20:44:21,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:44:21,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:44:21,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:44:21,932 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 7 states. [2019-01-14 20:44:21,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:44:21,987 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-01-14 20:44:21,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:44:21,989 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-01-14 20:44:21,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:44:21,990 INFO L225 Difference]: With dead ends: 37 [2019-01-14 20:44:21,990 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 20:44:21,990 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 20:44:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 20:44:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 20:44:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 20:44:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 20:44:21,991 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2019-01-14 20:44:21,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:44:21,991 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 20:44:21,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:44:21,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 20:44:21,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 20:44:22,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 08:44:22 BoogieIcfgContainer [2019-01-14 20:44:22,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 20:44:22,003 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 20:44:22,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 20:44:22,003 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 20:44:22,004 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:34:45" (3/4) ... [2019-01-14 20:44:22,012 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 20:44:22,020 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 20:44:22,020 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-14 20:44:22,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2019-01-14 20:44:22,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_update_at [2019-01-14 20:44:22,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 20:44:22,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 20:44:22,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2019-01-14 20:44:22,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_get_data_at [2019-01-14 20:44:22,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 20:44:22,022 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-01-14 20:44:22,029 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-01-14 20:44:22,030 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-01-14 20:44:22,030 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 20:44:22,078 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 20:44:22,078 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 20:44:22,080 INFO L168 Benchmark]: Toolchain (without parser) took 578518.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 947.3 MB in the beginning and 825.2 MB in the end (delta: 122.1 MB). Peak memory consumption was 333.4 MB. Max. memory is 11.5 GB. [2019-01-14 20:44:22,081 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 20:44:22,081 INFO L168 Benchmark]: CACSL2BoogieTranslator took 624.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-01-14 20:44:22,082 INFO L168 Benchmark]: Boogie Preprocessor took 78.28 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 20:44:22,082 INFO L168 Benchmark]: RCFGBuilder took 912.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. [2019-01-14 20:44:22,082 INFO L168 Benchmark]: TraceAbstraction took 576822.87 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 825.2 MB in the end (delta: 243.2 MB). Peak memory consumption was 302.9 MB. Max. memory is 11.5 GB. [2019-01-14 20:44:22,082 INFO L168 Benchmark]: Witness Printer took 75.07 ms. Allocated memory is still 1.2 GB. Free memory is still 825.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 20:44:22,084 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 624.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.28 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 912.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 576822.87 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 825.2 MB in the end (delta: 243.2 MB). Peak memory consumption was 302.9 MB. Max. memory is 11.5 GB. * Witness Printer took 75.07 ms. Allocated memory is still 1.2 GB. Free memory is still 825.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 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: 568]: 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: 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 - 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, 576.7s OverallTime, 31 OverallIterations, 3 TraceHistogramMax, 301.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1942 SDtfs, 3063 SDslu, 14028 SDs, 0 SdLazy, 26358 SolverSat, 823 SolverUnsat, 80 SolverUnknown, 0 SolverNotchecked, 153.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2025 GetRequests, 949 SyntacticMatches, 131 SemanticMatches, 945 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 11862 ImplicationChecksByTransitivity, 404.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 256 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 272.3s 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...