./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.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/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.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 3aee1e8d9b723b18f218b6c1185554e637930c5d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 23:48:47,013 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 23:48:47,015 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 23:48:47,033 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 23:48:47,035 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 23:48:47,036 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 23:48:47,038 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 23:48:47,040 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 23:48:47,042 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 23:48:47,045 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 23:48:47,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 23:48:47,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 23:48:47,049 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 23:48:47,052 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 23:48:47,062 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 23:48:47,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 23:48:47,065 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 23:48:47,067 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 23:48:47,072 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 23:48:47,075 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 23:48:47,077 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 23:48:47,079 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 23:48:47,085 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 23:48:47,087 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 23:48:47,087 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 23:48:47,088 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 23:48:47,089 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 23:48:47,090 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 23:48:47,093 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 23:48:47,094 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 23:48:47,094 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 23:48:47,097 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 23:48:47,097 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 23:48:47,097 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 23:48:47,098 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 23:48:47,099 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 23:48:47,099 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 23:48:47,123 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 23:48:47,124 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 23:48:47,125 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 23:48:47,125 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 23:48:47,125 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 23:48:47,126 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 23:48:47,126 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 23:48:47,126 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 23:48:47,126 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 23:48:47,126 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 23:48:47,126 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 23:48:47,127 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 23:48:47,127 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 23:48:47,127 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 23:48:47,127 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 23:48:47,127 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 23:48:47,127 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 23:48:47,129 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 23:48:47,129 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 23:48:47,130 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 23:48:47,130 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 23:48:47,130 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 23:48:47,130 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 23:48:47,130 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 23:48:47,130 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 23:48:47,131 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 23:48:47,132 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 -> 3aee1e8d9b723b18f218b6c1185554e637930c5d [2019-01-13 23:48:47,192 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 23:48:47,210 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 23:48:47,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 23:48:47,216 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 23:48:47,217 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 23:48:47,217 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2019-01-13 23:48:47,277 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c82adea8/2b3e7f814ea04f5890bb1b361250122f/FLAG5cdcba89f [2019-01-13 23:48:47,826 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 23:48:47,827 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2019-01-13 23:48:47,844 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c82adea8/2b3e7f814ea04f5890bb1b361250122f/FLAG5cdcba89f [2019-01-13 23:48:48,118 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c82adea8/2b3e7f814ea04f5890bb1b361250122f [2019-01-13 23:48:48,122 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 23:48:48,123 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 23:48:48,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 23:48:48,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 23:48:48,128 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 23:48:48,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:48:48" (1/1) ... [2019-01-13 23:48:48,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b067cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:48, skipping insertion in model container [2019-01-13 23:48:48,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:48:48" (1/1) ... [2019-01-13 23:48:48,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 23:48:48,199 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 23:48:48,615 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:48:48,635 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 23:48:48,751 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:48:48,804 INFO L195 MainTranslator]: Completed translation [2019-01-13 23:48:48,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:48 WrapperNode [2019-01-13 23:48:48,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 23:48:48,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 23:48:48,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 23:48:48,807 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 23:48:48,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:48" (1/1) ... [2019-01-13 23:48:48,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:48" (1/1) ... [2019-01-13 23:48:48,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:48" (1/1) ... [2019-01-13 23:48:48,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:48" (1/1) ... [2019-01-13 23:48:48,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:48" (1/1) ... [2019-01-13 23:48:48,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:48" (1/1) ... [2019-01-13 23:48:48,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:48" (1/1) ... [2019-01-13 23:48:48,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 23:48:48,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 23:48:48,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 23:48:48,886 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 23:48:48,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:48" (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-13 23:48:48,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 23:48:48,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 23:48:48,942 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 23:48:48,943 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 23:48:48,943 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 23:48:48,943 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 23:48:48,943 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 23:48:48,943 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 23:48:48,943 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 23:48:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 23:48:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 23:48:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 23:48:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 23:48:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 23:48:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 23:48:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 23:48:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 23:48:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 23:48:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 23:48:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 23:48:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 23:48:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 23:48:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 23:48:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 23:48:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 23:48:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 23:48:48,948 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 23:48:48,949 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 23:48:48,949 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 23:48:48,949 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 23:48:48,949 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 23:48:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 23:48:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 23:48:48,950 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 23:48:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 23:48:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 23:48:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 23:48:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 23:48:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 23:48:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 23:48:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 23:48:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 23:48:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 23:48:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 23:48:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 23:48:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 23:48:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 23:48:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 23:48:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 23:48:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 23:48:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 23:48:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 23:48:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 23:48:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 23:48:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 23:48:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 23:48:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 23:48:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 23:48:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 23:48:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 23:48:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 23:48:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-13 23:48:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 23:48:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 23:48:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-13 23:48:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 23:48:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 23:48:48,958 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-13 23:48:48,959 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 23:48:48,959 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 23:48:48,960 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 23:48:48,960 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 23:48:48,960 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 23:48:48,960 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 23:48:48,960 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 23:48:48,960 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 23:48:48,960 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 23:48:48,960 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 23:48:48,961 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 23:48:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 23:48:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 23:48:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 23:48:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 23:48:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 23:48:48,963 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 23:48:48,963 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 23:48:48,963 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 23:48:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 23:48:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 23:48:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 23:48:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 23:48:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 23:48:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 23:48:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 23:48:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 23:48:48,965 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 23:48:48,966 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 23:48:48,966 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 23:48:48,966 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 23:48:48,966 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 23:48:48,966 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 23:48:48,966 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 23:48:48,967 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 23:48:48,967 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 23:48:48,967 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 23:48:48,967 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 23:48:48,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 23:48:48,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 23:48:48,967 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 23:48:48,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 23:48:48,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 23:48:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 23:48:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 23:48:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 23:48:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 23:48:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 23:48:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 23:48:50,069 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 23:48:50,070 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-13 23:48:50,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:48:50 BoogieIcfgContainer [2019-01-13 23:48:50,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 23:48:50,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 23:48:50,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 23:48:50,076 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 23:48:50,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 11:48:48" (1/3) ... [2019-01-13 23:48:50,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a8cf86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:48:50, skipping insertion in model container [2019-01-13 23:48:50,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:48:48" (2/3) ... [2019-01-13 23:48:50,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a8cf86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:48:50, skipping insertion in model container [2019-01-13 23:48:50,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:48:50" (3/3) ... [2019-01-13 23:48:50,079 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2019-01-13 23:48:50,089 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 23:48:50,098 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 52 error locations. [2019-01-13 23:48:50,116 INFO L257 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2019-01-13 23:48:50,140 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 23:48:50,141 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 23:48:50,141 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 23:48:50,141 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 23:48:50,141 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 23:48:50,141 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 23:48:50,142 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 23:48:50,142 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 23:48:50,142 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 23:48:50,160 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2019-01-13 23:48:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-13 23:48:50,169 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:50,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:48:50,173 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:48:50,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:50,179 INFO L82 PathProgramCache]: Analyzing trace with hash -250439764, now seen corresponding path program 1 times [2019-01-13 23:48:50,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:50,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:50,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:50,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:50,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:50,393 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-13 23:48:50,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:50,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 23:48:50,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 23:48:50,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 23:48:50,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 23:48:50,421 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 3 states. [2019-01-13 23:48:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:51,037 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-01-13 23:48:51,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 23:48:51,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-13 23:48:51,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:51,049 INFO L225 Difference]: With dead ends: 119 [2019-01-13 23:48:51,049 INFO L226 Difference]: Without dead ends: 115 [2019-01-13 23:48:51,051 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-13 23:48:51,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-13 23:48:51,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-01-13 23:48:51,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-13 23:48:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-01-13 23:48:51,097 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 7 [2019-01-13 23:48:51,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:51,097 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-01-13 23:48:51,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 23:48:51,098 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-01-13 23:48:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-13 23:48:51,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:51,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:48:51,099 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:48:51,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:51,100 INFO L82 PathProgramCache]: Analyzing trace with hash -250439763, now seen corresponding path program 1 times [2019-01-13 23:48:51,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:51,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:51,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:51,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:51,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:51,191 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-13 23:48:51,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:51,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 23:48:51,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 23:48:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 23:48:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 23:48:51,193 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 3 states. [2019-01-13 23:48:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:51,439 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-01-13 23:48:51,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 23:48:51,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-13 23:48:51,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:51,444 INFO L225 Difference]: With dead ends: 129 [2019-01-13 23:48:51,444 INFO L226 Difference]: Without dead ends: 129 [2019-01-13 23:48:51,445 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-13 23:48:51,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-13 23:48:51,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 116. [2019-01-13 23:48:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-13 23:48:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2019-01-13 23:48:51,460 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 7 [2019-01-13 23:48:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:51,460 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2019-01-13 23:48:51,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 23:48:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2019-01-13 23:48:51,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 23:48:51,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:51,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:48:51,462 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:48:51,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:51,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1172744574, now seen corresponding path program 1 times [2019-01-13 23:48:51,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:51,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:51,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:51,594 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-13 23:48:51,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:51,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 23:48:51,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 23:48:51,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 23:48:51,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 23:48:51,597 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 4 states. [2019-01-13 23:48:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:51,996 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2019-01-13 23:48:51,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:48:51,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-13 23:48:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:52,000 INFO L225 Difference]: With dead ends: 123 [2019-01-13 23:48:52,000 INFO L226 Difference]: Without dead ends: 123 [2019-01-13 23:48:52,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:48:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-13 23:48:52,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2019-01-13 23:48:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-13 23:48:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-01-13 23:48:52,010 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 12 [2019-01-13 23:48:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:52,010 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-01-13 23:48:52,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 23:48:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2019-01-13 23:48:52,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 23:48:52,011 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:52,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:48:52,012 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:48:52,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:52,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1172744573, now seen corresponding path program 1 times [2019-01-13 23:48:52,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:52,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:52,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:52,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:52,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:52,190 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-13 23:48:52,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:52,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 23:48:52,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 23:48:52,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 23:48:52,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:48:52,194 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 7 states. [2019-01-13 23:48:52,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:52,643 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2019-01-13 23:48:52,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:48:52,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-13 23:48:52,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:52,647 INFO L225 Difference]: With dead ends: 140 [2019-01-13 23:48:52,649 INFO L226 Difference]: Without dead ends: 140 [2019-01-13 23:48:52,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:48:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-13 23:48:52,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 117. [2019-01-13 23:48:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-13 23:48:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2019-01-13 23:48:52,659 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 12 [2019-01-13 23:48:52,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:52,659 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2019-01-13 23:48:52,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 23:48:52,660 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2019-01-13 23:48:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 23:48:52,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:52,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:48:52,661 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:48:52,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:52,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1969625224, now seen corresponding path program 1 times [2019-01-13 23:48:52,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:52,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:52,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:52,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:52,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:52,752 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-13 23:48:52,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:52,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:48:52,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:48:52,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:48:52,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:48:52,754 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 6 states. [2019-01-13 23:48:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:53,327 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2019-01-13 23:48:53,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:48:53,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-13 23:48:53,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:53,330 INFO L225 Difference]: With dead ends: 191 [2019-01-13 23:48:53,331 INFO L226 Difference]: Without dead ends: 191 [2019-01-13 23:48:53,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 23:48:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-13 23:48:53,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 116. [2019-01-13 23:48:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-13 23:48:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2019-01-13 23:48:53,340 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 15 [2019-01-13 23:48:53,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:53,341 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2019-01-13 23:48:53,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:48:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2019-01-13 23:48:53,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 23:48:53,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:53,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:48:53,342 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:48:53,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:53,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1969625223, now seen corresponding path program 1 times [2019-01-13 23:48:53,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:53,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:53,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:53,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:53,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:53,497 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-13 23:48:53,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:53,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:48:53,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:48:53,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:48:53,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:48:53,499 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 6 states. [2019-01-13 23:48:54,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:54,040 INFO L93 Difference]: Finished difference Result 194 states and 214 transitions. [2019-01-13 23:48:54,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:48:54,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-13 23:48:54,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:54,042 INFO L225 Difference]: With dead ends: 194 [2019-01-13 23:48:54,042 INFO L226 Difference]: Without dead ends: 194 [2019-01-13 23:48:54,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-13 23:48:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-13 23:48:54,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 111. [2019-01-13 23:48:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-13 23:48:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2019-01-13 23:48:54,050 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 15 [2019-01-13 23:48:54,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:54,051 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2019-01-13 23:48:54,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:48:54,051 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2019-01-13 23:48:54,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 23:48:54,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:54,052 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] [2019-01-13 23:48:54,053 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:48:54,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:54,053 INFO L82 PathProgramCache]: Analyzing trace with hash -584261800, now seen corresponding path program 1 times [2019-01-13 23:48:54,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:54,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:54,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:54,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:54,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:54,144 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-13 23:48:54,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:54,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:48:54,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:48:54,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:48:54,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:48:54,146 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 5 states. [2019-01-13 23:48:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:54,395 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2019-01-13 23:48:54,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:48:54,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-13 23:48:54,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:54,398 INFO L225 Difference]: With dead ends: 133 [2019-01-13 23:48:54,398 INFO L226 Difference]: Without dead ends: 133 [2019-01-13 23:48:54,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:48:54,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-13 23:48:54,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2019-01-13 23:48:54,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-13 23:48:54,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2019-01-13 23:48:54,404 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 21 [2019-01-13 23:48:54,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:54,405 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2019-01-13 23:48:54,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:48:54,405 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2019-01-13 23:48:54,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 23:48:54,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:54,406 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] [2019-01-13 23:48:54,406 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:48:54,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:54,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1176305992, now seen corresponding path program 1 times [2019-01-13 23:48:54,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:54,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:54,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:54,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:54,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:54,570 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-13 23:48:54,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:54,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:48:54,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:48:54,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:48:54,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:48:54,572 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 5 states. [2019-01-13 23:48:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:54,772 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2019-01-13 23:48:54,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:48:54,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-13 23:48:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:54,774 INFO L225 Difference]: With dead ends: 117 [2019-01-13 23:48:54,775 INFO L226 Difference]: Without dead ends: 117 [2019-01-13 23:48:54,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:48:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-13 23:48:54,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2019-01-13 23:48:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-13 23:48:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-01-13 23:48:54,781 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 23 [2019-01-13 23:48:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:54,782 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-01-13 23:48:54,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:48:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-01-13 23:48:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 23:48:54,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:54,783 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] [2019-01-13 23:48:54,783 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:48:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:54,784 INFO L82 PathProgramCache]: Analyzing trace with hash -653023129, now seen corresponding path program 1 times [2019-01-13 23:48:54,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:54,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:54,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:54,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:54,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:54,856 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-13 23:48:54,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:54,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:48:54,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:48:54,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:48:54,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:48:54,859 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 6 states. [2019-01-13 23:48:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:55,241 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2019-01-13 23:48:55,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:48:55,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-01-13 23:48:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:55,244 INFO L225 Difference]: With dead ends: 178 [2019-01-13 23:48:55,244 INFO L226 Difference]: Without dead ends: 178 [2019-01-13 23:48:55,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 23:48:55,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-13 23:48:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 109. [2019-01-13 23:48:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-13 23:48:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-01-13 23:48:55,250 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 23 [2019-01-13 23:48:55,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:55,250 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-01-13 23:48:55,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:48:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-01-13 23:48:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 23:48:55,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:55,251 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] [2019-01-13 23:48:55,252 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:48:55,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:55,252 INFO L82 PathProgramCache]: Analyzing trace with hash -653023128, now seen corresponding path program 1 times [2019-01-13 23:48:55,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:55,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:55,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:55,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:55,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:55,498 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-13 23:48:55,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:55,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:48:55,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:48:55,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:48:55,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:48:55,499 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 6 states. [2019-01-13 23:48:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:56,395 INFO L93 Difference]: Finished difference Result 194 states and 211 transitions. [2019-01-13 23:48:56,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:48:56,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-01-13 23:48:56,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:56,398 INFO L225 Difference]: With dead ends: 194 [2019-01-13 23:48:56,398 INFO L226 Difference]: Without dead ends: 194 [2019-01-13 23:48:56,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-13 23:48:56,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-13 23:48:56,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 101. [2019-01-13 23:48:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-13 23:48:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-01-13 23:48:56,403 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 23 [2019-01-13 23:48:56,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:56,403 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-01-13 23:48:56,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:48:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-01-13 23:48:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 23:48:56,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:56,404 INFO L402 BasicCegarLoop]: trace histogram [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-13 23:48:56,405 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:48:56,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:56,405 INFO L82 PathProgramCache]: Analyzing trace with hash -562636110, now seen corresponding path program 1 times [2019-01-13 23:48:56,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:56,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:56,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:56,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:56,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:56,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:48:56,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:48:56,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:48:56,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:48:56,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:48:56,748 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 5 states. [2019-01-13 23:48:56,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:48:56,942 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-01-13 23:48:56,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:48:56,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-01-13 23:48:56,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:48:56,946 INFO L225 Difference]: With dead ends: 115 [2019-01-13 23:48:56,946 INFO L226 Difference]: Without dead ends: 104 [2019-01-13 23:48:56,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 23:48:56,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-13 23:48:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-01-13 23:48:56,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-13 23:48:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-01-13 23:48:56,952 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 27 [2019-01-13 23:48:56,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:48:56,952 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-01-13 23:48:56,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:48:56,952 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-01-13 23:48:56,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-13 23:48:56,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:48:56,954 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-13 23:48:56,954 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:48:56,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:48:56,954 INFO L82 PathProgramCache]: Analyzing trace with hash -140383124, now seen corresponding path program 1 times [2019-01-13 23:48:56,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:48:56,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:48:56,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:56,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:56,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:48:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:57,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:48:57,212 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-13 23:48:57,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:48:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:48:57,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:48:57,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:48:57,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:48:57,520 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 21 [2019-01-13 23:48:57,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:48:57,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:57,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-01-13 23:48:57,677 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-13 23:48:57,684 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 8 treesize of output 7 [2019-01-13 23:48:57,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:48:57,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:57,697 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-13 23:48:57,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-01-13 23:48:57,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:48:57,925 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 36 treesize of output 37 [2019-01-13 23:48:57,932 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-13 23:48:57,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:48:57,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:57,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:57,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-01-13 23:48:58,051 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 60 treesize of output 50 [2019-01-13 23:48:58,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:48:58,059 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 30 treesize of output 18 [2019-01-13 23:48:58,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:48:58,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:58,075 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-13 23:48:58,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-01-13 23:48:58,286 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 36 treesize of output 24 [2019-01-13 23:48:58,293 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 19 treesize of output 10 [2019-01-13 23:48:58,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:48:58,321 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-13 23:48:58,322 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:48:58,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:48:58,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:48:58,340 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-01-13 23:48:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:48:58,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:48:58,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-01-13 23:48:58,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-13 23:48:58,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-13 23:48:58,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-01-13 23:48:58,511 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 22 states. [2019-01-13 23:48:58,801 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-01-13 23:49:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:49:00,197 INFO L93 Difference]: Finished difference Result 198 states and 211 transitions. [2019-01-13 23:49:00,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-13 23:49:00,198 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2019-01-13 23:49:00,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:49:00,200 INFO L225 Difference]: With dead ends: 198 [2019-01-13 23:49:00,200 INFO L226 Difference]: Without dead ends: 198 [2019-01-13 23:49:00,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2019-01-13 23:49:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-13 23:49:00,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 128. [2019-01-13 23:49:00,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-13 23:49:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2019-01-13 23:49:00,206 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 36 [2019-01-13 23:49:00,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:49:00,210 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2019-01-13 23:49:00,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-13 23:49:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2019-01-13 23:49:00,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-13 23:49:00,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:49:00,212 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-13 23:49:00,212 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:49:00,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:49:00,212 INFO L82 PathProgramCache]: Analyzing trace with hash -140383123, now seen corresponding path program 1 times [2019-01-13 23:49:00,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:49:00,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:49:00,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:00,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:49:00,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:49:00,527 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-01-13 23:49:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:49:00,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:49:00,679 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-13 23:49:00,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:49:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:49:00,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:49:00,745 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-13 23:49:00,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:00,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:00,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:00,771 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-13 23:49:00,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:00,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:00,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-01-13 23:49:00,814 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-13 23:49:00,817 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 8 treesize of output 7 [2019-01-13 23:49:00,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:00,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:00,844 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-13 23:49:00,848 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-13 23:49:00,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:00,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:00,861 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-13 23:49:00,862 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-01-13 23:49:00,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:00,980 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 36 treesize of output 37 [2019-01-13 23:49:00,991 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-13 23:49:00,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:01,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:01,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:01,068 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 19 treesize of output 24 [2019-01-13 23:49:01,071 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 11 [2019-01-13 23:49:01,071 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:01,079 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:01,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:01,091 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2019-01-13 23:49:01,172 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 102 treesize of output 92 [2019-01-13 23:49:01,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:01,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-01-13 23:49:01,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:01,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:01,220 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 50 treesize of output 45 [2019-01-13 23:49:01,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:01,225 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 30 treesize of output 18 [2019-01-13 23:49:01,225 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:01,234 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:01,243 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-13 23:49:01,244 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2019-01-13 23:49:01,364 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 47 treesize of output 33 [2019-01-13 23:49:01,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2019-01-13 23:49:01,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:01,414 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-13 23:49:01,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:01,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:01,586 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-13 23:49:01,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 5 treesize of output 1 [2019-01-13 23:49:01,591 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:01,599 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-13 23:49:01,599 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:01,602 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:01,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:01,608 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-01-13 23:49:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:49:01,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:49:01,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2019-01-13 23:49:01,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 23:49:01,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 23:49:01,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-01-13 23:49:01,651 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand 17 states. [2019-01-13 23:49:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:49:03,111 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2019-01-13 23:49:03,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 23:49:03,112 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-01-13 23:49:03,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:49:03,114 INFO L225 Difference]: With dead ends: 203 [2019-01-13 23:49:03,114 INFO L226 Difference]: Without dead ends: 203 [2019-01-13 23:49:03,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2019-01-13 23:49:03,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-13 23:49:03,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 130. [2019-01-13 23:49:03,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-13 23:49:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2019-01-13 23:49:03,120 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 36 [2019-01-13 23:49:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:49:03,120 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2019-01-13 23:49:03,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 23:49:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2019-01-13 23:49:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 23:49:03,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:49:03,122 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2019-01-13 23:49:03,122 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:49:03,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:49:03,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1764205122, now seen corresponding path program 1 times [2019-01-13 23:49:03,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:49:03,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:49:03,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:03,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:49:03,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:49:03,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 23:49:03,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:49:03,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 23:49:03,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 23:49:03,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 23:49:03,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 23:49:03,311 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 6 states. [2019-01-13 23:49:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:49:03,493 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2019-01-13 23:49:03,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 23:49:03,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-01-13 23:49:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:49:03,495 INFO L225 Difference]: With dead ends: 94 [2019-01-13 23:49:03,495 INFO L226 Difference]: Without dead ends: 94 [2019-01-13 23:49:03,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-13 23:49:03,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-13 23:49:03,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2019-01-13 23:49:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-13 23:49:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-01-13 23:49:03,507 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 38 [2019-01-13 23:49:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:49:03,507 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-01-13 23:49:03,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 23:49:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-01-13 23:49:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-13 23:49:03,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:49:03,509 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:49:03,509 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:49:03,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:49:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1122139694, now seen corresponding path program 1 times [2019-01-13 23:49:03,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:49:03,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:49:03,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:03,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:49:03,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:49:03,965 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2019-01-13 23:49:04,190 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-01-13 23:49:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:49:05,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:49:05,156 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-13 23:49:05,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:49:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:49:05,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:49:05,345 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-13 23:49:05,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:05,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:05,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:05,444 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-13 23:49:05,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:05,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:05,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-01-13 23:49:05,484 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-13 23:49:05,486 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 8 treesize of output 7 [2019-01-13 23:49:05,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:05,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:05,505 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-13 23:49:05,513 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-13 23:49:05,514 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:05,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:05,525 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-13 23:49:05,525 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-01-13 23:49:05,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:05,714 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 36 treesize of output 37 [2019-01-13 23:49:05,717 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-13 23:49:05,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:05,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:05,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:05,801 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 19 treesize of output 24 [2019-01-13 23:49:05,805 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 11 [2019-01-13 23:49:05,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:05,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:05,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:05,827 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2019-01-13 23:49:05,911 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 21 treesize of output 3 [2019-01-13 23:49:05,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:05,947 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 114 treesize of output 104 [2019-01-13 23:49:05,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:05,955 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 30 treesize of output 18 [2019-01-13 23:49:05,956 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:05,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:06,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2019-01-13 23:49:06,004 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-13 23:49:06,005 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:06,009 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:06,035 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 50 treesize of output 45 [2019-01-13 23:49:06,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:06,040 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 30 treesize of output 18 [2019-01-13 23:49:06,041 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:06,049 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:06,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:49:06,066 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:144, output treesize:57 [2019-01-13 23:49:06,254 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 51 treesize of output 37 [2019-01-13 23:49:06,259 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 32 treesize of output 21 [2019-01-13 23:49:06,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:06,271 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-13 23:49:06,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:06,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:06,298 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-13 23:49:06,301 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-13 23:49:06,301 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:06,315 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-13 23:49:06,316 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:06,341 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:06,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:49:06,352 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2019-01-13 23:49:06,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-13 23:49:06,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-13 23:49:06,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 23:49:06,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:49:06,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:49:06,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2019-01-13 23:49:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:49:06,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:49:06,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2019-01-13 23:49:06,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-13 23:49:06,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-13 23:49:06,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2019-01-13 23:49:06,589 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 32 states. [2019-01-13 23:49:09,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:49:09,636 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2019-01-13 23:49:09,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-13 23:49:09,638 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-01-13 23:49:09,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:49:09,639 INFO L225 Difference]: With dead ends: 125 [2019-01-13 23:49:09,639 INFO L226 Difference]: Without dead ends: 124 [2019-01-13 23:49:09,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=337, Invalid=2014, Unknown=1, NotChecked=0, Total=2352 [2019-01-13 23:49:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-13 23:49:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 84. [2019-01-13 23:49:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-13 23:49:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2019-01-13 23:49:09,644 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 40 [2019-01-13 23:49:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:49:09,644 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2019-01-13 23:49:09,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-13 23:49:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2019-01-13 23:49:09,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-13 23:49:09,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:49:09,646 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-01-13 23:49:09,646 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:49:09,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:49:09,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1646153555, now seen corresponding path program 1 times [2019-01-13 23:49:09,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:49:09,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:49:09,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:09,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:49:09,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:49:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:49:10,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:49:10,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-13 23:49:10,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:49:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:49:10,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:49:10,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:10,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:10,298 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-13 23:49:10,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-01-13 23:49:10,381 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-13 23:49:10,384 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 8 treesize of output 7 [2019-01-13 23:49:10,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,400 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-13 23:49:10,403 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-13 23:49:10,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,415 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-13 23:49:10,415 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2019-01-13 23:49:10,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:10,504 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 26 treesize of output 31 [2019-01-13 23:49:10,507 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 15 [2019-01-13 23:49:10,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:10,539 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 42 treesize of output 43 [2019-01-13 23:49:10,542 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 11 [2019-01-13 23:49:10,543 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:59 [2019-01-13 23:49:10,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2019-01-13 23:49:10,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:10,629 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 30 treesize of output 45 [2019-01-13 23:49:10,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:10,671 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 61 treesize of output 60 [2019-01-13 23:49:10,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:10,677 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 26 treesize of output 22 [2019-01-13 23:49:10,678 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,702 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:59 [2019-01-13 23:49:10,707 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-13 23:49:10,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2019-01-13 23:49:10,778 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:49:10,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 63 [2019-01-13 23:49:10,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-13 23:49:10,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:10,847 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 52 [2019-01-13 23:49:10,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-01-13 23:49:10,850 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,863 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:10,881 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-13 23:49:10,882 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:66 [2019-01-13 23:49:11,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 89 [2019-01-13 23:49:11,087 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:49:11,088 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 74 treesize of output 68 [2019-01-13 23:49:11,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:11,174 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 63 treesize of output 74 [2019-01-13 23:49:11,175 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:11,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:11,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 115 [2019-01-13 23:49:11,283 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-13 23:49:11,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 103 [2019-01-13 23:49:11,479 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:11,593 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:49:11,595 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 66 treesize of output 58 [2019-01-13 23:49:11,597 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-13 23:49:11,703 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:49:11,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 86 [2019-01-13 23:49:11,706 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:49:11,995 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2019-01-13 23:49:12,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2019-01-13 23:49:12,102 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:100, output treesize:413 [2019-01-13 23:49:12,333 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-01-13 23:49:12,602 INFO L303 Elim1Store]: Index analysis took 261 ms [2019-01-13 23:49:12,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 194 [2019-01-13 23:49:12,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:12,873 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 191 treesize of output 183 [2019-01-13 23:49:12,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:13,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:13,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 141 treesize of output 138 [2019-01-13 23:49:13,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:13,608 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 148 treesize of output 140 [2019-01-13 23:49:13,609 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:13,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:14,011 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 121 treesize of output 116 [2019-01-13 23:49:14,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:14,020 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 38 treesize of output 22 [2019-01-13 23:49:14,021 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:14,043 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:14,185 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 144 treesize of output 134 [2019-01-13 23:49:14,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:14,193 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 50 treesize of output 46 [2019-01-13 23:49:14,193 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:14,240 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:14,325 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 86 treesize of output 73 [2019-01-13 23:49:14,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:14,336 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 54 treesize of output 80 [2019-01-13 23:49:14,337 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:14,353 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:14,431 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 105 treesize of output 86 [2019-01-13 23:49:14,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:14,438 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 59 treesize of output 53 [2019-01-13 23:49:14,439 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:14,454 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:14,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-13 23:49:14,511 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:450, output treesize:216 [2019-01-13 23:49:14,866 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 112 treesize of output 100 [2019-01-13 23:49:14,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 66 [2019-01-13 23:49:14,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:15,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 55 [2019-01-13 23:49:15,006 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:15,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2019-01-13 23:49:15,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:15,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:15,362 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 65 treesize of output 55 [2019-01-13 23:49:15,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-01-13 23:49:15,390 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:15,423 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-13 23:49:15,423 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:15,437 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:15,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2019-01-13 23:49:15,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 23 treesize of output 19 [2019-01-13 23:49:15,513 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:15,543 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 24 treesize of output 18 [2019-01-13 23:49:15,543 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:15,553 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:15,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-13 23:49:15,605 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:258, output treesize:133 [2019-01-13 23:49:15,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:15,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:15,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 34 [2019-01-13 23:49:15,811 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2019-01-13 23:49:15,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:15,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2019-01-13 23:49:15,822 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:15,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:15,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:15,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:15,862 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 1 case distinctions, treesize of input 53 treesize of output 53 [2019-01-13 23:49:15,871 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 [2019-01-13 23:49:15,872 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 23:49:15,916 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 34 treesize of output 23 [2019-01-13 23:49:15,917 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:15,946 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 45 treesize of output 34 [2019-01-13 23:49:15,946 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:15,976 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 34 treesize of output 32 [2019-01-13 23:49:15,977 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:49:16,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2019-01-13 23:49:16,008 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:16,034 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 23:49:16,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-13 23:49:16,068 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:90, output treesize:41 [2019-01-13 23:49:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:49:16,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:49:16,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 34 [2019-01-13 23:49:16,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-13 23:49:16,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-13 23:49:16,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2019-01-13 23:49:16,181 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 35 states. [2019-01-13 23:49:16,960 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 39 [2019-01-13 23:49:17,286 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 61 [2019-01-13 23:49:17,686 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 63 [2019-01-13 23:49:18,047 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 50 [2019-01-13 23:49:18,616 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 68 [2019-01-13 23:49:18,939 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 49 [2019-01-13 23:49:19,212 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 54 [2019-01-13 23:49:19,422 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-01-13 23:49:19,626 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-01-13 23:49:19,835 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-01-13 23:49:20,022 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-01-13 23:49:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:49:20,281 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2019-01-13 23:49:20,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-13 23:49:20,282 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2019-01-13 23:49:20,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:49:20,284 INFO L225 Difference]: With dead ends: 159 [2019-01-13 23:49:20,284 INFO L226 Difference]: Without dead ends: 159 [2019-01-13 23:49:20,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=485, Invalid=2937, Unknown=0, NotChecked=0, Total=3422 [2019-01-13 23:49:20,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-13 23:49:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 109. [2019-01-13 23:49:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-13 23:49:20,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-01-13 23:49:20,295 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 42 [2019-01-13 23:49:20,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:49:20,296 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-01-13 23:49:20,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-13 23:49:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-01-13 23:49:20,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-13 23:49:20,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:49:20,297 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-01-13 23:49:20,299 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:49:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:49:20,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1646153556, now seen corresponding path program 1 times [2019-01-13 23:49:20,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:49:20,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:49:20,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:20,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:49:20,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:49:20,645 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-01-13 23:49:20,859 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-13 23:49:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:49:21,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:49:21,314 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-13 23:49:21,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:49:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:49:21,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:49:21,425 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-13 23:49:21,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:21,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:21,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:21,440 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-13 23:49:21,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:21,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:21,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-01-13 23:49:21,516 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-13 23:49:21,532 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 8 treesize of output 7 [2019-01-13 23:49:21,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:21,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:21,801 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-13 23:49:21,817 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-13 23:49:21,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:21,841 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,052 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-13 23:49:22,052 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-01-13 23:49:22,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:22,239 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 36 treesize of output 37 [2019-01-13 23:49:22,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2019-01-13 23:49:22,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:22,279 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 37 treesize of output 42 [2019-01-13 23:49:22,283 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 15 [2019-01-13 23:49:22,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,318 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:73 [2019-01-13 23:49:22,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:22,374 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 70 treesize of output 69 [2019-01-13 23:49:22,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:22,381 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 26 treesize of output 22 [2019-01-13 23:49:22,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2019-01-13 23:49:22,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:22,436 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 30 treesize of output 45 [2019-01-13 23:49:22,436 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,468 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:73 [2019-01-13 23:49:22,473 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 16 treesize of output 15 [2019-01-13 23:49:22,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:22,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:22,501 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-13 23:49:22,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:77 [2019-01-13 23:49:22,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:22,587 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 62 treesize of output 61 [2019-01-13 23:49:22,593 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 26 [2019-01-13 23:49:22,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:22,659 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2019-01-13 23:49:22,663 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 22 treesize of output 30 [2019-01-13 23:49:22,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,692 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-13 23:49:22,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:59 [2019-01-13 23:49:22,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:22,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:22,835 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 84 [2019-01-13 23:49:22,839 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 86 treesize of output 85 [2019-01-13 23:49:22,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:22,916 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 44 treesize of output 47 [2019-01-13 23:49:22,917 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 23:49:22,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:49:23,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:23,061 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-13 23:49:23,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, 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 15 [2019-01-13 23:49:23,065 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:23,080 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:23,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:23,087 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 83 treesize of output 84 [2019-01-13 23:49:23,090 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-13 23:49:23,090 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:23,105 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:23,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:49:23,145 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:90, output treesize:143 [2019-01-13 23:49:23,234 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 136 treesize of output 123 [2019-01-13 23:49:23,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:23,239 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 42 treesize of output 30 [2019-01-13 23:49:23,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:23,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:23,324 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 201 treesize of output 175 [2019-01-13 23:49:23,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:23,330 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 46 treesize of output 26 [2019-01-13 23:49:23,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:23,354 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:23,418 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 97 treesize of output 87 [2019-01-13 23:49:23,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:23,436 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 42 treesize of output 30 [2019-01-13 23:49:23,436 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:23,451 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:23,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:23,554 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 122 [2019-01-13 23:49:23,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:23,615 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 108 treesize of output 99 [2019-01-13 23:49:23,616 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-13 23:49:23,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:23,749 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 117 treesize of output 97 [2019-01-13 23:49:23,750 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:23,817 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:49:23,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-13 23:49:23,878 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:338, output treesize:212 [2019-01-13 23:49:24,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:24,230 INFO L303 Elim1Store]: Index analysis took 115 ms [2019-01-13 23:49:24,251 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 89 [2019-01-13 23:49:24,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2019-01-13 23:49:24,263 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-13 23:49:24,331 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 61 treesize of output 52 [2019-01-13 23:49:24,332 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,334 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 57 treesize of output 48 [2019-01-13 23:49:24,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2019-01-13 23:49:24,394 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,455 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 77 treesize of output 68 [2019-01-13 23:49:24,456 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 44 [2019-01-13 23:49:24,514 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-13 23:49:24,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-13 23:49:24,659 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 69 treesize of output 55 [2019-01-13 23:49:24,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 9 treesize of output 7 [2019-01-13 23:49:24,661 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,672 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 32 treesize of output 21 [2019-01-13 23:49:24,673 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,681 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,769 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 73 treesize of output 59 [2019-01-13 23:49:24,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2019-01-13 23:49:24,772 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-13 23:49:24,786 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,798 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2019-01-13 23:49:24,881 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 17 treesize of output 8 [2019-01-13 23:49:24,881 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-13 23:49:24,895 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,906 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2019-01-13 23:49:24,912 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-13 23:49:24,913 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,926 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 24 treesize of output 13 [2019-01-13 23:49:24,926 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,935 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 44 treesize of output 38 [2019-01-13 23:49:24,942 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-13 23:49:24,942 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,955 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-13 23:49:24,955 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:24,967 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:25,031 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 35 treesize of output 27 [2019-01-13 23:49:25,033 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 5 [2019-01-13 23:49:25,034 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:25,042 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-13 23:49:25,043 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:25,049 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:25,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2019-01-13 23:49:25,109 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 19 treesize of output 10 [2019-01-13 23:49:25,109 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:25,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-13 23:49:25,118 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:25,125 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:25,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-13 23:49:25,174 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 10 variables, input treesize:245, output treesize:56 [2019-01-13 23:49:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:49:25,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:49:25,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2019-01-13 23:49:25,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-13 23:49:25,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-13 23:49:25,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2019-01-13 23:49:25,227 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 32 states. [2019-01-13 23:49:25,996 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2019-01-13 23:49:26,596 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-01-13 23:49:26,971 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 61 [2019-01-13 23:49:27,145 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-13 23:49:27,385 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-01-13 23:49:27,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:49:27,639 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2019-01-13 23:49:27,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-13 23:49:27,641 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2019-01-13 23:49:27,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:49:27,642 INFO L225 Difference]: With dead ends: 153 [2019-01-13 23:49:27,642 INFO L226 Difference]: Without dead ends: 153 [2019-01-13 23:49:27,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2019-01-13 23:49:27,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-13 23:49:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2019-01-13 23:49:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-13 23:49:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2019-01-13 23:49:27,647 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 42 [2019-01-13 23:49:27,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:49:27,648 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2019-01-13 23:49:27,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-13 23:49:27,648 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2019-01-13 23:49:27,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 23:49:27,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:49:27,648 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:49:27,649 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:49:27,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:49:27,649 INFO L82 PathProgramCache]: Analyzing trace with hash -792234856, now seen corresponding path program 2 times [2019-01-13 23:49:27,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:49:27,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:49:27,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:27,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:49:27,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:49:27,986 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-13 23:49:27,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:49:27,986 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-13 23:49:27,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 23:49:28,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 23:49:28,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 23:49:28,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:49:28,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:28,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:28,197 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-13 23:49:28,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:28,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:28,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-01-13 23:49:28,239 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-13 23:49:28,241 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-13 23:49:28,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:28,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:28,261 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-13 23:49:28,264 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 8 treesize of output 7 [2019-01-13 23:49:28,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:28,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:28,279 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-13 23:49:28,280 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2019-01-13 23:49:28,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:28,400 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 26 treesize of output 31 [2019-01-13 23:49:28,404 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 15 [2019-01-13 23:49:28,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:28,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:28,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:28,439 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 42 treesize of output 43 [2019-01-13 23:49:28,442 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 11 [2019-01-13 23:49:28,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:28,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:28,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:28,469 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:59 [2019-01-13 23:49:28,543 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 117 treesize of output 107 [2019-01-13 23:49:28,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:28,552 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 42 treesize of output 30 [2019-01-13 23:49:28,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:28,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:28,586 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 77 treesize of output 72 [2019-01-13 23:49:28,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:28,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2019-01-13 23:49:28,591 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:28,602 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:28,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:28,618 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:49 [2019-01-13 23:49:28,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:28,942 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:49:28,944 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 0 case distinctions, treesize of input 69 treesize of output 69 [2019-01-13 23:49:28,951 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:49:28,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2019-01-13 23:49:28,953 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-13 23:49:28,968 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:49:28,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2019-01-13 23:49:28,970 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:28,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:49:29,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2019-01-13 23:49:29,012 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:49:29,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-01-13 23:49:29,013 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:29,024 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 7 [2019-01-13 23:49:29,024 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:29,029 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:29,039 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-13 23:49:29,039 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:82, output treesize:7 [2019-01-13 23:49:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:49:29,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:49:29,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2019-01-13 23:49:29,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-13 23:49:29,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-13 23:49:29,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=722, Unknown=3, NotChecked=0, Total=812 [2019-01-13 23:49:29,115 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 29 states. [2019-01-13 23:49:30,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:49:30,536 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2019-01-13 23:49:30,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 23:49:30,538 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2019-01-13 23:49:30,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:49:30,539 INFO L225 Difference]: With dead ends: 124 [2019-01-13 23:49:30,540 INFO L226 Difference]: Without dead ends: 105 [2019-01-13 23:49:30,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=205, Invalid=1273, Unknown=4, NotChecked=0, Total=1482 [2019-01-13 23:49:30,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-13 23:49:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2019-01-13 23:49:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-13 23:49:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2019-01-13 23:49:30,544 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 44 [2019-01-13 23:49:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:49:30,544 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2019-01-13 23:49:30,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-13 23:49:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2019-01-13 23:49:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 23:49:30,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:49:30,545 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:49:30,545 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:49:30,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:49:30,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1555442674, now seen corresponding path program 3 times [2019-01-13 23:49:30,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:49:30,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:49:30,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:30,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 23:49:30,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:49:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:49:30,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:49:30,998 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-13 23:49:31,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-13 23:49:31,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-13 23:49:31,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 23:49:31,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:49:31,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:31,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:31,131 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-13 23:49:31,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:31,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:31,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-01-13 23:49:31,165 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-13 23:49:31,168 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 8 treesize of output 7 [2019-01-13 23:49:31,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:31,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:31,183 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-13 23:49:31,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-01-13 23:49:31,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:31,281 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 27 treesize of output 28 [2019-01-13 23:49:31,284 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-13 23:49:31,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:31,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:31,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:31,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-01-13 23:49:31,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:31,342 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 42 treesize of output 41 [2019-01-13 23:49:31,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:31,354 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 22 treesize of output 14 [2019-01-13 23:49:31,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:31,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:31,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:31,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:31 [2019-01-13 23:49:31,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:31,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:31,382 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-13 23:49:31,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:31,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:31,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-01-13 23:49:31,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:31,477 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 34 treesize of output 33 [2019-01-13 23:49:31,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2019-01-13 23:49:31,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:31,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:31,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:31,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 [2019-01-13 23:49:31,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:31,637 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 65 [2019-01-13 23:49:31,642 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 61 treesize of output 60 [2019-01-13 23:49:31,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:31,702 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 36 treesize of output 39 [2019-01-13 23:49:31,703 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-13 23:49:31,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:49:31,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 23:49:31,779 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:83 [2019-01-13 23:49:31,877 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 79 [2019-01-13 23:49:31,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:31,902 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 61 treesize of output 73 [2019-01-13 23:49:31,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 23:49:31,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:31,972 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 70 treesize of output 54 [2019-01-13 23:49:31,972 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:32,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 23:49:32,075 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 63 treesize of output 53 [2019-01-13 23:49:32,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:32,080 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 30 treesize of output 18 [2019-01-13 23:49:32,081 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:32,092 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:32,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-01-13 23:49:32,131 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:155, output treesize:113 [2019-01-13 23:49:32,587 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2019-01-13 23:49:32,593 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:49:32,593 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 44 treesize of output 36 [2019-01-13 23:49:32,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:32,626 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 25 [2019-01-13 23:49:32,627 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:32,654 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 25 treesize of output 21 [2019-01-13 23:49:32,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:32,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:32,699 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 42 treesize of output 35 [2019-01-13 23:49:32,701 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-13 23:49:32,701 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:32,712 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:49:32,713 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 13 [2019-01-13 23:49:32,714 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:32,722 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:32,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:32,740 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:101, output treesize:5 [2019-01-13 23:49:32,770 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:49:32,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:49:32,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 31 [2019-01-13 23:49:32,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-13 23:49:32,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-13 23:49:32,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=869, Unknown=1, NotChecked=0, Total=992 [2019-01-13 23:49:32,800 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 32 states. [2019-01-13 23:49:33,838 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-13 23:49:34,176 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2019-01-13 23:49:35,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:49:35,233 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2019-01-13 23:49:35,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-13 23:49:35,235 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2019-01-13 23:49:35,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:49:35,236 INFO L225 Difference]: With dead ends: 161 [2019-01-13 23:49:35,237 INFO L226 Difference]: Without dead ends: 161 [2019-01-13 23:49:35,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=368, Invalid=2077, Unknown=5, NotChecked=0, Total=2450 [2019-01-13 23:49:35,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-13 23:49:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 122. [2019-01-13 23:49:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-13 23:49:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2019-01-13 23:49:35,244 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 45 [2019-01-13 23:49:35,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:49:35,246 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2019-01-13 23:49:35,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-13 23:49:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2019-01-13 23:49:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 23:49:35,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:49:35,253 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:49:35,253 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:49:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:49:35,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1555442675, now seen corresponding path program 2 times [2019-01-13 23:49:35,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:49:35,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:49:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:35,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 23:49:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:49:36,017 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2019-01-13 23:49:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:49:36,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:49:36,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-13 23:49:36,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 23:49:36,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 23:49:36,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 23:49:36,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:49:36,426 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-13 23:49:36,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:36,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:36,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:36,445 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 21 [2019-01-13 23:49:36,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:36,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:36,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2019-01-13 23:49:36,497 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-13 23:49:36,499 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 8 treesize of output 7 [2019-01-13 23:49:36,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:36,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:36,523 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-13 23:49:36,526 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-13 23:49:36,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:36,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:36,544 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-13 23:49:36,544 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2019-01-13 23:49:36,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:36,662 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 45 treesize of output 46 [2019-01-13 23:49:36,671 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-13 23:49:36,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:36,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:36,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:36,710 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 19 treesize of output 24 [2019-01-13 23:49:36,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 23:49:36,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:36,717 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:36,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:36,737 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:67 [2019-01-13 23:49:36,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:36,893 INFO L303 Elim1Store]: Index analysis took 108 ms [2019-01-13 23:49:36,894 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 70 [2019-01-13 23:49:36,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:36,957 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 22 treesize of output 14 [2019-01-13 23:49:36,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 44 [2019-01-13 23:49:37,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:37,354 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 26 treesize of output 37 [2019-01-13 23:49:37,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:105, output treesize:67 [2019-01-13 23:49:37,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:37,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:37,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:37,390 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2019-01-13 23:49:37,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-13 23:49:37,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:70 [2019-01-13 23:49:37,485 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-01-13 23:49:37,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2019-01-13 23:49:37,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:37,534 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 62 treesize of output 61 [2019-01-13 23:49:37,539 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 7 [2019-01-13 23:49:37,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,574 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:92, output treesize:64 [2019-01-13 23:49:37,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:37,686 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 19 treesize of output 28 [2019-01-13 23:49:37,689 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-13 23:49:37,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:37,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:37,733 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2019-01-13 23:49:37,736 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-13 23:49:37,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,777 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-13 23:49:37,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:94 [2019-01-13 23:49:37,838 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 66 treesize of output 57 [2019-01-13 23:49:37,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:37,845 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 38 treesize of output 22 [2019-01-13 23:49:37,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,895 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 97 [2019-01-13 23:49:37,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:37,900 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 38 treesize of output 22 [2019-01-13 23:49:37,901 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:37,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-13 23:49:37,938 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:185, output treesize:99 [2019-01-13 23:49:38,124 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 96 treesize of output 64 [2019-01-13 23:49:38,128 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:49:38,129 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 27 treesize of output 19 [2019-01-13 23:49:38,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:38,145 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-13 23:49:38,146 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:38,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-01-13 23:49:38,161 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-13 23:49:38,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:49:38,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 20 [2019-01-13 23:49:38,197 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:49:38,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-13 23:49:38,198 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:38,205 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-13 23:49:38,205 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:38,208 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:38,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:49:38,221 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:116, output treesize:18 [2019-01-13 23:49:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:49:38,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:49:38,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 33 [2019-01-13 23:49:38,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-13 23:49:38,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-13 23:49:38,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=974, Unknown=1, NotChecked=0, Total=1122 [2019-01-13 23:49:38,322 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 34 states. [2019-01-13 23:49:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:49:40,616 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2019-01-13 23:49:40,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 23:49:40,618 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 45 [2019-01-13 23:49:40,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:49:40,620 INFO L225 Difference]: With dead ends: 166 [2019-01-13 23:49:40,620 INFO L226 Difference]: Without dead ends: 166 [2019-01-13 23:49:40,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=350, Invalid=2001, Unknown=1, NotChecked=0, Total=2352 [2019-01-13 23:49:40,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-13 23:49:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 104. [2019-01-13 23:49:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-13 23:49:40,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-01-13 23:49:40,625 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 45 [2019-01-13 23:49:40,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:49:40,625 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-01-13 23:49:40,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-13 23:49:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-01-13 23:49:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 23:49:40,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:49:40,626 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-01-13 23:49:40,626 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:49:40,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:49:40,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2129324651, now seen corresponding path program 1 times [2019-01-13 23:49:40,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:49:40,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:49:40,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:40,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 23:49:40,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:49:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:49:41,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:49:41,092 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-13 23:49:41,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:49:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:49:41,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:49:41,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:41,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:41,235 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 21 [2019-01-13 23:49:41,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:41,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:41,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-01-13 23:49:41,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-13 23:49:41,688 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-13 23:49:41,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:41,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:41,707 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-13 23:49:41,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-13 23:49:41,709 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:41,711 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:41,724 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-13 23:49:41,725 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2019-01-13 23:49:41,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:41,846 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 36 treesize of output 37 [2019-01-13 23:49:41,848 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 11 [2019-01-13 23:49:41,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:41,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:41,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:41,881 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 37 treesize of output 42 [2019-01-13 23:49:41,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 23:49:41,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:41,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:41,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:41,910 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:70 [2019-01-13 23:49:41,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:41,966 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 70 treesize of output 69 [2019-01-13 23:49:41,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:41,973 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 26 treesize of output 22 [2019-01-13 23:49:41,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:41,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2019-01-13 23:49:42,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:42,025 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 30 treesize of output 45 [2019-01-13 23:49:42,025 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:70 [2019-01-13 23:49:42,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:42,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:42,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:42,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2019-01-13 23:49:42,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:87 [2019-01-13 23:49:42,157 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2019-01-13 23:49:42,197 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 22 treesize of output 30 [2019-01-13 23:49:42,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:42,478 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 70 treesize of output 69 [2019-01-13 23:49:42,482 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 18 treesize of output 26 [2019-01-13 23:49:42,483 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,522 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-13 23:49:42,522 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:85 [2019-01-13 23:49:42,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:42,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:42,684 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 97 [2019-01-13 23:49:42,688 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-13 23:49:42,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:42,737 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 67 treesize of output 68 [2019-01-13 23:49:42,739 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-13 23:49:42,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,774 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:120, output treesize:100 [2019-01-13 23:49:42,848 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 164 [2019-01-13 23:49:42,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:42,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2019-01-13 23:49:42,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,913 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 128 [2019-01-13 23:49:42,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:42,918 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 46 treesize of output 26 [2019-01-13 23:49:42,919 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:42,954 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-13 23:49:42,955 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:231, output treesize:121 [2019-01-13 23:49:43,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 93 [2019-01-13 23:49:43,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, 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-13 23:49:43,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:43,221 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 75 treesize of output 60 [2019-01-13 23:49:43,222 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:43,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:43,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-13 23:49:43,306 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2019-01-13 23:49:43,403 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 85 treesize of output 50 [2019-01-13 23:49:43,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-13 23:49:43,407 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-13 23:49:43,420 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 25 treesize of output 14 [2019-01-13 23:49:43,421 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:43,432 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-13 23:49:43,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:43,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:49:43,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-13 23:49:43,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2019-01-13 23:49:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:49:43,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:49:43,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2019-01-13 23:49:43,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-13 23:49:43,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-13 23:49:43,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2019-01-13 23:49:43,570 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 36 states. [2019-01-13 23:49:44,078 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-01-13 23:49:45,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:49:45,981 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2019-01-13 23:49:45,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-13 23:49:45,984 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 46 [2019-01-13 23:49:45,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:49:45,986 INFO L225 Difference]: With dead ends: 164 [2019-01-13 23:49:45,986 INFO L226 Difference]: Without dead ends: 164 [2019-01-13 23:49:45,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=327, Invalid=2025, Unknown=0, NotChecked=0, Total=2352 [2019-01-13 23:49:45,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-13 23:49:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 126. [2019-01-13 23:49:45,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-13 23:49:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2019-01-13 23:49:45,992 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 46 [2019-01-13 23:49:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:49:45,993 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2019-01-13 23:49:45,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-13 23:49:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2019-01-13 23:49:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 23:49:45,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:49:45,996 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-01-13 23:49:45,996 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:49:45,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:49:45,996 INFO L82 PathProgramCache]: Analyzing trace with hash -2129324650, now seen corresponding path program 1 times [2019-01-13 23:49:45,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:49:45,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:49:45,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:45,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:49:45,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:49:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:49:46,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:49:46,526 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-13 23:49:46,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:49:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:49:46,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:49:46,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:46,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:46,592 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 21 [2019-01-13 23:49:46,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:46,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:46,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-01-13 23:49:46,660 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-13 23:49:46,666 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 8 treesize of output 7 [2019-01-13 23:49:46,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:46,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:46,686 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-13 23:49:46,688 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-13 23:49:46,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:46,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:46,702 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-13 23:49:46,703 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-13 23:49:46,785 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 19 treesize of output 20 [2019-01-13 23:49:46,788 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 11 [2019-01-13 23:49:46,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:46,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:46,814 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 35 [2019-01-13 23:49:46,817 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 15 [2019-01-13 23:49:46,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:46,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:46,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:46,838 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:55 [2019-01-13 23:49:46,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-13 23:49:46,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:46,898 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 30 treesize of output 45 [2019-01-13 23:49:46,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:46,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:46,936 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 52 [2019-01-13 23:49:46,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:46,942 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 26 treesize of output 22 [2019-01-13 23:49:46,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:46,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:46,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:46,963 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:55 [2019-01-13 23:49:46,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:46,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:46,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:46,970 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-13 23:49:46,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:46,992 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 6 treesize of output 5 [2019-01-13 23:49:46,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2019-01-13 23:49:47,063 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 23:49:47,068 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 60 [2019-01-13 23:49:47,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2019-01-13 23:49:47,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2019-01-13 23:49:47,140 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 18 treesize of output 19 [2019-01-13 23:49:47,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,163 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-13 23:49:47,163 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:71 [2019-01-13 23:49:47,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:47,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:47,316 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 112 [2019-01-13 23:49:47,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-13 23:49:47,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:47,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:47,372 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 103 [2019-01-13 23:49:47,375 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-13 23:49:47,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,412 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:114, output treesize:94 [2019-01-13 23:49:47,476 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 199 [2019-01-13 23:49:47,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:47,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2019-01-13 23:49:47,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,538 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 127 [2019-01-13 23:49:47,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:49:47,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2019-01-13 23:49:47,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,578 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-13 23:49:47,578 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:225, output treesize:115 [2019-01-13 23:49:47,800 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 145 treesize of output 98 [2019-01-13 23:49:47,803 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-13 23:49:47,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,819 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 56 treesize of output 23 [2019-01-13 23:49:47,820 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2019-01-13 23:49:47,835 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-13 23:49:47,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 23:49:47,867 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 30 treesize of output 32 [2019-01-13 23:49:47,870 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-13 23:49:47,870 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2019-01-13 23:49:47,878 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,882 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:49:47,890 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:145, output treesize:9 [2019-01-13 23:49:47,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:49:47,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:49:47,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2019-01-13 23:49:47,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-13 23:49:47,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-13 23:49:47,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2019-01-13 23:49:47,928 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand 32 states. [2019-01-13 23:49:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:49:49,831 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2019-01-13 23:49:49,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-13 23:49:49,834 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 46 [2019-01-13 23:49:49,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:49:49,835 INFO L225 Difference]: With dead ends: 162 [2019-01-13 23:49:49,835 INFO L226 Difference]: Without dead ends: 162 [2019-01-13 23:49:49,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=232, Invalid=1838, Unknown=0, NotChecked=0, Total=2070 [2019-01-13 23:49:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-13 23:49:49,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 126. [2019-01-13 23:49:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-13 23:49:49,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2019-01-13 23:49:49,841 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 46 [2019-01-13 23:49:49,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:49:49,842 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2019-01-13 23:49:49,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-13 23:49:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2019-01-13 23:49:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-13 23:49:49,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:49:49,848 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:49:49,848 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr20REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-13 23:49:49,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:49:49,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1876553957, now seen corresponding path program 1 times [2019-01-13 23:49:49,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:49:49,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:49:49,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:49,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:49:49,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:49:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 23:49:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 23:49:49,953 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 23:49:50,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 11:49:50 BoogieIcfgContainer [2019-01-13 23:49:50,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 23:49:50,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 23:49:50,028 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 23:49:50,028 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 23:49:50,032 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:48:50" (3/4) ... [2019-01-13 23:49:50,034 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 23:49:50,103 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 23:49:50,103 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 23:49:50,104 INFO L168 Benchmark]: Toolchain (without parser) took 61982.05 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 497.5 MB). Free memory was 952.7 MB in the beginning and 865.0 MB in the end (delta: 87.7 MB). Peak memory consumption was 585.3 MB. Max. memory is 11.5 GB. [2019-01-13 23:49:50,105 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-13 23:49:50,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 681.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -148.0 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-01-13 23:49:50,105 INFO L168 Benchmark]: Boogie Preprocessor took 79.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:49:50,105 INFO L168 Benchmark]: RCFGBuilder took 1185.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. [2019-01-13 23:49:50,106 INFO L168 Benchmark]: TraceAbstraction took 59955.22 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 376.4 MB). Free memory was 1.0 GB in the beginning and 865.0 MB in the end (delta: 176.4 MB). Peak memory consumption was 552.9 MB. Max. memory is 11.5 GB. [2019-01-13 23:49:50,106 INFO L168 Benchmark]: Witness Printer took 75.32 ms. Allocated memory is still 1.5 GB. Free memory is still 865.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:49:50,108 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 681.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -148.0 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1185.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59955.22 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 376.4 MB). Free memory was 1.0 GB in the beginning and 865.0 MB in the end (delta: 176.4 MB). Peak memory consumption was 552.9 MB. Max. memory is 11.5 GB. * Witness Printer took 75.32 ms. Allocated memory is still 1.5 GB. Free memory is still 865.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={2:0}, malloc(sizeof(SLL))={2:0}] [L996] list->next = ((void*)0) VAL [list={2:0}, malloc(sizeof(SLL))={2:0}] [L997] list->colour = BLACK VAL [list={2:0}, malloc(sizeof(SLL))={2:0}] [L999] SLL* end = list; VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={2:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] end->next = malloc(sizeof(SLL)) VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1006] EXPR end->next VAL [end={2:0}, end->next={-1:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1006] end = end->next [L1007] end->next = ((void*)0) VAL [end={-1:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] end->colour = RED VAL [end={-1:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1016] end->next = malloc(sizeof(SLL)) VAL [end={-1:0}, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1017] EXPR end->next VAL [end={-1:0}, end->next={3:0}, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1017] end = end->next [L1018] end->next = ((void*)0) VAL [end={3:0}, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1019] end->colour = BLACK VAL [end={3:0}, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1028] EXPR end->colour VAL [end={2:0}, end->colour=1, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1032] EXPR end->colour VAL [end={2:0}, end->colour=1, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next VAL [end={2:0}, end->next={-1:0}, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1038] COND FALSE !(!(end->next)) [L1039] EXPR end->next VAL [end={2:0}, end->next={-1:0}, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1039] end = end->next [L1030] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1032] EXPR end->colour VAL [end={-1:0}, end->colour=0, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1032] COND TRUE RED == end->colour [L1034] EXPR end->next VAL [end={-1:0}, end->next={3:0}, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1034] end = end->next [L1035] EXPR end->next VAL [end={3:0}, end->next={0:0}, list={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1035] end = end->next [L1038] end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 118 locations, 52 error locations. UNSAFE Result, 59.8s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 28.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1283 SDtfs, 4676 SDslu, 5806 SDs, 0 SdLazy, 12252 SolverSat, 939 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 820 GetRequests, 295 SyntacticMatches, 33 SemanticMatches, 492 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 25.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=13, 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.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 869 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 29.9s InterpolantComputationTime, 1115 NumberOfCodeBlocks, 1115 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1035 ConstructedInterpolants, 175 QuantifiedInterpolants, 1343794 SizeOfPredicates, 174 NumberOfNonLiveVariables, 1942 ConjunctsInSsa, 510 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 14/155 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...