./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-simple/dll2n_remove_all_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/dll2n_remove_all_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 d9cd680588366d8f4117005099c5fa975e5f03ed ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 00:04:00,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 00:04:00,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 00:04:00,829 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 00:04:00,830 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 00:04:00,831 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 00:04:00,832 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 00:04:00,834 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 00:04:00,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 00:04:00,841 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 00:04:00,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 00:04:00,843 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 00:04:00,844 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 00:04:00,847 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 00:04:00,850 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 00:04:00,851 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 00:04:00,852 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 00:04:00,857 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 00:04:00,862 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 00:04:00,865 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 00:04:00,867 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 00:04:00,873 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 00:04:00,878 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 00:04:00,878 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 00:04:00,878 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 00:04:00,879 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 00:04:00,881 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 00:04:00,883 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 00:04:00,884 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 00:04:00,885 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 00:04:00,885 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 00:04:00,888 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 00:04:00,889 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 00:04:00,889 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 00:04:00,890 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 00:04:00,892 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 00:04:00,894 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 00:04:00,916 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 00:04:00,916 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 00:04:00,917 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 00:04:00,917 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 00:04:00,919 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 00:04:00,919 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 00:04:00,920 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 00:04:00,920 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 00:04:00,920 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 00:04:00,920 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 00:04:00,921 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 00:04:00,921 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 00:04:00,921 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 00:04:00,921 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 00:04:00,921 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 00:04:00,922 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 00:04:00,922 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 00:04:00,922 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 00:04:00,922 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 00:04:00,922 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 00:04:00,922 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 00:04:00,923 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:04:00,923 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 00:04:00,923 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 00:04:00,923 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 00:04:00,923 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 00:04:00,923 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 -> d9cd680588366d8f4117005099c5fa975e5f03ed [2019-01-14 00:04:00,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 00:04:00,994 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 00:04:01,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 00:04:01,002 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 00:04:01,005 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 00:04:01,006 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2019-01-14 00:04:01,063 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a24bb92a8/b812a52cb4e24af5b1b09e98a9ab71a3/FLAGddb7da648 [2019-01-14 00:04:01,617 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 00:04:01,618 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2019-01-14 00:04:01,631 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a24bb92a8/b812a52cb4e24af5b1b09e98a9ab71a3/FLAGddb7da648 [2019-01-14 00:04:01,885 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a24bb92a8/b812a52cb4e24af5b1b09e98a9ab71a3 [2019-01-14 00:04:01,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 00:04:01,890 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 00:04:01,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 00:04:01,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 00:04:01,895 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 00:04:01,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:04:01" (1/1) ... [2019-01-14 00:04:01,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd00d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:04:01, skipping insertion in model container [2019-01-14 00:04:01,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:04:01" (1/1) ... [2019-01-14 00:04:01,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 00:04:01,960 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 00:04:02,394 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:04:02,406 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 00:04:02,520 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:04:02,581 INFO L195 MainTranslator]: Completed translation [2019-01-14 00:04:02,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:04:02 WrapperNode [2019-01-14 00:04:02,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 00:04:02,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 00:04:02,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 00:04:02,583 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 00:04:02,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:04:02" (1/1) ... [2019-01-14 00:04:02,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:04:02" (1/1) ... [2019-01-14 00:04:02,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:04:02" (1/1) ... [2019-01-14 00:04:02,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:04:02" (1/1) ... [2019-01-14 00:04:02,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:04:02" (1/1) ... [2019-01-14 00:04:02,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:04:02" (1/1) ... [2019-01-14 00:04:02,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:04:02" (1/1) ... [2019-01-14 00:04:02,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 00:04:02,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 00:04:02,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 00:04:02,656 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 00:04:02,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:04:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:04:02,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 00:04:02,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 00:04:02,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 00:04:02,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 00:04:02,728 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-14 00:04:02,728 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-01-14 00:04:02,728 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-01-14 00:04:02,728 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_first [2019-01-14 00:04:02,728 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 00:04:02,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 00:04:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 00:04:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 00:04:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 00:04:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 00:04:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 00:04:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 00:04:02,732 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 00:04:02,732 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 00:04:02,732 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 00:04:02,732 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 00:04:02,732 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 00:04:02,732 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 00:04:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 00:04:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 00:04:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 00:04:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 00:04:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 00:04:02,734 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 00:04:02,735 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 00:04:02,735 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 00:04:02,736 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 00:04:02,736 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 00:04:02,736 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 00:04:02,737 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 00:04:02,737 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 00:04:02,737 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 00:04:02,737 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 00:04:02,737 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 00:04:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 00:04:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 00:04:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 00:04:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 00:04:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 00:04:02,739 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 00:04:02,740 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 00:04:02,740 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 00:04:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 00:04:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 00:04:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 00:04:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 00:04:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 00:04:02,742 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 00:04:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 00:04:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 00:04:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 00:04:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 00:04:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 00:04:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 00:04:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 00:04:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 00:04:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 00:04:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 00:04:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 00:04:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 00:04:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 00:04:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 00:04:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 00:04:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 00:04:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 00:04:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 00:04:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-14 00:04:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 00:04:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 00:04:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-14 00:04:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 00:04:02,748 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 00:04:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-14 00:04:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 00:04:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 00:04:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 00:04:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 00:04:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 00:04:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 00:04:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 00:04:02,751 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 00:04:02,751 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 00:04:02,751 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 00:04:02,751 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 00:04:02,752 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 00:04:02,752 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 00:04:02,752 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 00:04:02,752 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 00:04:02,752 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 00:04:02,752 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 00:04:02,752 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 00:04:02,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 00:04:02,753 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 00:04:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 00:04:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 00:04:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 00:04:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 00:04:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 00:04:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 00:04:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 00:04:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 00:04:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 00:04:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 00:04:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 00:04:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 00:04:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 00:04:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 00:04:02,756 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 00:04:02,757 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 00:04:02,757 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 00:04:02,757 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 00:04:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-14 00:04:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-01-14 00:04:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 00:04:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 00:04:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 00:04:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-01-14 00:04:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_first [2019-01-14 00:04:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 00:04:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 00:04:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 00:04:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 00:04:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 00:04:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 00:04:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 00:04:02,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 00:04:03,107 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-14 00:04:03,733 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 00:04:03,735 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 00:04:03,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:04:03 BoogieIcfgContainer [2019-01-14 00:04:03,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 00:04:03,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 00:04:03,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 00:04:03,741 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 00:04:03,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 12:04:01" (1/3) ... [2019-01-14 00:04:03,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdfaa52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:04:03, skipping insertion in model container [2019-01-14 00:04:03,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:04:02" (2/3) ... [2019-01-14 00:04:03,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdfaa52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:04:03, skipping insertion in model container [2019-01-14 00:04:03,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:04:03" (3/3) ... [2019-01-14 00:04:03,747 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2019-01-14 00:04:03,758 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 00:04:03,765 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2019-01-14 00:04:03,779 INFO L257 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2019-01-14 00:04:03,804 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 00:04:03,805 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 00:04:03,805 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 00:04:03,805 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 00:04:03,806 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 00:04:03,806 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 00:04:03,806 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 00:04:03,806 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 00:04:03,806 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 00:04:03,825 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-01-14 00:04:03,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 00:04:03,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:03,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:04:03,840 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:03,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:03,846 INFO L82 PathProgramCache]: Analyzing trace with hash -514962171, now seen corresponding path program 1 times [2019-01-14 00:04:03,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:03,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:03,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:03,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:03,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:04,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:04:04,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:04:04,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:04:04,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:04:04,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:04:04,068 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2019-01-14 00:04:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:04,340 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2019-01-14 00:04:04,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:04:04,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-14 00:04:04,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:04,354 INFO L225 Difference]: With dead ends: 71 [2019-01-14 00:04:04,354 INFO L226 Difference]: Without dead ends: 64 [2019-01-14 00:04:04,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:04:04,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-14 00:04:04,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2019-01-14 00:04:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-14 00:04:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-01-14 00:04:04,396 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 11 [2019-01-14 00:04:04,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:04,396 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-01-14 00:04:04,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:04:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-01-14 00:04:04,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 00:04:04,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:04,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:04:04,398 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:04,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:04,399 INFO L82 PathProgramCache]: Analyzing trace with hash -514962170, now seen corresponding path program 1 times [2019-01-14 00:04:04,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:04,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:04,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:04,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:04,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:04,708 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-14 00:04:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:04,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:04:04,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:04:04,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:04:04,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:04:04,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:04:04,749 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 3 states. [2019-01-14 00:04:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:04,871 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-01-14 00:04:04,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:04:04,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-14 00:04:04,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:04,874 INFO L225 Difference]: With dead ends: 61 [2019-01-14 00:04:04,875 INFO L226 Difference]: Without dead ends: 61 [2019-01-14 00:04:04,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:04:04,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-14 00:04:04,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2019-01-14 00:04:04,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 00:04:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-01-14 00:04:04,884 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 11 [2019-01-14 00:04:04,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:04,884 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-01-14 00:04:04,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:04:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-01-14 00:04:04,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 00:04:04,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:04,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:04:04,886 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:04,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:04,887 INFO L82 PathProgramCache]: Analyzing trace with hash -943001015, now seen corresponding path program 1 times [2019-01-14 00:04:04,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:04,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:04,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:04,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:04,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:04:04,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 00:04:04,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:04:04,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:04:04,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:04:04,970 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 3 states. [2019-01-14 00:04:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:05,019 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-01-14 00:04:05,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:04:05,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 00:04:05,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:05,023 INFO L225 Difference]: With dead ends: 67 [2019-01-14 00:04:05,023 INFO L226 Difference]: Without dead ends: 67 [2019-01-14 00:04:05,024 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 00:04:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-14 00:04:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-01-14 00:04:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 00:04:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-01-14 00:04:05,035 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 15 [2019-01-14 00:04:05,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:05,035 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-01-14 00:04:05,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:04:05,035 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-01-14 00:04:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 00:04:05,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:05,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:04:05,038 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:05,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:05,039 INFO L82 PathProgramCache]: Analyzing trace with hash -2008914016, now seen corresponding path program 1 times [2019-01-14 00:04:05,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:05,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:05,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:05,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:05,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:05,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:04:05,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 00:04:05,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 00:04:05,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 00:04:05,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:04:05,113 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-01-14 00:04:05,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:05,190 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2019-01-14 00:04:05,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:04:05,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-14 00:04:05,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:05,195 INFO L225 Difference]: With dead ends: 66 [2019-01-14 00:04:05,195 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 00:04:05,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:04:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 00:04:05,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-01-14 00:04:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-14 00:04:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-01-14 00:04:05,207 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 15 [2019-01-14 00:04:05,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:05,207 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-01-14 00:04:05,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 00:04:05,208 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-01-14 00:04:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 00:04:05,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:05,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:04:05,209 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:05,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:05,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2125936004, now seen corresponding path program 1 times [2019-01-14 00:04:05,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:05,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:05,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:05,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:05,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:05,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:04:05,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:04:05,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:04:05,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:04:05,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:04:05,313 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2019-01-14 00:04:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:05,993 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2019-01-14 00:04:05,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:04:05,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-14 00:04:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:05,997 INFO L225 Difference]: With dead ends: 88 [2019-01-14 00:04:05,997 INFO L226 Difference]: Without dead ends: 88 [2019-01-14 00:04:05,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:04:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-14 00:04:06,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2019-01-14 00:04:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 00:04:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-01-14 00:04:06,006 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 17 [2019-01-14 00:04:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:06,008 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-01-14 00:04:06,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:04:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-01-14 00:04:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 00:04:06,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:06,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:04:06,010 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:06,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:06,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2125936003, now seen corresponding path program 1 times [2019-01-14 00:04:06,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:06,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:06,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:06,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:06,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:06,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:06,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:04:06,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:04:06,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:04:06,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:04:06,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:04:06,133 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 5 states. [2019-01-14 00:04:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:06,192 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-14 00:04:06,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:04:06,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-14 00:04:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:06,198 INFO L225 Difference]: With dead ends: 67 [2019-01-14 00:04:06,198 INFO L226 Difference]: Without dead ends: 64 [2019-01-14 00:04:06,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:04:06,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-14 00:04:06,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-01-14 00:04:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 00:04:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2019-01-14 00:04:06,205 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 17 [2019-01-14 00:04:06,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:06,206 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2019-01-14 00:04:06,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:04:06,206 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2019-01-14 00:04:06,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 00:04:06,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:06,207 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:04:06,207 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:06,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:06,208 INFO L82 PathProgramCache]: Analyzing trace with hash -364074049, now seen corresponding path program 1 times [2019-01-14 00:04:06,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:06,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:06,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:06,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:06,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:06,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:06,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:04:06,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:04:06,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:06,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:04:06,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 00:04:06,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:06,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:06,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-14 00:04:06,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:06,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:04:06,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-01-14 00:04:06,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:04:06,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:04:06,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:04:06,661 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 6 states. [2019-01-14 00:04:07,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:07,005 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2019-01-14 00:04:07,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:04:07,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-01-14 00:04:07,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:07,008 INFO L225 Difference]: With dead ends: 63 [2019-01-14 00:04:07,008 INFO L226 Difference]: Without dead ends: 63 [2019-01-14 00:04:07,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:04:07,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-14 00:04:07,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-01-14 00:04:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-14 00:04:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-01-14 00:04:07,025 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 22 [2019-01-14 00:04:07,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:07,025 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-01-14 00:04:07,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:04:07,026 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-01-14 00:04:07,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 00:04:07,027 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:07,032 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:04:07,032 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:07,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:07,033 INFO L82 PathProgramCache]: Analyzing trace with hash -364074048, now seen corresponding path program 1 times [2019-01-14 00:04:07,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:07,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:07,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:07,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:07,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:07,413 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-14 00:04:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:07,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:04:07,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:04:07,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:07,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:04:07,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 00:04:07,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:07,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:07,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 00:04:07,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 00:04:07,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:07,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:04:07,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-14 00:04:07,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:07,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:04:07,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-01-14 00:04:07,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:04:07,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:04:07,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:04:07,917 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 7 states. [2019-01-14 00:04:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:08,053 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-01-14 00:04:08,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:04:08,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-01-14 00:04:08,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:08,057 INFO L225 Difference]: With dead ends: 62 [2019-01-14 00:04:08,057 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 00:04:08,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:04:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 00:04:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-01-14 00:04:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-14 00:04:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-01-14 00:04:08,065 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 22 [2019-01-14 00:04:08,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:08,065 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-01-14 00:04:08,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:04:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-01-14 00:04:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 00:04:08,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:08,066 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] [2019-01-14 00:04:08,066 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:08,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:08,067 INFO L82 PathProgramCache]: Analyzing trace with hash 172097138, now seen corresponding path program 1 times [2019-01-14 00:04:08,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:08,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:08,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:08,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:08,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:08,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:08,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:04:08,292 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:04:08,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:08,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:04:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:08,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:04:08,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 00:04:08,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:04:08,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:04:08,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:04:08,392 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 6 states. [2019-01-14 00:04:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:08,686 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-01-14 00:04:08,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:04:08,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-01-14 00:04:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:08,688 INFO L225 Difference]: With dead ends: 73 [2019-01-14 00:04:08,693 INFO L226 Difference]: Without dead ends: 70 [2019-01-14 00:04:08,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 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 00:04:08,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-14 00:04:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2019-01-14 00:04:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 00:04:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2019-01-14 00:04:08,702 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 24 [2019-01-14 00:04:08,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:08,706 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2019-01-14 00:04:08,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:04:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2019-01-14 00:04:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 00:04:08,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:08,708 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:04:08,708 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:08,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:08,708 INFO L82 PathProgramCache]: Analyzing trace with hash -713389636, now seen corresponding path program 2 times [2019-01-14 00:04:08,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:08,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:08,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:08,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:08,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:08,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:04:08,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:04:08,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:04:08,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:04:08,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:04:08,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:04:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:08,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:04:08,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 00:04:08,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 00:04:08,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 00:04:08,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:04:08,909 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 4 states. [2019-01-14 00:04:09,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:09,060 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-01-14 00:04:09,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:04:09,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-01-14 00:04:09,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:09,063 INFO L225 Difference]: With dead ends: 63 [2019-01-14 00:04:09,063 INFO L226 Difference]: Without dead ends: 63 [2019-01-14 00:04:09,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:04:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-14 00:04:09,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-14 00:04:09,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 00:04:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-01-14 00:04:09,086 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 31 [2019-01-14 00:04:09,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:09,086 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-01-14 00:04:09,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 00:04:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-01-14 00:04:09,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 00:04:09,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:09,090 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 00:04:09,090 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:09,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:09,091 INFO L82 PathProgramCache]: Analyzing trace with hash 180202334, now seen corresponding path program 1 times [2019-01-14 00:04:09,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:09,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:09,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:09,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:04:09,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:09,531 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 00:04:09,889 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 00:04:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:09,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:04:09,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:04:10,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:10,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:04:10,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 00:04:10,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:10,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:10,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 00:04:10,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 00:04:10,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:10,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:10,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-14 00:04:10,435 WARN L860 $PredicateComparison]: unable to prove that (exists ((|dll_create_#t~malloc3.base| Int)) (and (< |c_#StackHeapBarrier| |dll_create_#t~malloc3.base|) (= |c_#valid| (store |c_old(#valid)| |dll_create_#t~malloc3.base| 1)))) is different from true [2019-01-14 00:04:10,906 WARN L860 $PredicateComparison]: unable to prove that (exists ((|dll_create_#t~malloc3.base| Int) (v_subst_1 Int)) (and (= |c_#valid| (store (store |c_old(#valid)| v_subst_1 1) |dll_create_#t~malloc3.base| 1)) (< |c_#StackHeapBarrier| v_subst_1) (< |c_#StackHeapBarrier| |dll_create_#t~malloc3.base|))) is different from true [2019-01-14 00:04:10,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:10,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-14 00:04:10,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:10,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-14 00:04:10,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:11,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:11,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:04:11,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:26 [2019-01-14 00:04:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2019-01-14 00:04:11,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:04:11,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2019-01-14 00:04:11,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 00:04:11,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 00:04:11,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=169, Unknown=2, NotChecked=54, Total=272 [2019-01-14 00:04:11,333 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 17 states. [2019-01-14 00:04:12,307 WARN L181 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 14 [2019-01-14 00:04:14,771 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 33 DAG size of output: 17 [2019-01-14 00:04:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:15,394 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2019-01-14 00:04:15,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:04:15,395 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-01-14 00:04:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:15,397 INFO L225 Difference]: With dead ends: 96 [2019-01-14 00:04:15,397 INFO L226 Difference]: Without dead ends: 96 [2019-01-14 00:04:15,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=100, Invalid=366, Unknown=4, NotChecked=82, Total=552 [2019-01-14 00:04:15,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-14 00:04:15,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 79. [2019-01-14 00:04:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 00:04:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-01-14 00:04:15,404 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 32 [2019-01-14 00:04:15,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:15,404 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-01-14 00:04:15,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 00:04:15,404 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-01-14 00:04:15,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 00:04:15,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:15,405 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 00:04:15,406 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:15,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:15,406 INFO L82 PathProgramCache]: Analyzing trace with hash 180202335, now seen corresponding path program 1 times [2019-01-14 00:04:15,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:15,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:15,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:15,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:15,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:15,865 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 00:04:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:16,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:04:16,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:04:16,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:16,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:04:16,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 00:04:16,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:16,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:16,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-14 00:04:16,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 00:04:16,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:16,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:16,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-14 00:04:16,501 WARN L860 $PredicateComparison]: unable to prove that (exists ((|dll_create_#t~malloc3.base| Int)) (and (= (store |c_old(#length)| |dll_create_#t~malloc3.base| 12) |c_#length|) (< |c_#StackHeapBarrier| |dll_create_#t~malloc3.base|))) is different from true [2019-01-14 00:04:16,963 WARN L860 $PredicateComparison]: unable to prove that (exists ((|dll_create_#t~malloc3.base| Int) (v_subst_2 Int)) (and (< |c_#StackHeapBarrier| |dll_create_#t~malloc3.base|) (= |c_#length| (store (store |c_old(#length)| v_subst_2 12) |dll_create_#t~malloc3.base| 12)) (< |c_#StackHeapBarrier| v_subst_2))) is different from true [2019-01-14 00:04:16,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:16,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:16,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-14 00:04:16,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:16,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2019-01-14 00:04:16,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:17,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:17,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:04:17,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2019-01-14 00:04:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2019-01-14 00:04:17,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:04:17,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-14 00:04:17,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 00:04:17,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 00:04:17,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=106, Unknown=2, NotChecked=42, Total=182 [2019-01-14 00:04:17,161 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 14 states. [2019-01-14 00:04:18,602 WARN L181 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 10 [2019-01-14 00:04:21,679 WARN L181 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2019-01-14 00:04:23,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:23,614 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2019-01-14 00:04:23,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 00:04:23,616 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-01-14 00:04:23,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:23,617 INFO L225 Difference]: With dead ends: 107 [2019-01-14 00:04:23,618 INFO L226 Difference]: Without dead ends: 107 [2019-01-14 00:04:23,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=61, Invalid=207, Unknown=12, NotChecked=62, Total=342 [2019-01-14 00:04:23,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-14 00:04:23,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2019-01-14 00:04:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-14 00:04:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2019-01-14 00:04:23,631 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 32 [2019-01-14 00:04:23,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:23,631 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2019-01-14 00:04:23,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 00:04:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2019-01-14 00:04:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 00:04:23,633 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:23,640 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:04:23,640 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:23,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:23,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1291305039, now seen corresponding path program 1 times [2019-01-14 00:04:23,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:23,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:23,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:23,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:23,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:04:23,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:04:23,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 00:04:23,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 00:04:23,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 00:04:23,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:04:23,823 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 10 states. [2019-01-14 00:04:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:24,191 INFO L93 Difference]: Finished difference Result 124 states and 149 transitions. [2019-01-14 00:04:24,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 00:04:24,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-01-14 00:04:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:24,194 INFO L225 Difference]: With dead ends: 124 [2019-01-14 00:04:24,194 INFO L226 Difference]: Without dead ends: 124 [2019-01-14 00:04:24,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-01-14 00:04:24,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-14 00:04:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 101. [2019-01-14 00:04:24,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 00:04:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2019-01-14 00:04:24,202 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 122 transitions. Word has length 33 [2019-01-14 00:04:24,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:24,202 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 122 transitions. [2019-01-14 00:04:24,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 00:04:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 122 transitions. [2019-01-14 00:04:24,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 00:04:24,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:24,204 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:04:24,204 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:24,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:24,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1291305040, now seen corresponding path program 1 times [2019-01-14 00:04:24,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:24,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:24,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:24,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:24,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:25,093 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:04:25,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:04:25,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 00:04:25,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 00:04:25,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 00:04:25,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:04:25,095 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. Second operand 10 states. [2019-01-14 00:04:25,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:25,995 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2019-01-14 00:04:25,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 00:04:25,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-01-14 00:04:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:25,998 INFO L225 Difference]: With dead ends: 127 [2019-01-14 00:04:25,998 INFO L226 Difference]: Without dead ends: 127 [2019-01-14 00:04:25,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-01-14 00:04:25,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-14 00:04:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 101. [2019-01-14 00:04:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 00:04:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2019-01-14 00:04:26,004 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 33 [2019-01-14 00:04:26,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:26,005 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2019-01-14 00:04:26,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 00:04:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2019-01-14 00:04:26,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 00:04:26,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:26,007 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:04:26,007 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:26,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:26,007 INFO L82 PathProgramCache]: Analyzing trace with hash -753669214, now seen corresponding path program 1 times [2019-01-14 00:04:26,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:26,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:26,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:26,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:26,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:26,745 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:26,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:04:26,745 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:04:26,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:26,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:04:26,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:26,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:26,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:04:26,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:26,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:26,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-01-14 00:04:26,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:04:26,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:04:26,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:26,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:26,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:26,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-01-14 00:04:26,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 00:04:26,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:26,924 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 27 [2019-01-14 00:04:26,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:26,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:26,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:26,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-01-14 00:04:27,005 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 56 treesize of output 50 [2019-01-14 00:04:27,008 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 16 treesize of output 15 [2019-01-14 00:04:27,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:27,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:27,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:04:27,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2019-01-14 00:04:27,477 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 93 treesize of output 83 [2019-01-14 00:04:27,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 70 [2019-01-14 00:04:27,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:27,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:27,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:04:27,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:77 [2019-01-14 00:04:27,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 64 [2019-01-14 00:04:27,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2019-01-14 00:04:27,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:27,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:27,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 57 [2019-01-14 00:04:27,770 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2019-01-14 00:04:27,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2019-01-14 00:04:27,857 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:27,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:27,930 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 24 treesize of output 14 [2019-01-14 00:04:27,931 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:27,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:27,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:27,994 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:83, output treesize:5 [2019-01-14 00:04:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:28,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:04:28,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 27 [2019-01-14 00:04:28,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 00:04:28,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 00:04:28,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2019-01-14 00:04:28,021 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand 28 states. [2019-01-14 00:04:29,102 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-01-14 00:04:29,762 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-01-14 00:04:30,133 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-01-14 00:04:30,322 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-01-14 00:04:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:31,463 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2019-01-14 00:04:31,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-14 00:04:31,465 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2019-01-14 00:04:31,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:31,466 INFO L225 Difference]: With dead ends: 134 [2019-01-14 00:04:31,467 INFO L226 Difference]: Without dead ends: 134 [2019-01-14 00:04:31,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=256, Invalid=1906, Unknown=0, NotChecked=0, Total=2162 [2019-01-14 00:04:31,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-14 00:04:31,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 107. [2019-01-14 00:04:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 00:04:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2019-01-14 00:04:31,474 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 36 [2019-01-14 00:04:31,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:31,474 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2019-01-14 00:04:31,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 00:04:31,474 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2019-01-14 00:04:31,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 00:04:31,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:31,475 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:04:31,476 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:31,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:31,476 INFO L82 PathProgramCache]: Analyzing trace with hash -753669213, now seen corresponding path program 1 times [2019-01-14 00:04:31,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:31,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:31,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:31,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:31,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:31,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:04:31,942 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:04:31,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:32,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:04:32,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:32,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:32,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:04:32,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:32,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:32,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-01-14 00:04:32,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:04:32,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:04:32,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:32,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:32,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:04:32,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:04:32,305 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:32,306 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:32,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:32,317 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2019-01-14 00:04:32,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 00:04:32,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:32,363 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 27 [2019-01-14 00:04:32,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:32,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:32,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 00:04:32,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:32,463 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:04:32,463 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 36 [2019-01-14 00:04:32,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:32,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:32,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:32,490 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2019-01-14 00:04:32,553 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 83 treesize of output 77 [2019-01-14 00:04:32,557 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 16 treesize of output 15 [2019-01-14 00:04:32,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:32,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:32,605 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 44 treesize of output 45 [2019-01-14 00:04:32,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2019-01-14 00:04:32,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:32,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:32,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:04:32,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:113, output treesize:93 [2019-01-14 00:04:33,447 INFO L303 Elim1Store]: Index analysis took 118 ms [2019-01-14 00:04:33,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 148 [2019-01-14 00:04:33,477 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 131 treesize of output 122 [2019-01-14 00:04:33,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:33,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:33,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 123 [2019-01-14 00:04:33,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:04:33,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:33,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:33,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 104 [2019-01-14 00:04:33,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 00:04:33,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:33,840 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:04:33,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:33,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 111 [2019-01-14 00:04:33,842 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:33,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 138 [2019-01-14 00:04:33,950 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:34,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 118 [2019-01-14 00:04:34,050 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:04:34,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:34,154 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 114 treesize of output 84 [2019-01-14 00:04:34,154 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:34,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:34,240 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 118 treesize of output 88 [2019-01-14 00:04:34,240 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:34,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-14 00:04:34,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 66 [2019-01-14 00:04:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2019-01-14 00:04:34,415 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:34,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:34,441 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 28 treesize of output 16 [2019-01-14 00:04:34,441 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:34,457 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 11 treesize of output 7 [2019-01-14 00:04:34,458 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:34,466 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:34,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 74 [2019-01-14 00:04:34,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:34,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2019-01-14 00:04:34,504 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:04:34,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:34,620 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 43 treesize of output 33 [2019-01-14 00:04:34,621 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:34,832 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 62 treesize of output 53 [2019-01-14 00:04:34,832 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:34,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 67 [2019-01-14 00:04:34,932 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:35,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:35,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:35,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:35,034 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:04:35,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 55 [2019-01-14 00:04:35,036 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:35,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:35,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:35,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:35,172 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:04:35,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2019-01-14 00:04:35,174 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:35,202 INFO L267 ElimStorePlain]: Start of recursive call 15: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:35,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 70 [2019-01-14 00:04:35,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:35,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:35,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:35,345 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:04:35,346 INFO L303 Elim1Store]: Index analysis took 128 ms [2019-01-14 00:04:35,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 98 [2019-01-14 00:04:35,348 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:35,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2019-01-14 00:04:35,489 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:35,527 INFO L267 ElimStorePlain]: Start of recursive call 22: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:35,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 70 [2019-01-14 00:04:35,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:35,545 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 62 treesize of output 50 [2019-01-14 00:04:35,546 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:35,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:35,597 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 66 treesize of output 54 [2019-01-14 00:04:35,598 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:35,638 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 42 treesize of output 33 [2019-01-14 00:04:35,638 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:35,675 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 33 treesize of output 29 [2019-01-14 00:04:35,677 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:35,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:35,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-01-14 00:04:35,712 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:35,729 INFO L267 ElimStorePlain]: Start of recursive call 25: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:35,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:04:35,772 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 4 variables, input treesize:203, output treesize:23 [2019-01-14 00:04:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:35,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:04:35,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2019-01-14 00:04:35,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-14 00:04:35,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-14 00:04:35,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1096, Unknown=0, NotChecked=0, Total=1190 [2019-01-14 00:04:35,892 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand 35 states. [2019-01-14 00:04:36,831 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-01-14 00:04:37,270 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 111 [2019-01-14 00:04:38,318 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-01-14 00:04:38,730 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 98 [2019-01-14 00:04:39,125 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2019-01-14 00:04:39,352 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-01-14 00:04:39,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:39,942 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2019-01-14 00:04:39,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-14 00:04:39,945 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 36 [2019-01-14 00:04:39,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:39,947 INFO L225 Difference]: With dead ends: 145 [2019-01-14 00:04:39,947 INFO L226 Difference]: Without dead ends: 145 [2019-01-14 00:04:39,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=336, Invalid=2526, Unknown=0, NotChecked=0, Total=2862 [2019-01-14 00:04:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-14 00:04:39,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 121. [2019-01-14 00:04:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-14 00:04:39,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 150 transitions. [2019-01-14 00:04:39,956 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 150 transitions. Word has length 36 [2019-01-14 00:04:39,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:39,956 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 150 transitions. [2019-01-14 00:04:39,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-14 00:04:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 150 transitions. [2019-01-14 00:04:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-14 00:04:39,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:39,959 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:04:39,959 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:39,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:39,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1888904167, now seen corresponding path program 1 times [2019-01-14 00:04:39,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:39,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:39,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:39,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:39,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:04:40,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:04:40,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 00:04:40,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 00:04:40,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 00:04:40,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:04:40,806 INFO L87 Difference]: Start difference. First operand 121 states and 150 transitions. Second operand 10 states. [2019-01-14 00:04:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:41,021 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2019-01-14 00:04:41,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 00:04:41,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-01-14 00:04:41,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:41,025 INFO L225 Difference]: With dead ends: 128 [2019-01-14 00:04:41,025 INFO L226 Difference]: Without dead ends: 128 [2019-01-14 00:04:41,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-01-14 00:04:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-01-14 00:04:41,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2019-01-14 00:04:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-14 00:04:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-01-14 00:04:41,032 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 37 [2019-01-14 00:04:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:41,032 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-01-14 00:04:41,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 00:04:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-01-14 00:04:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 00:04:41,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:41,033 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:04:41,033 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:41,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:41,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1573513027, now seen corresponding path program 1 times [2019-01-14 00:04:41,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:41,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:41,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:41,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:41,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:04:41,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:04:41,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 00:04:41,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 00:04:41,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 00:04:41,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:04:41,268 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 10 states. [2019-01-14 00:04:41,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:04:41,618 INFO L93 Difference]: Finished difference Result 137 states and 164 transitions. [2019-01-14 00:04:41,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 00:04:41,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-01-14 00:04:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:04:41,624 INFO L225 Difference]: With dead ends: 137 [2019-01-14 00:04:41,624 INFO L226 Difference]: Without dead ends: 137 [2019-01-14 00:04:41,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-01-14 00:04:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-14 00:04:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2019-01-14 00:04:41,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-14 00:04:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 155 transitions. [2019-01-14 00:04:41,632 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 155 transitions. Word has length 38 [2019-01-14 00:04:41,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:04:41,633 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 155 transitions. [2019-01-14 00:04:41,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 00:04:41,633 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 155 transitions. [2019-01-14 00:04:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 00:04:41,633 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:04:41,637 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:04:41,637 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:04:41,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:04:41,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1529463384, now seen corresponding path program 1 times [2019-01-14 00:04:41,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:04:41,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:04:41,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:41,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:41,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:04:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:42,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:04:42,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:04:42,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:04:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:04:42,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:04:42,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 00:04:42,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:42,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:42,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-14 00:04:42,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 00:04:42,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:42,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:42,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-01-14 00:04:42,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:42,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:42,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:04:42,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:42,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:42,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2019-01-14 00:04:43,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:04:43,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:04:43,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:43,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:43,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:43,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-01-14 00:04:43,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 00:04:43,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:43,097 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:04:43,098 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 36 [2019-01-14 00:04:43,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:43,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:43,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:43,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2019-01-14 00:04:43,197 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 33 [2019-01-14 00:04:43,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:04:43,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:43,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:43,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:04:43,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:59 [2019-01-14 00:04:43,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:43,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:43,449 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-14 00:04:43,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:43,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2019-01-14 00:04:43,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:43,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:43,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:04:43,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:71 [2019-01-14 00:04:44,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:44,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:44,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:44,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:44,015 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:04:44,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 94 [2019-01-14 00:04:44,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:44,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:44,031 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:04:44,032 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2019-01-14 00:04:44,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:44,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2019-01-14 00:04:44,060 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:44,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-01-14 00:04:44,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:44,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:44,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:04:44,095 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:128, output treesize:47 [2019-01-14 00:04:44,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:44,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:44,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:44,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:44,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:04:44,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 52 [2019-01-14 00:04:44,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-14 00:04:44,337 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 31 treesize of output 28 [2019-01-14 00:04:44,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:04:44,341 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:44,348 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:44,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:04:44,364 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:25 [2019-01-14 00:04:44,553 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 22 treesize of output 20 [2019-01-14 00:04:44,556 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 11 treesize of output 7 [2019-01-14 00:04:44,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:04:44,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:44,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:04:44,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:5 [2019-01-14 00:04:44,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:04:44,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:04:44,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 39 [2019-01-14 00:04:44,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-14 00:04:44,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-14 00:04:44,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1444, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 00:04:44,611 INFO L87 Difference]: Start difference. First operand 127 states and 155 transitions. Second operand 40 states. [2019-01-14 00:04:50,135 WARN L181 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-01-14 00:05:00,111 WARN L181 SmtUtils]: Spent 8.70 s on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2019-01-14 00:05:01,071 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-01-14 00:05:01,368 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2019-01-14 00:05:01,710 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-01-14 00:05:01,950 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-01-14 00:05:02,328 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2019-01-14 00:05:02,605 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-01-14 00:05:02,911 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2019-01-14 00:05:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:05:04,434 INFO L93 Difference]: Finished difference Result 147 states and 163 transitions. [2019-01-14 00:05:04,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-14 00:05:04,435 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-01-14 00:05:04,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:05:04,437 INFO L225 Difference]: With dead ends: 147 [2019-01-14 00:05:04,437 INFO L226 Difference]: Without dead ends: 147 [2019-01-14 00:05:04,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=456, Invalid=4656, Unknown=0, NotChecked=0, Total=5112 [2019-01-14 00:05:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-14 00:05:04,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 121. [2019-01-14 00:05:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-14 00:05:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2019-01-14 00:05:04,445 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 39 [2019-01-14 00:05:04,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:05:04,446 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2019-01-14 00:05:04,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-14 00:05:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2019-01-14 00:05:04,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 00:05:04,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:05:04,446 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:05:04,452 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:05:04,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:05:04,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1534263643, now seen corresponding path program 1 times [2019-01-14 00:05:04,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:05:04,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:05:04,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:04,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:05:04,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:05:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 00:05:04,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:05:04,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 00:05:04,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:05:04,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:05:04,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:05:04,586 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand 5 states. [2019-01-14 00:05:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:05:04,690 INFO L93 Difference]: Finished difference Result 140 states and 168 transitions. [2019-01-14 00:05:04,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:05:04,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-01-14 00:05:04,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:05:04,694 INFO L225 Difference]: With dead ends: 140 [2019-01-14 00:05:04,694 INFO L226 Difference]: Without dead ends: 140 [2019-01-14 00:05:04,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:05:04,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-14 00:05:04,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-01-14 00:05:04,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-14 00:05:04,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 168 transitions. [2019-01-14 00:05:04,706 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 168 transitions. Word has length 39 [2019-01-14 00:05:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:05:04,706 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 168 transitions. [2019-01-14 00:05:04,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:05:04,706 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 168 transitions. [2019-01-14 00:05:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 00:05:04,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:05:04,710 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:05:04,711 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:05:04,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:05:04,713 INFO L82 PathProgramCache]: Analyzing trace with hash 165915722, now seen corresponding path program 2 times [2019-01-14 00:05:04,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:05:04,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:05:04,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:04,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:05:04,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:05:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:05:05,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:05:05,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:05:05,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:05:05,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:05:05,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:05:05,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:05:05,277 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:05:05,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:05:05,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 00:05:05,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:05:05,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:05:05,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:05:05,300 INFO L87 Difference]: Start difference. First operand 137 states and 168 transitions. Second operand 7 states. [2019-01-14 00:05:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:05:05,352 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2019-01-14 00:05:05,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:05:05,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-01-14 00:05:05,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:05:05,354 INFO L225 Difference]: With dead ends: 92 [2019-01-14 00:05:05,355 INFO L226 Difference]: Without dead ends: 81 [2019-01-14 00:05:05,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:05:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-14 00:05:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-14 00:05:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-14 00:05:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2019-01-14 00:05:05,361 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 40 [2019-01-14 00:05:05,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:05:05,363 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2019-01-14 00:05:05,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:05:05,363 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2019-01-14 00:05:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 00:05:05,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:05:05,364 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:05:05,364 INFO L423 AbstractCegarLoop]: === Iteration 22 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:05:05,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:05:05,364 INFO L82 PathProgramCache]: Analyzing trace with hash 168724710, now seen corresponding path program 1 times [2019-01-14 00:05:05,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:05:05,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:05:05,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:05,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:05:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:05:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:05:05,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:05:05,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 00:05:05,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 00:05:05,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 00:05:05,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:05:05,884 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 11 states. [2019-01-14 00:05:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:05:06,327 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2019-01-14 00:05:06,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:05:06,330 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-01-14 00:05:06,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:05:06,331 INFO L225 Difference]: With dead ends: 81 [2019-01-14 00:05:06,331 INFO L226 Difference]: Without dead ends: 81 [2019-01-14 00:05:06,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:05:06,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-14 00:05:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2019-01-14 00:05:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 00:05:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-01-14 00:05:06,334 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 40 [2019-01-14 00:05:06,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:05:06,335 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-01-14 00:05:06,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 00:05:06,337 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-01-14 00:05:06,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 00:05:06,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:05:06,339 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:05:06,339 INFO L423 AbstractCegarLoop]: === Iteration 23 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:05:06,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:05:06,342 INFO L82 PathProgramCache]: Analyzing trace with hash 317532742, now seen corresponding path program 1 times [2019-01-14 00:05:06,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:05:06,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:05:06,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:06,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:05:06,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:05:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:05:06,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:05:06,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 00:05:06,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:05:06,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:05:06,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:05:06,644 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 13 states. [2019-01-14 00:05:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:05:07,024 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2019-01-14 00:05:07,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 00:05:07,026 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-01-14 00:05:07,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:05:07,028 INFO L225 Difference]: With dead ends: 82 [2019-01-14 00:05:07,028 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 00:05:07,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-01-14 00:05:07,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 00:05:07,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-14 00:05:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-14 00:05:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2019-01-14 00:05:07,033 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 40 [2019-01-14 00:05:07,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:05:07,033 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2019-01-14 00:05:07,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:05:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2019-01-14 00:05:07,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 00:05:07,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:05:07,037 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:05:07,037 INFO L423 AbstractCegarLoop]: === Iteration 24 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:05:07,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:05:07,038 INFO L82 PathProgramCache]: Analyzing trace with hash 935498779, now seen corresponding path program 1 times [2019-01-14 00:05:07,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:05:07,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:05:07,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:07,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:05:07,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:05:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 00:05:07,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:05:07,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 00:05:07,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 00:05:07,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 00:05:07,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:05:07,223 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 9 states. [2019-01-14 00:05:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:05:07,348 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-01-14 00:05:07,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:05:07,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-01-14 00:05:07,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:05:07,351 INFO L225 Difference]: With dead ends: 81 [2019-01-14 00:05:07,351 INFO L226 Difference]: Without dead ends: 81 [2019-01-14 00:05:07,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:05:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-14 00:05:07,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2019-01-14 00:05:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-14 00:05:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-01-14 00:05:07,356 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 41 [2019-01-14 00:05:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:05:07,356 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2019-01-14 00:05:07,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 00:05:07,357 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2019-01-14 00:05:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 00:05:07,360 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:05:07,360 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:05:07,362 INFO L423 AbstractCegarLoop]: === Iteration 25 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:05:07,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:05:07,362 INFO L82 PathProgramCache]: Analyzing trace with hash -592043865, now seen corresponding path program 1 times [2019-01-14 00:05:07,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:05:07,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:05:07,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:07,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:05:07,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:05:07,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 00:05:07,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:05:07,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 00:05:07,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:05:07,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:05:07,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:05:07,542 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 5 states. [2019-01-14 00:05:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:05:07,623 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2019-01-14 00:05:07,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:05:07,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-01-14 00:05:07,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:05:07,626 INFO L225 Difference]: With dead ends: 74 [2019-01-14 00:05:07,626 INFO L226 Difference]: Without dead ends: 74 [2019-01-14 00:05:07,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 00:05:07,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-14 00:05:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-14 00:05:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 00:05:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-01-14 00:05:07,630 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 45 [2019-01-14 00:05:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:05:07,630 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-01-14 00:05:07,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:05:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-01-14 00:05:07,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 00:05:07,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:05:07,632 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:05:07,633 INFO L423 AbstractCegarLoop]: === Iteration 26 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:05:07,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:05:07,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2018469527, now seen corresponding path program 1 times [2019-01-14 00:05:07,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:05:07,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:05:07,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:07,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:05:07,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:05:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 00:05:07,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:05:07,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:05:07,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:05:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:05:07,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:05:07,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 00:05:07,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:05:07,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 00:05:07,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:05:07,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:05:07,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:05:07,943 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 5 states. [2019-01-14 00:05:08,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:05:08,023 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2019-01-14 00:05:08,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:05:08,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-14 00:05:08,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:05:08,026 INFO L225 Difference]: With dead ends: 76 [2019-01-14 00:05:08,026 INFO L226 Difference]: Without dead ends: 76 [2019-01-14 00:05:08,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:05:08,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-14 00:05:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-14 00:05:08,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-14 00:05:08,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-01-14 00:05:08,030 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 47 [2019-01-14 00:05:08,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:05:08,030 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2019-01-14 00:05:08,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:05:08,030 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2019-01-14 00:05:08,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-14 00:05:08,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:05:08,031 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:05:08,031 INFO L423 AbstractCegarLoop]: === Iteration 27 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:05:08,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:05:08,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1855543946, now seen corresponding path program 1 times [2019-01-14 00:05:08,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:05:08,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:05:08,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:08,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:05:08,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:05:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:05:08,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:05:08,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:05:08,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:05:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:05:08,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:05:08,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:08,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:08,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:05:08,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:08,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:08,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-01-14 00:05:08,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:05:08,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:05:08,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:08,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:08,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:08,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-14 00:05:08,775 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 19 treesize of output 14 [2019-01-14 00:05:08,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:08,780 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 14 treesize of output 23 [2019-01-14 00:05:08,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:08,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:08,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:08,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-01-14 00:05:08,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 45 treesize of output 41 [2019-01-14 00:05:08,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-14 00:05:08,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:08,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:08,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:08,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2019-01-14 00:05:09,476 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 25 treesize of output 21 [2019-01-14 00:05:09,486 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 21 treesize of output 13 [2019-01-14 00:05:09,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:09,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:09,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:09,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:13 [2019-01-14 00:05:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:05:09,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:05:09,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 37 [2019-01-14 00:05:09,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-14 00:05:09,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-14 00:05:09,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1224, Unknown=0, NotChecked=0, Total=1332 [2019-01-14 00:05:09,550 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 37 states. [2019-01-14 00:05:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:05:11,236 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-01-14 00:05:11,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 00:05:11,238 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 48 [2019-01-14 00:05:11,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:05:11,239 INFO L225 Difference]: With dead ends: 88 [2019-01-14 00:05:11,239 INFO L226 Difference]: Without dead ends: 81 [2019-01-14 00:05:11,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=279, Invalid=2373, Unknown=0, NotChecked=0, Total=2652 [2019-01-14 00:05:11,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-14 00:05:11,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2019-01-14 00:05:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-14 00:05:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-01-14 00:05:11,244 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 48 [2019-01-14 00:05:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:05:11,244 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-01-14 00:05:11,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-14 00:05:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-01-14 00:05:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 00:05:11,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:05:11,245 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:05:11,245 INFO L423 AbstractCegarLoop]: === Iteration 28 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:05:11,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:05:11,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1558585183, now seen corresponding path program 1 times [2019-01-14 00:05:11,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:05:11,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:05:11,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:11,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:05:11,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:05:11,718 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 8 [2019-01-14 00:05:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:05:12,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:05:12,659 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:05:12,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:05:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:05:12,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:05:12,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:12,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:12,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:05:12,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:12,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:12,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-14 00:05:12,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:05:12,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:05:12,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:12,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:12,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:12,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-01-14 00:05:12,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 00:05:12,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:12,866 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 27 [2019-01-14 00:05:12,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:12,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:12,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:12,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-01-14 00:05:12,922 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 45 treesize of output 39 [2019-01-14 00:05:12,926 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 16 treesize of output 15 [2019-01-14 00:05:12,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:12,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:12,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:12,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-14 00:05:13,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 49 [2019-01-14 00:05:13,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-01-14 00:05:13,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:13,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:13,516 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 7 treesize of output 5 [2019-01-14 00:05:13,518 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:13,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:13,523 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:65, output treesize:7 [2019-01-14 00:05:14,206 WARN L181 SmtUtils]: Spent 487.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 00:05:14,851 WARN L181 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 00:05:15,530 WARN L181 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 00:05:15,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:15,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 51 [2019-01-14 00:05:15,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-14 00:05:15,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 00:05:15,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:147 [2019-01-14 00:05:16,827 WARN L181 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 48 [2019-01-14 00:05:19,196 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 59 [2019-01-14 00:05:19,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:19,202 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:19,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 136 [2019-01-14 00:05:19,236 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 2 case distinctions, treesize of input 132 treesize of output 123 [2019-01-14 00:05:19,239 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:05:19,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:19,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 98 treesize of output 90 [2019-01-14 00:05:19,344 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 3 case distinctions, treesize of input 103 treesize of output 99 [2019-01-14 00:05:19,347 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2019-01-14 00:05:19,397 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:05:19,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:19,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:19,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 77 treesize of output 92 [2019-01-14 00:05:19,410 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 40 treesize of output 35 [2019-01-14 00:05:19,411 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:19,431 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:19,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-14 00:05:19,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:19,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:19,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:19,492 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:19,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 180 [2019-01-14 00:05:19,528 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 36 treesize of output 59 [2019-01-14 00:05:19,529 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-14 00:05:19,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:19,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:19,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:19,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 125 [2019-01-14 00:05:19,609 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 101 [2019-01-14 00:05:19,610 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:19,632 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:19,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:19,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:19,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:19,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 129 [2019-01-14 00:05:19,654 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 120 [2019-01-14 00:05:19,656 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:19,682 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:19,726 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 00:05:19,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:19,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:19,752 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:19,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 193 treesize of output 167 [2019-01-14 00:05:19,824 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 2 case distinctions, treesize of input 173 treesize of output 186 [2019-01-14 00:05:19,830 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:20,059 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:20,151 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 00:05:20,372 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 133 treesize of output 156 [2019-01-14 00:05:20,373 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2019-01-14 00:05:20,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:20,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:20,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:20,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:20,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 154 [2019-01-14 00:05:20,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 187 treesize of output 171 [2019-01-14 00:05:20,711 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:20,998 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-14 00:05:21,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:21,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 110 [2019-01-14 00:05:21,232 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:05:22,866 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. [2019-01-14 00:05:23,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:23,310 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:23,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:23,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 135 [2019-01-14 00:05:23,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 127 [2019-01-14 00:05:23,351 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:05:23,426 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:05:23,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:23,433 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:23,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:23,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 131 [2019-01-14 00:05:23,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 122 treesize of output 109 [2019-01-14 00:05:23,452 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:23,511 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:23,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:23,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:23,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:23,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 131 [2019-01-14 00:05:23,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 101 [2019-01-14 00:05:23,935 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:23,962 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:23,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:23,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:23,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:23,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 135 [2019-01-14 00:05:23,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 120 [2019-01-14 00:05:23,995 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:24,153 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:24,474 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 7 dim-0 vars, and 10 xjuncts. [2019-01-14 00:05:24,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:24,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:24,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:24,574 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:24,714 INFO L303 Elim1Store]: Index analysis took 237 ms [2019-01-14 00:05:24,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 186 [2019-01-14 00:05:24,736 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 36 treesize of output 59 [2019-01-14 00:05:24,736 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2019-01-14 00:05:24,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:24,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:24,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:24,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:24,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 133 [2019-01-14 00:05:24,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 109 [2019-01-14 00:05:24,811 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:24,834 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:24,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:24,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:24,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:24,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:24,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 137 [2019-01-14 00:05:24,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 128 [2019-01-14 00:05:24,858 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:24,882 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:24,937 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 00:05:25,550 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 133 treesize of output 125 [2019-01-14 00:05:25,555 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 66 treesize of output 58 [2019-01-14 00:05:25,555 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,579 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,582 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 101 treesize of output 91 [2019-01-14 00:05:25,586 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 68 treesize of output 58 [2019-01-14 00:05:25,586 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,606 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,610 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 121 treesize of output 113 [2019-01-14 00:05:25,613 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 63 treesize of output 55 [2019-01-14 00:05:25,613 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,655 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,659 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 97 treesize of output 87 [2019-01-14 00:05:25,661 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 63 treesize of output 53 [2019-01-14 00:05:25,661 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,679 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,683 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 109 treesize of output 101 [2019-01-14 00:05:25,687 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 63 treesize of output 55 [2019-01-14 00:05:25,687 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,710 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,713 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 103 treesize of output 93 [2019-01-14 00:05:25,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2019-01-14 00:05:25,716 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,741 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,744 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 109 treesize of output 97 [2019-01-14 00:05:25,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2019-01-14 00:05:25,756 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,772 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,775 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 101 treesize of output 91 [2019-01-14 00:05:25,795 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 68 treesize of output 58 [2019-01-14 00:05:25,796 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,816 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,819 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 176 treesize of output 162 [2019-01-14 00:05:25,822 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 142 treesize of output 128 [2019-01-14 00:05:25,823 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,843 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,846 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 122 treesize of output 114 [2019-01-14 00:05:25,867 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 63 treesize of output 55 [2019-01-14 00:05:25,868 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,892 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 84 [2019-01-14 00:05:25,897 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 45 treesize of output 37 [2019-01-14 00:05:25,898 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,918 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,921 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 80 treesize of output 72 [2019-01-14 00:05:25,924 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 45 treesize of output 37 [2019-01-14 00:05:25,924 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,943 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:25,947 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 90 treesize of output 82 [2019-01-14 00:05:25,950 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 45 treesize of output 37 [2019-01-14 00:05:25,951 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:26,001 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:26,004 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 90 treesize of output 82 [2019-01-14 00:05:26,011 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 45 treesize of output 37 [2019-01-14 00:05:26,011 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:26,031 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:26,033 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 84 treesize of output 76 [2019-01-14 00:05:26,036 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 45 treesize of output 37 [2019-01-14 00:05:26,036 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:26,058 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:26,060 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 206 treesize of output 190 [2019-01-14 00:05:26,063 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 171 treesize of output 155 [2019-01-14 00:05:26,063 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:26,097 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:26,100 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 103 treesize of output 93 [2019-01-14 00:05:26,103 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 63 treesize of output 53 [2019-01-14 00:05:26,103 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:26,133 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:26,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 33 dim-0 vars, and 17 xjuncts. [2019-01-14 00:05:26,723 INFO L202 ElimStorePlain]: Needed 70 recursive calls to eliminate 8 variables, input treesize:587, output treesize:1507 [2019-01-14 00:05:27,371 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 392 DAG size of output: 76 [2019-01-14 00:05:27,782 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 65 treesize of output 48 [2019-01-14 00:05:27,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-01-14 00:05:27,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:27,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:27,797 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 31 treesize of output 19 [2019-01-14 00:05:27,797 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:27,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:27,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:27,860 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 76 treesize of output 61 [2019-01-14 00:05:27,864 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 33 treesize of output 21 [2019-01-14 00:05:27,865 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:27,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:27,882 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 27 treesize of output 17 [2019-01-14 00:05:27,882 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:27,888 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:27,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:27,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:27,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 63 [2019-01-14 00:05:27,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-14 00:05:27,941 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:27,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-01-14 00:05:27,961 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:27,974 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 24 treesize of output 10 [2019-01-14 00:05:27,974 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:27,982 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:28,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 00:05:28,012 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 9 variables, input treesize:208, output treesize:44 [2019-01-14 00:05:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:05:28,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:05:28,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 44 [2019-01-14 00:05:28,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-14 00:05:28,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-14 00:05:28,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1852, Unknown=1, NotChecked=0, Total=1980 [2019-01-14 00:05:28,129 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 45 states. [2019-01-14 00:05:32,394 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-01-14 00:05:32,988 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 86 [2019-01-14 00:05:33,268 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 94 [2019-01-14 00:05:33,556 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 99 [2019-01-14 00:05:33,895 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 95 [2019-01-14 00:05:34,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:05:34,706 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2019-01-14 00:05:34,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 00:05:34,707 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 49 [2019-01-14 00:05:34,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:05:34,708 INFO L225 Difference]: With dead ends: 97 [2019-01-14 00:05:34,708 INFO L226 Difference]: Without dead ends: 97 [2019-01-14 00:05:34,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=318, Invalid=3841, Unknown=1, NotChecked=0, Total=4160 [2019-01-14 00:05:34,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-14 00:05:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 80. [2019-01-14 00:05:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-14 00:05:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2019-01-14 00:05:34,713 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 49 [2019-01-14 00:05:34,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:05:34,713 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2019-01-14 00:05:34,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-14 00:05:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2019-01-14 00:05:34,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 00:05:34,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:05:34,714 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:05:34,715 INFO L423 AbstractCegarLoop]: === Iteration 29 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:05:34,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:05:34,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1558585184, now seen corresponding path program 1 times [2019-01-14 00:05:34,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:05:34,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:05:34,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:34,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:05:34,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:05:35,616 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-14 00:05:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:05:36,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:05:36,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:05:36,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:05:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:05:36,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:05:36,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:36,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:36,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:05:36,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:36,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:36,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-01-14 00:05:36,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:05:36,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:05:36,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:36,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:36,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:36,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-01-14 00:05:36,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 00:05:36,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:36,229 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:36,230 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 36 [2019-01-14 00:05:36,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:36,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:36,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:36,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-01-14 00:05:36,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 00:05:36,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:05:36,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:36,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:36,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:36,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2019-01-14 00:05:36,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 00:05:36,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:05:36,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:36,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:36,915 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 22 [2019-01-14 00:05:36,918 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 22 treesize of output 21 [2019-01-14 00:05:36,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:36,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:36,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:36,926 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:47 [2019-01-14 00:05:37,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 79 [2019-01-14 00:05:37,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:37,065 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:37,065 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 63 [2019-01-14 00:05:37,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:37,146 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 42 treesize of output 40 [2019-01-14 00:05:37,146 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:37,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:37,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-01-14 00:05:37,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:37,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:37,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:37,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:37,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:37,273 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:37,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 60 [2019-01-14 00:05:37,274 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:37,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:37,323 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 8 treesize of output 6 [2019-01-14 00:05:37,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-01-14 00:05:37,326 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:37,328 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:37,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:37,334 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:94, output treesize:26 [2019-01-14 00:05:37,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-14 00:05:37,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-14 00:05:37,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:37,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:37,510 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 20 [2019-01-14 00:05:37,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2019-01-14 00:05:37,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:37,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:37,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:37,520 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2019-01-14 00:05:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:05:37,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:05:37,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 42 [2019-01-14 00:05:37,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-14 00:05:37,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-14 00:05:37,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1677, Unknown=0, NotChecked=0, Total=1806 [2019-01-14 00:05:37,590 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 43 states. [2019-01-14 00:05:39,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:05:39,910 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2019-01-14 00:05:39,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-14 00:05:39,913 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 49 [2019-01-14 00:05:39,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:05:39,914 INFO L225 Difference]: With dead ends: 99 [2019-01-14 00:05:39,914 INFO L226 Difference]: Without dead ends: 99 [2019-01-14 00:05:39,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=345, Invalid=3561, Unknown=0, NotChecked=0, Total=3906 [2019-01-14 00:05:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-14 00:05:39,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2019-01-14 00:05:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 00:05:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2019-01-14 00:05:39,920 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 49 [2019-01-14 00:05:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:05:39,920 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2019-01-14 00:05:39,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-14 00:05:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2019-01-14 00:05:39,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-14 00:05:39,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:05:39,921 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:05:39,921 INFO L423 AbstractCegarLoop]: === Iteration 30 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:05:39,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:05:39,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1080266094, now seen corresponding path program 1 times [2019-01-14 00:05:39,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:05:39,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:05:39,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:39,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:05:39,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:05:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:05:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:05:41,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:05:41,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:05:41,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:05:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:05:41,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:05:41,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 00:05:41,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:41,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:41,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-14 00:05:41,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 00:05:41,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:41,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:41,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-01-14 00:05:42,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:05:42,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:05:42,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:42,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:42,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:05:42,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:05:42,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:42,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:42,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:42,296 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-01-14 00:05:42,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 00:05:42,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:42,380 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 27 [2019-01-14 00:05:42,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:42,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:42,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 00:05:42,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:42,422 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 27 [2019-01-14 00:05:42,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:42,431 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:42,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:42,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2019-01-14 00:05:42,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:42,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:42,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:05:42,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:42,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:42,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:65 [2019-01-14 00:05:42,772 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 34 treesize of output 35 [2019-01-14 00:05:42,777 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 12 treesize of output 1 [2019-01-14 00:05:42,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:42,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:42,827 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 34 treesize of output 35 [2019-01-14 00:05:42,836 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 12 treesize of output 1 [2019-01-14 00:05:42,836 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:42,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:42,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:42,875 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:68 [2019-01-14 00:05:43,170 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 00:05:43,179 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 33 [2019-01-14 00:05:43,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:05:43,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:43,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:43,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2019-01-14 00:05:43,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:05:43,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:43,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:43,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:43,292 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:98 [2019-01-14 00:05:43,405 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 53 treesize of output 58 [2019-01-14 00:05:43,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:43,411 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:43,412 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 36 [2019-01-14 00:05:43,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:43,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:43,779 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 71 treesize of output 66 [2019-01-14 00:05:43,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:43,786 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 44 treesize of output 57 [2019-01-14 00:05:43,787 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:43,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:43,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:43,848 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:124, output treesize:116 [2019-01-14 00:05:43,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:43,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 154 treesize of output 143 [2019-01-14 00:05:43,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:43,988 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 53 [2019-01-14 00:05:43,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:44,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:44,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:44,081 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:44,085 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 74 treesize of output 66 [2019-01-14 00:05:44,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:44,092 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2019-01-14 00:05:44,092 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:44,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:44,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:44,152 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:187, output treesize:141 [2019-01-14 00:05:44,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:44,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:44,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 39 [2019-01-14 00:05:44,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:44,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:44,531 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 29 treesize of output 52 [2019-01-14 00:05:44,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:44,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:44,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:44,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:153, output treesize:154 [2019-01-14 00:05:44,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:44,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:44,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:44,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:44,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 188 [2019-01-14 00:05:44,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 77 [2019-01-14 00:05:44,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:44,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:44,941 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 57 [2019-01-14 00:05:44,942 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:44,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:44,974 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 49 [2019-01-14 00:05:44,975 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:44,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:45,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:45,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:45,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2019-01-14 00:05:45,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:45,056 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 19 treesize of output 12 [2019-01-14 00:05:45,057 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:45,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2019-01-14 00:05:45,075 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:45,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:45,089 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:45,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 8 [2019-01-14 00:05:45,091 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:45,096 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:45,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:45,119 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:265, output treesize:36 [2019-01-14 00:05:46,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,093 INFO L303 Elim1Store]: Index analysis took 112 ms [2019-01-14 00:05:46,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 112 [2019-01-14 00:05:46,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:46,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 486 treesize of output 378 [2019-01-14 00:05:46,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,332 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:46,373 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 193 [2019-01-14 00:05:46,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 00:05:46,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 402 treesize of output 361 [2019-01-14 00:05:46,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 393 treesize of output 338 [2019-01-14 00:05:46,593 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:46,681 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:46,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 400 treesize of output 357 [2019-01-14 00:05:46,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 415 treesize of output 358 [2019-01-14 00:05:46,725 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:46,807 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:05:46,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:46,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 425 treesize of output 366 [2019-01-14 00:05:46,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 436 treesize of output 375 [2019-01-14 00:05:46,850 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 00:05:46,935 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 00:05:47,704 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-01-14 00:05:48,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:48,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:48,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:48,586 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:48,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 291 [2019-01-14 00:05:48,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:48,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:48,624 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:48,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 87 [2019-01-14 00:05:48,625 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:48,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:48,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:48,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:48,710 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:48,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 228 [2019-01-14 00:05:48,718 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 195 treesize of output 164 [2019-01-14 00:05:48,718 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:48,763 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:48,806 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:48,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:48,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:48,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:48,835 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:48,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 339 treesize of output 308 [2019-01-14 00:05:48,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:48,901 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:48,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 79 [2019-01-14 00:05:48,905 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:49,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:49,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:49,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:49,118 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:49,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 243 [2019-01-14 00:05:49,125 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 210 treesize of output 177 [2019-01-14 00:05:49,125 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:49,174 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:49,216 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:49,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:49,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:49,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:49,232 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:49,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 320 treesize of output 289 [2019-01-14 00:05:49,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:49,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:49,288 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:49,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 87 [2019-01-14 00:05:49,289 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:49,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:49,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:49,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:49,375 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:49,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 222 [2019-01-14 00:05:49,383 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 189 treesize of output 158 [2019-01-14 00:05:49,384 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:49,428 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:49,469 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:49,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-14 00:05:49,656 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 7 variables, input treesize:584, output treesize:511 [2019-01-14 00:05:51,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:51,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:51,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:51,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:51,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 188 [2019-01-14 00:05:51,277 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 53 treesize of output 50 [2019-01-14 00:05:51,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:51,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:51,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:51,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 77 [2019-01-14 00:05:51,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 00:05:51,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:51,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:51,424 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:51,425 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 105 [2019-01-14 00:05:51,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:51,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:51,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:51,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:51,433 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:51,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 129 [2019-01-14 00:05:51,448 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-14 00:05:51,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-01-14 00:05:51,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:51,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:51,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 96 [2019-01-14 00:05:51,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:51,820 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:51,821 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 45 treesize of output 36 [2019-01-14 00:05:51,822 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:51,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:51,875 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:51,876 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2019-01-14 00:05:51,876 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:51,920 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:51,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 00:05:51,922 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:51,949 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:51,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:51,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:51,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 100 [2019-01-14 00:05:51,975 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:51,976 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 27 treesize of output 25 [2019-01-14 00:05:51,976 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:52,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:52,034 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:52,035 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 00:05:52,035 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:52,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:52,069 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:52,070 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 39 treesize of output 24 [2019-01-14 00:05:52,070 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:52,088 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:52,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:52,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:52,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 94 [2019-01-14 00:05:52,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:52,108 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:52,110 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 35 treesize of output 28 [2019-01-14 00:05:52,110 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:52,150 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 29 treesize of output 18 [2019-01-14 00:05:52,150 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:52,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:52,174 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 22 treesize of output 12 [2019-01-14 00:05:52,174 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:52,190 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:52,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:52,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:52,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:52,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 156 [2019-01-14 00:05:52,317 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 54 treesize of output 42 [2019-01-14 00:05:52,318 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:52,362 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 66 treesize of output 41 [2019-01-14 00:05:52,363 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:52,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:52,397 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:52,399 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 00:05:52,399 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:52,427 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:52,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:52,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:52,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:52,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 77 [2019-01-14 00:05:52,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:05:52,545 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:05:52,547 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 00:05:52,547 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:52,577 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 26 treesize of output 12 [2019-01-14 00:05:52,578 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:52,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-01-14 00:05:52,596 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 00:05:52,607 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:52,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:05:52,681 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 11 variables, input treesize:387, output treesize:7 [2019-01-14 00:05:52,784 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:05:52,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:05:52,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32] total 58 [2019-01-14 00:05:52,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-14 00:05:52,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-14 00:05:52,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3123, Unknown=1, NotChecked=0, Total=3306 [2019-01-14 00:05:52,805 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 58 states. [2019-01-14 00:05:54,925 WARN L181 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-01-14 00:05:55,956 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-01-14 00:06:04,074 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-01-14 00:06:11,110 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 102 [2019-01-14 00:06:11,574 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 107 [2019-01-14 00:06:12,033 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 112 [2019-01-14 00:06:12,570 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 109 [2019-01-14 00:06:16,295 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-01-14 00:06:17,532 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-01-14 00:06:17,711 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 00:06:18,382 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-14 00:06:18,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:06:18,513 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2019-01-14 00:06:18,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 00:06:18,516 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 52 [2019-01-14 00:06:18,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:06:18,518 INFO L225 Difference]: With dead ends: 96 [2019-01-14 00:06:18,518 INFO L226 Difference]: Without dead ends: 96 [2019-01-14 00:06:18,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2328 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=524, Invalid=8217, Unknown=1, NotChecked=0, Total=8742 [2019-01-14 00:06:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-14 00:06:18,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2019-01-14 00:06:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-14 00:06:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2019-01-14 00:06:18,526 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 52 [2019-01-14 00:06:18,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:06:18,532 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2019-01-14 00:06:18,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-14 00:06:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2019-01-14 00:06:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-14 00:06:18,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:06:18,533 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] [2019-01-14 00:06:18,533 INFO L423 AbstractCegarLoop]: === Iteration 31 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:06:18,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:06:18,534 INFO L82 PathProgramCache]: Analyzing trace with hash 871494441, now seen corresponding path program 1 times [2019-01-14 00:06:18,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:06:18,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:06:18,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:06:18,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:06:18,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:06:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:06:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:06:19,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:06:19,260 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:06:19,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:06:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:06:19,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:06:19,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:19,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:19,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:06:19,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:19,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:19,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-14 00:06:19,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:06:19,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:06:19,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:19,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:19,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:19,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-01-14 00:06:19,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 00:06:19,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:19,623 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:06:19,624 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 36 [2019-01-14 00:06:19,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:19,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:19,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:19,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-01-14 00:06:19,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 00:06:19,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 00:06:19,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:19,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:19,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:06:19,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2019-01-14 00:06:20,063 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 22 [2019-01-14 00:06:20,065 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 22 treesize of output 21 [2019-01-14 00:06:20,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:20,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:20,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:20,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-14 00:06:20,112 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 64 treesize of output 56 [2019-01-14 00:06:20,116 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 56 treesize of output 48 [2019-01-14 00:06:20,117 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:06:20,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:06:20,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 59 [2019-01-14 00:06:20,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:20,188 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 51 treesize of output 39 [2019-01-14 00:06:20,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:20,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 00:06:20,250 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:20,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:20,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2019-01-14 00:06:20,303 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:06:20,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:20,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:20,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:20,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 54 [2019-01-14 00:06:20,360 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:20,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:20,404 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 30 treesize of output 20 [2019-01-14 00:06:20,405 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:20,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2019-01-14 00:06:20,465 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:20,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:20,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:20,481 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:78, output treesize:11 [2019-01-14 00:06:20,591 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 15 treesize of output 11 [2019-01-14 00:06:20,594 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 11 treesize of output 3 [2019-01-14 00:06:20,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:20,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:20,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:20,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-14 00:06:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:06:20,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:06:20,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 39 [2019-01-14 00:06:20,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-14 00:06:20,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-14 00:06:20,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1458, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 00:06:20,630 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 40 states. [2019-01-14 00:06:23,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:06:23,960 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2019-01-14 00:06:23,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-14 00:06:23,963 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 53 [2019-01-14 00:06:23,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:06:23,965 INFO L225 Difference]: With dead ends: 122 [2019-01-14 00:06:23,965 INFO L226 Difference]: Without dead ends: 122 [2019-01-14 00:06:23,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=483, Invalid=4773, Unknown=0, NotChecked=0, Total=5256 [2019-01-14 00:06:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-14 00:06:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2019-01-14 00:06:23,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 00:06:23,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2019-01-14 00:06:23,971 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 53 [2019-01-14 00:06:23,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:06:23,971 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2019-01-14 00:06:23,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-14 00:06:23,971 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2019-01-14 00:06:23,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 00:06:23,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:06:23,972 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:06:23,972 INFO L423 AbstractCegarLoop]: === Iteration 32 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:06:23,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:06:23,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1246523955, now seen corresponding path program 1 times [2019-01-14 00:06:23,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:06:23,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:06:23,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:06:23,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:06:23,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:06:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:06:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:06:24,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:06:24,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:06:24,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:06:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:06:24,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:06:25,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:25,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:25,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:06:25,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-01-14 00:06:25,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:06:25,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:06:25,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-01-14 00:06:25,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 00:06:25,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:25,130 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 27 [2019-01-14 00:06:25,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-01-14 00:06:25,195 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 56 treesize of output 50 [2019-01-14 00:06:25,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 16 treesize of output 15 [2019-01-14 00:06:25,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:06:25,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2019-01-14 00:06:25,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 56 [2019-01-14 00:06:25,511 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 42 treesize of output 33 [2019-01-14 00:06:25,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,565 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2019-01-14 00:06:25,566 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,614 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 00:06:25,615 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-01-14 00:06:25,651 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,669 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 7 treesize of output 5 [2019-01-14 00:06:25,673 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,680 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:7 [2019-01-14 00:06:25,812 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 22 [2019-01-14 00:06:25,814 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 22 treesize of output 21 [2019-01-14 00:06:25,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-01-14 00:06:25,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 71 [2019-01-14 00:06:25,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:25,887 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:06:25,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 62 [2019-01-14 00:06:25,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:25,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:25,957 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:06:25,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2019-01-14 00:06:25,961 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:26,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2019-01-14 00:06:26,023 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:26,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2019-01-14 00:06:26,077 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:26,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:26,107 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 7 treesize of output 5 [2019-01-14 00:06:26,116 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 3 [2019-01-14 00:06:26,117 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:26,118 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:26,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:26,122 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:93, output treesize:13 [2019-01-14 00:06:26,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-14 00:06:26,245 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 13 treesize of output 9 [2019-01-14 00:06:26,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:26,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:26,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:26,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-01-14 00:06:26,260 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:06:26,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:06:26,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 38 [2019-01-14 00:06:26,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-14 00:06:26,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-14 00:06:26,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1380, Unknown=0, NotChecked=0, Total=1482 [2019-01-14 00:06:26,280 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 39 states. [2019-01-14 00:06:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:06:29,587 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2019-01-14 00:06:29,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-14 00:06:29,591 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 54 [2019-01-14 00:06:29,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:06:29,592 INFO L225 Difference]: With dead ends: 110 [2019-01-14 00:06:29,592 INFO L226 Difference]: Without dead ends: 110 [2019-01-14 00:06:29,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=308, Invalid=3232, Unknown=0, NotChecked=0, Total=3540 [2019-01-14 00:06:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-14 00:06:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2019-01-14 00:06:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 00:06:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2019-01-14 00:06:29,598 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 54 [2019-01-14 00:06:29,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:06:29,598 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2019-01-14 00:06:29,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-14 00:06:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2019-01-14 00:06:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-14 00:06:29,599 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:06:29,599 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, 1, 1, 1, 1, 1] [2019-01-14 00:06:29,599 INFO L423 AbstractCegarLoop]: === Iteration 33 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:06:29,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:06:29,600 INFO L82 PathProgramCache]: Analyzing trace with hash 692280441, now seen corresponding path program 1 times [2019-01-14 00:06:29,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:06:29,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:06:29,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:06:29,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:06:29,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:06:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:06:29,888 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-01-14 00:06:31,175 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-01-14 00:06:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:06:31,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:06:31,743 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:06:31,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:06:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:06:31,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:06:31,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 00:06:31,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:31,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:31,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-01-14 00:06:31,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:31,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:31,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-01-14 00:06:31,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:31,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:31,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:33 [2019-01-14 00:06:32,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:06:32,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:06:32,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:32,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:32,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:32,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-01-14 00:06:32,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 00:06:32,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:32,170 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 27 [2019-01-14 00:06:32,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:32,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:32,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:32,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2019-01-14 00:06:32,308 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 78 treesize of output 72 [2019-01-14 00:06:32,314 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 16 treesize of output 15 [2019-01-14 00:06:32,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:32,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:32,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:06:32,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:81 [2019-01-14 00:06:33,336 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-14 00:06:33,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:33,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:33,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2019-01-14 00:06:33,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:33,398 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 29 treesize of output 22 [2019-01-14 00:06:33,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:33,431 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 86 treesize of output 78 [2019-01-14 00:06:33,436 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 78 treesize of output 70 [2019-01-14 00:06:33,437 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:06:33,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:06:33,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:33,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:33,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 67 [2019-01-14 00:06:33,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2019-01-14 00:06:33,499 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:33,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:33,524 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2019-01-14 00:06:33,525 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:33,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-01-14 00:06:33,534 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:33,537 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:33,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:33,548 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:172, output treesize:10 [2019-01-14 00:06:35,170 WARN L181 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 00:06:35,946 WARN L181 SmtUtils]: Spent 702.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 00:06:36,749 WARN L181 SmtUtils]: Spent 728.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 00:06:38,318 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_remove_first_~temp~1.offset Int)) (let ((.cse2 (select (select |c_old(#memory_$Pointer$.base)| (select (select |c_old(#memory_$Pointer$.base)| |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset|)) (+ (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_remove_first_#in~head.base|) |c_dll_remove_first_#in~head.offset|) 4)))) (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| .cse2 (store (select |c_old(#memory_$Pointer$.base)| .cse2) (+ dll_remove_first_~temp~1.offset 8) 0)))) (let ((.cse1 (select .cse0 |c_dll_remove_first_#in~head.base|))) (and (= |c_#memory_$Pointer$.base| (store .cse0 |c_dll_remove_first_#in~head.base| (store .cse1 |c_dll_remove_first_#in~head.offset| .cse2))) (= |c_#valid| (store |c_old(#valid)| (select .cse1 |c_dll_remove_first_#in~head.offset|) 0))))))) is different from true [2019-01-14 00:06:38,461 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-01-14 00:06:38,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:38,467 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 39 treesize of output 51 [2019-01-14 00:06:38,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:38,522 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 206 treesize of output 186 [2019-01-14 00:06:38,527 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 186 treesize of output 166 [2019-01-14 00:06:38,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:06:38,550 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:06:38,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:38,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:38,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:38,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 160 [2019-01-14 00:06:38,634 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 32 treesize of output 51 [2019-01-14 00:06:38,635 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-14 00:06:38,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:38,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:38,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:38,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:38,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 144 [2019-01-14 00:06:38,712 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 129 [2019-01-14 00:06:38,713 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:06:38,746 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:06:38,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:38,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:38,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:38,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:38,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 140 [2019-01-14 00:06:38,769 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 114 [2019-01-14 00:06:38,770 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 00:06:38,804 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 00:06:38,865 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 00:06:38,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-14 00:06:38,946 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:315, output treesize:218 [2019-01-14 00:06:39,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:39,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:39,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:39,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-01-14 00:06:39,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:39,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:39,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:39,249 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 17 treesize of output 10 [2019-01-14 00:06:39,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:39,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:39,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:39,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2019-01-14 00:06:39,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2019-01-14 00:06:39,285 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:39,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-14 00:06:39,299 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:39,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:39,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2019-01-14 00:06:39,312 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:39,315 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:39,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:06:39,323 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:104, output treesize:7 [2019-01-14 00:06:39,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:39,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:39,533 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 27 treesize of output 54 [2019-01-14 00:06:39,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:39,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:39,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:39,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 79 [2019-01-14 00:06:39,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2019-01-14 00:06:39,591 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:39,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-14 00:06:39,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:39,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:39,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 31 [2019-01-14 00:06:39,629 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:06:39,638 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:06:39,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:06:39,656 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:116, output treesize:46 [2019-01-14 00:06:39,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:39,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:06:39,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-14 00:06:39,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:06:39,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 00:06:39,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:51 [2019-01-14 00:06:39,907 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-01-14 00:06:39,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:06:39,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 52 [2019-01-14 00:06:39,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-14 00:06:39,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-14 00:06:39,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2501, Unknown=2, NotChecked=100, Total=2756 [2019-01-14 00:06:39,928 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 53 states. [2019-01-14 00:06:41,622 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-01-14 00:06:41,964 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 64 [2019-01-14 00:06:49,087 WARN L181 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2019-01-14 00:07:00,986 WARN L181 SmtUtils]: Spent 607.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 00:07:01,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:07:01,880 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2019-01-14 00:07:01,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 00:07:01,882 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 63 [2019-01-14 00:07:01,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:07:01,883 INFO L225 Difference]: With dead ends: 117 [2019-01-14 00:07:01,883 INFO L226 Difference]: Without dead ends: 111 [2019-01-14 00:07:01,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=312, Invalid=4937, Unknown=11, NotChecked=142, Total=5402 [2019-01-14 00:07:01,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-14 00:07:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2019-01-14 00:07:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-14 00:07:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2019-01-14 00:07:01,890 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 63 [2019-01-14 00:07:01,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:07:01,890 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2019-01-14 00:07:01,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-14 00:07:01,891 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2019-01-14 00:07:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-14 00:07:01,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:07:01,891 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:07:01,892 INFO L423 AbstractCegarLoop]: === Iteration 34 === [dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr12REQUIRES_VIOLATION]=== [2019-01-14 00:07:01,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:07:01,892 INFO L82 PathProgramCache]: Analyzing trace with hash -10552966, now seen corresponding path program 1 times [2019-01-14 00:07:01,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:07:01,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:07:01,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:07:01,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:07:01,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:07:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:07:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 00:07:02,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:07:02,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 00:07:02,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:07:02,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:07:02,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:07:02,241 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 6 states. [2019-01-14 00:07:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:07:02,296 INFO L93 Difference]: Finished difference Result 60 states and 59 transitions. [2019-01-14 00:07:02,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:07:02,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-01-14 00:07:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:07:02,297 INFO L225 Difference]: With dead ends: 60 [2019-01-14 00:07:02,297 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 00:07:02,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:07:02,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 00:07:02,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 00:07:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 00:07:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 00:07:02,301 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2019-01-14 00:07:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:07:02,301 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 00:07:02,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:07:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 00:07:02,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 00:07:02,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:07:02 BoogieIcfgContainer [2019-01-14 00:07:02,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 00:07:02,315 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 00:07:02,315 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 00:07:02,316 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 00:07:02,316 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:04:03" (3/4) ... [2019-01-14 00:07:02,324 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 00:07:02,331 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 00:07:02,331 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-14 00:07:02,331 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create [2019-01-14 00:07:02,331 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 00:07:02,332 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 00:07:02,332 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 00:07:02,332 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-01-14 00:07:02,332 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_remove_first [2019-01-14 00:07:02,341 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-14 00:07:02,341 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-14 00:07:02,341 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 00:07:02,392 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 00:07:02,392 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 00:07:02,393 INFO L168 Benchmark]: Toolchain (without parser) took 180504.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 291.0 MB). Free memory was 948.7 MB in the beginning and 843.6 MB in the end (delta: 105.1 MB). Peak memory consumption was 396.1 MB. Max. memory is 11.5 GB. [2019-01-14 00:07:02,393 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:07:02,394 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 35.6 MB. Max. memory is 11.5 GB. [2019-01-14 00:07:02,394 INFO L168 Benchmark]: Boogie Preprocessor took 72.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 00:07:02,394 INFO L168 Benchmark]: RCFGBuilder took 1081.56 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.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2019-01-14 00:07:02,395 INFO L168 Benchmark]: TraceAbstraction took 178577.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 1.1 GB in the beginning and 843.6 MB in the end (delta: 214.0 MB). Peak memory consumption was 364.5 MB. Max. memory is 11.5 GB. [2019-01-14 00:07:02,395 INFO L168 Benchmark]: Witness Printer took 76.83 ms. Allocated memory is still 1.3 GB. Free memory is still 843.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:07:02,397 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 691.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 35.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1081.56 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.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 178577.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 1.1 GB in the beginning and 843.6 MB in the end (delta: 214.0 MB). Peak memory consumption was 364.5 MB. Max. memory is 11.5 GB. * Witness Printer took 76.83 ms. Allocated memory is still 1.3 GB. Free memory is still 843.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: 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: 571]: 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: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 597]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 92 locations, 30 error locations. SAFE Result, 178.5s OverallTime, 34 OverallIterations, 3 TraceHistogramMax, 108.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1374 SDtfs, 2836 SDslu, 7841 SDs, 0 SdLazy, 16856 SolverSat, 624 SolverUnsat, 23 SolverUnknown, 0 SolverNotchecked, 47.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1433 GetRequests, 555 SyntacticMatches, 53 SemanticMatches, 825 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 9438 ImplicationChecksByTransitivity, 99.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=20, 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, 34 MinimizatonAttempts, 283 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 67.3s InterpolantComputationTime, 1954 NumberOfCodeBlocks, 1954 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 1902 ConstructedInterpolants, 186 QuantifiedInterpolants, 1608406 SizeOfPredicates, 272 NumberOfNonLiveVariables, 4176 ConjunctsInSsa, 843 ConjunctsInUnsatCore, 52 InterpolantComputations, 16 PerfectInterpolantSequences, 230/564 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...