./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0232_false-valid-free.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232_false-valid-free.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer --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 1197d671a588cd166018a116686924380f8bf0f7 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 17:12:16,895 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:12:16,896 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:12:16,902 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:12:16,902 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:12:16,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:12:16,903 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:12:16,904 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:12:16,904 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:12:16,905 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:12:16,905 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:12:16,905 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:12:16,906 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:12:16,906 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:12:16,907 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:12:16,907 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:12:16,908 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:12:16,908 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:12:16,909 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:12:16,910 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:12:16,910 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:12:16,911 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:12:16,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:12:16,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:12:16,912 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:12:16,913 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:12:16,913 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:12:16,913 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:12:16,914 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:12:16,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:12:16,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:12:16,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:12:16,915 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:12:16,915 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:12:16,916 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:12:16,916 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:12:16,916 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-08 17:12:16,923 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:12:16,923 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:12:16,923 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:12:16,923 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:12:16,924 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 17:12:16,924 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 17:12:16,924 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 17:12:16,924 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:12:16,924 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:12:16,924 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 17:12:16,924 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:12:16,924 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:12:16,925 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:12:16,925 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 17:12:16,925 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 17:12:16,925 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 17:12:16,925 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:12:16,925 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:12:16,925 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 17:12:16,925 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:12:16,925 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:12:16,925 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:12:16,925 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:12:16,925 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:12:16,926 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:12:16,926 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:12:16,926 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 17:12:16,926 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:12:16,926 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer 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 -> 1197d671a588cd166018a116686924380f8bf0f7 [2018-12-08 17:12:16,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:12:16,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:12:16,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:12:16,952 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:12:16,952 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:12:16,952 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety/test-0232_false-valid-free.i [2018-12-08 17:12:16,985 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/data/653c9d4dd/b195ef9c4120470c92dc20ef2ab7e37d/FLAG6cdd5e361 [2018-12-08 17:12:17,355 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:12:17,355 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/sv-benchmarks/c/memsafety/test-0232_false-valid-free.i [2018-12-08 17:12:17,360 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/data/653c9d4dd/b195ef9c4120470c92dc20ef2ab7e37d/FLAG6cdd5e361 [2018-12-08 17:12:17,368 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/data/653c9d4dd/b195ef9c4120470c92dc20ef2ab7e37d [2018-12-08 17:12:17,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:12:17,371 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-08 17:12:17,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:12:17,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:12:17,374 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:12:17,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:12:17" (1/1) ... [2018-12-08 17:12:17,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115e7fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:12:17, skipping insertion in model container [2018-12-08 17:12:17,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:12:17" (1/1) ... [2018-12-08 17:12:17,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:12:17,404 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:12:17,549 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:12:17,553 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:12:17,616 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:12:17,637 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:12:17,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:12:17 WrapperNode [2018-12-08 17:12:17,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:12:17,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:12:17,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:12:17,638 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:12:17,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:12:17" (1/1) ... [2018-12-08 17:12:17,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:12:17" (1/1) ... [2018-12-08 17:12:17,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:12:17" (1/1) ... [2018-12-08 17:12:17,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:12:17" (1/1) ... [2018-12-08 17:12:17,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:12:17" (1/1) ... [2018-12-08 17:12:17,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:12:17" (1/1) ... [2018-12-08 17:12:17,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:12:17" (1/1) ... [2018-12-08 17:12:17,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:12:17,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:12:17,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:12:17,667 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:12:17,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:12:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/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 [2018-12-08 17:12:17,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 17:12:17,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:12:17,698 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-08 17:12:17,698 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 17:12:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-08 17:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-08 17:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-08 17:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-08 17:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-08 17:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-08 17:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-08 17:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-08 17:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-08 17:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-08 17:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-08 17:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-08 17:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-08 17:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-08 17:12:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-08 17:12:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-08 17:12:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-08 17:12:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-08 17:12:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-08 17:12:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-08 17:12:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-08 17:12:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-08 17:12:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-08 17:12:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-08 17:12:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-08 17:12:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-08 17:12:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-08 17:12:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-08 17:12:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-08 17:12:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-08 17:12:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-08 17:12:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-08 17:12:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-08 17:12:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-08 17:12:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-08 17:12:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-08 17:12:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-08 17:12:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-08 17:12:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-08 17:12:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-08 17:12:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-08 17:12:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-08 17:12:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-08 17:12:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-08 17:12:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-08 17:12:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-08 17:12:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-08 17:12:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-08 17:12:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-08 17:12:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-08 17:12:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-08 17:12:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-08 17:12:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-08 17:12:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-08 17:12:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-08 17:12:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-08 17:12:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-08 17:12:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-08 17:12:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-08 17:12:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-08 17:12:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-08 17:12:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-08 17:12:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-08 17:12:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-08 17:12:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-08 17:12:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-08 17:12:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-08 17:12:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-08 17:12:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-08 17:12:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-08 17:12:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-08 17:12:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-08 17:12:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-08 17:12:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-08 17:12:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-08 17:12:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-08 17:12:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-08 17:12:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-08 17:12:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-08 17:12:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-08 17:12:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-08 17:12:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-08 17:12:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-08 17:12:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-08 17:12:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-08 17:12:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-08 17:12:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-08 17:12:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-08 17:12:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-08 17:12:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-08 17:12:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-08 17:12:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-08 17:12:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-08 17:12:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-08 17:12:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-08 17:12:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-08 17:12:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-08 17:12:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-08 17:12:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-08 17:12:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-08 17:12:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-08 17:12:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-08 17:12:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-08 17:12:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-08 17:12:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 17:12:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 17:12:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 17:12:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 17:12:17,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 17:12:17,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 17:12:17,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 17:12:17,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:12:17,975 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:12:17,975 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-08 17:12:17,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:12:17 BoogieIcfgContainer [2018-12-08 17:12:17,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:12:17,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:12:17,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:12:17,979 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:12:17,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:12:17" (1/3) ... [2018-12-08 17:12:17,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1540dba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:12:17, skipping insertion in model container [2018-12-08 17:12:17,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:12:17" (2/3) ... [2018-12-08 17:12:17,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1540dba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:12:17, skipping insertion in model container [2018-12-08 17:12:17,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:12:17" (3/3) ... [2018-12-08 17:12:17,981 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-free.i [2018-12-08 17:12:17,990 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:12:17,997 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 51 error locations. [2018-12-08 17:12:18,012 INFO L257 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2018-12-08 17:12:18,033 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 17:12:18,034 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:12:18,034 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 17:12:18,034 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:12:18,034 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:12:18,034 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:12:18,034 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:12:18,034 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:12:18,035 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:12:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2018-12-08 17:12:18,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-08 17:12:18,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:18,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:18,056 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:18,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:18,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1830902200, now seen corresponding path program 1 times [2018-12-08 17:12:18,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:18,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:18,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:18,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:18,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:18,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:18,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:12:18,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-08 17:12:18,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 17:12:18,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 17:12:18,145 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 2 states. [2018-12-08 17:12:18,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:18,158 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-12-08 17:12:18,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 17:12:18,159 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-12-08 17:12:18,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:18,164 INFO L225 Difference]: With dead ends: 106 [2018-12-08 17:12:18,164 INFO L226 Difference]: Without dead ends: 103 [2018-12-08 17:12:18,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 17:12:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-08 17:12:18,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-08 17:12:18,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-08 17:12:18,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-12-08 17:12:18,188 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 8 [2018-12-08 17:12:18,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:18,188 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-12-08 17:12:18,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-08 17:12:18,189 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-12-08 17:12:18,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 17:12:18,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:18,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:18,189 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:18,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:18,189 INFO L82 PathProgramCache]: Analyzing trace with hash 923514391, now seen corresponding path program 1 times [2018-12-08 17:12:18,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:18,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:18,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:18,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:18,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:18,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:18,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:12:18,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:12:18,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:12:18,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:12:18,262 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 5 states. [2018-12-08 17:12:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:18,398 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-12-08 17:12:18,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:12:18,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-08 17:12:18,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:18,399 INFO L225 Difference]: With dead ends: 97 [2018-12-08 17:12:18,399 INFO L226 Difference]: Without dead ends: 97 [2018-12-08 17:12:18,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:12:18,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-08 17:12:18,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-12-08 17:12:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-08 17:12:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-12-08 17:12:18,407 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 9 [2018-12-08 17:12:18,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:18,407 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-12-08 17:12:18,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:12:18,407 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-12-08 17:12:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 17:12:18,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:18,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:18,408 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:18,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:18,408 INFO L82 PathProgramCache]: Analyzing trace with hash 923514392, now seen corresponding path program 1 times [2018-12-08 17:12:18,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:18,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:18,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:18,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:18,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:18,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:18,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:18,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:12:18,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:12:18,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:12:18,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:12:18,459 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 5 states. [2018-12-08 17:12:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:18,616 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2018-12-08 17:12:18,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:12:18,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-08 17:12:18,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:18,618 INFO L225 Difference]: With dead ends: 121 [2018-12-08 17:12:18,619 INFO L226 Difference]: Without dead ends: 121 [2018-12-08 17:12:18,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:12:18,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-08 17:12:18,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2018-12-08 17:12:18,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-08 17:12:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-12-08 17:12:18,623 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 9 [2018-12-08 17:12:18,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:18,623 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-12-08 17:12:18,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:12:18,623 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-12-08 17:12:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 17:12:18,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:18,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:18,624 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:18,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1435824870, now seen corresponding path program 1 times [2018-12-08 17:12:18,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:18,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:18,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:18,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:18,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:18,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:18,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:12:18,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:12:18,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:12:18,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:12:18,645 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 3 states. [2018-12-08 17:12:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:18,705 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-12-08 17:12:18,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:12:18,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-08 17:12:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:18,706 INFO L225 Difference]: With dead ends: 99 [2018-12-08 17:12:18,706 INFO L226 Difference]: Without dead ends: 99 [2018-12-08 17:12:18,706 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 [2018-12-08 17:12:18,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-08 17:12:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-08 17:12:18,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-08 17:12:18,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-12-08 17:12:18,711 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 10 [2018-12-08 17:12:18,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:18,711 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-12-08 17:12:18,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:12:18,712 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-12-08 17:12:18,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 17:12:18,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:18,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:18,712 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:18,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:18,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1435824871, now seen corresponding path program 1 times [2018-12-08 17:12:18,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:18,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:18,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:18,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:18,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:18,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:18,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:12:18,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:12:18,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:12:18,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:12:18,733 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 3 states. [2018-12-08 17:12:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:18,772 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-12-08 17:12:18,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:12:18,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-08 17:12:18,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:18,773 INFO L225 Difference]: With dead ends: 95 [2018-12-08 17:12:18,773 INFO L226 Difference]: Without dead ends: 95 [2018-12-08 17:12:18,773 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 [2018-12-08 17:12:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-08 17:12:18,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-08 17:12:18,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-08 17:12:18,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2018-12-08 17:12:18,776 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 10 [2018-12-08 17:12:18,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:18,776 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-12-08 17:12:18,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:12:18,776 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2018-12-08 17:12:18,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 17:12:18,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:18,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:18,777 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:18,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:18,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2128044514, now seen corresponding path program 1 times [2018-12-08 17:12:18,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:18,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:18,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:18,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:18,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:18,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:18,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:12:18,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:12:18,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:12:18,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:12:18,864 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 8 states. [2018-12-08 17:12:19,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:19,026 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2018-12-08 17:12:19,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 17:12:19,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-08 17:12:19,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:19,027 INFO L225 Difference]: With dead ends: 106 [2018-12-08 17:12:19,027 INFO L226 Difference]: Without dead ends: 106 [2018-12-08 17:12:19,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:12:19,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-08 17:12:19,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2018-12-08 17:12:19,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-08 17:12:19,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-12-08 17:12:19,033 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 15 [2018-12-08 17:12:19,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:19,034 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-12-08 17:12:19,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:12:19,034 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-12-08 17:12:19,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 17:12:19,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:19,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:19,035 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:19,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:19,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1545148638, now seen corresponding path program 1 times [2018-12-08 17:12:19,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:19,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:19,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:19,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:19,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:19,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:19,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:12:19,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:12:19,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:12:19,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:12:19,096 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 7 states. [2018-12-08 17:12:19,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:19,199 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-12-08 17:12:19,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:12:19,199 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-08 17:12:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:19,200 INFO L225 Difference]: With dead ends: 101 [2018-12-08 17:12:19,200 INFO L226 Difference]: Without dead ends: 101 [2018-12-08 17:12:19,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:12:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-08 17:12:19,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-12-08 17:12:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-08 17:12:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-12-08 17:12:19,202 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 16 [2018-12-08 17:12:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:19,203 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-12-08 17:12:19,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:12:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-12-08 17:12:19,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 17:12:19,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:19,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:19,203 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:19,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:19,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1729987530, now seen corresponding path program 1 times [2018-12-08 17:12:19,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:19,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:19,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:19,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:19,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:19,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:19,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:12:19,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:12:19,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:12:19,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:12:19,256 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 7 states. [2018-12-08 17:12:19,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:19,353 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-12-08 17:12:19,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:12:19,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-08 17:12:19,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:19,354 INFO L225 Difference]: With dead ends: 111 [2018-12-08 17:12:19,354 INFO L226 Difference]: Without dead ends: 111 [2018-12-08 17:12:19,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:12:19,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-08 17:12:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2018-12-08 17:12:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-08 17:12:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2018-12-08 17:12:19,357 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 24 [2018-12-08 17:12:19,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:19,358 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2018-12-08 17:12:19,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:12:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2018-12-08 17:12:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 17:12:19,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:19,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:19,359 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:19,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:19,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1729987531, now seen corresponding path program 1 times [2018-12-08 17:12:19,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:19,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:19,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:19,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:19,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:19,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:19,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:12:19,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:12:19,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:12:19,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:12:19,436 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 7 states. [2018-12-08 17:12:19,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:19,591 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-12-08 17:12:19,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:12:19,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-08 17:12:19,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:19,592 INFO L225 Difference]: With dead ends: 116 [2018-12-08 17:12:19,592 INFO L226 Difference]: Without dead ends: 116 [2018-12-08 17:12:19,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:12:19,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-08 17:12:19,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2018-12-08 17:12:19,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-08 17:12:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-12-08 17:12:19,595 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 24 [2018-12-08 17:12:19,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:19,595 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-12-08 17:12:19,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:12:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-12-08 17:12:19,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 17:12:19,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:19,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:19,596 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:19,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:19,597 INFO L82 PathProgramCache]: Analyzing trace with hash 393473866, now seen corresponding path program 1 times [2018-12-08 17:12:19,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:19,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:19,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:19,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:19,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:19,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:19,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:12:19,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:12:19,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:12:19,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:12:19,644 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 6 states. [2018-12-08 17:12:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:19,721 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-12-08 17:12:19,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:12:19,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-08 17:12:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:19,721 INFO L225 Difference]: With dead ends: 88 [2018-12-08 17:12:19,722 INFO L226 Difference]: Without dead ends: 88 [2018-12-08 17:12:19,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:12:19,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-08 17:12:19,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-08 17:12:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-08 17:12:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-12-08 17:12:19,724 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 26 [2018-12-08 17:12:19,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:19,724 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-12-08 17:12:19,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:12:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-12-08 17:12:19,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 17:12:19,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:19,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:19,725 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:19,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:19,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1549046728, now seen corresponding path program 1 times [2018-12-08 17:12:19,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:19,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:19,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:19,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:19,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:19,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:19,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:12:19,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:12:19,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:12:19,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:12:19,769 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 7 states. [2018-12-08 17:12:19,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:19,877 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-12-08 17:12:19,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:12:19,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-08 17:12:19,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:19,877 INFO L225 Difference]: With dead ends: 87 [2018-12-08 17:12:19,878 INFO L226 Difference]: Without dead ends: 87 [2018-12-08 17:12:19,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:12:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-08 17:12:19,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-08 17:12:19,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-08 17:12:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-12-08 17:12:19,880 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 27 [2018-12-08 17:12:19,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:19,880 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-12-08 17:12:19,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:12:19,880 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-12-08 17:12:19,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 17:12:19,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:19,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:19,881 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:19,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:19,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1549046727, now seen corresponding path program 1 times [2018-12-08 17:12:19,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:19,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:19,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:19,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:19,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:19,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:19,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:12:19,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:12:19,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:12:19,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:12:19,975 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 8 states. [2018-12-08 17:12:20,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:20,078 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-12-08 17:12:20,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:12:20,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-08 17:12:20,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:20,080 INFO L225 Difference]: With dead ends: 86 [2018-12-08 17:12:20,080 INFO L226 Difference]: Without dead ends: 86 [2018-12-08 17:12:20,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:12:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-08 17:12:20,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-08 17:12:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-08 17:12:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-12-08 17:12:20,082 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 27 [2018-12-08 17:12:20,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:20,082 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-12-08 17:12:20,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:12:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-12-08 17:12:20,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 17:12:20,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:20,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:20,083 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:20,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:20,083 INFO L82 PathProgramCache]: Analyzing trace with hash -775808307, now seen corresponding path program 1 times [2018-12-08 17:12:20,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:20,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:20,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:20,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:20,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:20,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:20,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 17:12:20,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:12:20,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:12:20,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:12:20,264 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 12 states. [2018-12-08 17:12:20,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:20,555 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-12-08 17:12:20,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 17:12:20,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-12-08 17:12:20,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:20,556 INFO L225 Difference]: With dead ends: 118 [2018-12-08 17:12:20,556 INFO L226 Difference]: Without dead ends: 118 [2018-12-08 17:12:20,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-12-08 17:12:20,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-08 17:12:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2018-12-08 17:12:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-08 17:12:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-08 17:12:20,559 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 28 [2018-12-08 17:12:20,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:20,559 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-08 17:12:20,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:12:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-08 17:12:20,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 17:12:20,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:20,560 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:20,560 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:20,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:20,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1761151540, now seen corresponding path program 1 times [2018-12-08 17:12:20,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:20,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:20,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:20,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:20,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:20,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:12:20,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/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 [2018-12-08 17:12:20,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:20,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:12:20,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:12:20,738 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 [2018-12-08 17:12:20,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:20,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:20,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:20,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-08 17:12:20,768 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 16 treesize of output 15 [2018-12-08 17:12:20,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:20,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:20,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-12-08 17:12:20,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-12-08 17:12:20,825 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 26 treesize of output 25 [2018-12-08 17:12:20,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:20,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:20,840 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. [2018-12-08 17:12:20,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-08 17:12:20,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-12-08 17:12:20,873 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 17 [2018-12-08 17:12:20,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:20,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-12-08 17:12:20,885 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:20,896 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 20 treesize of output 5 [2018-12-08 17:12:20,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:20,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:20,900 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. [2018-12-08 17:12:20,901 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-12-08 17:12:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:20,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:12:20,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2018-12-08 17:12:20,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 17:12:20,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 17:12:20,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:12:20,926 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 17 states. [2018-12-08 17:12:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:21,387 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-08 17:12:21,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 17:12:21,387 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-12-08 17:12:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:21,388 INFO L225 Difference]: With dead ends: 105 [2018-12-08 17:12:21,388 INFO L226 Difference]: Without dead ends: 105 [2018-12-08 17:12:21,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2018-12-08 17:12:21,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-08 17:12:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2018-12-08 17:12:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-08 17:12:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-12-08 17:12:21,391 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 29 [2018-12-08 17:12:21,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:21,391 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-12-08 17:12:21,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 17:12:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-12-08 17:12:21,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 17:12:21,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:21,392 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:21,392 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:21,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:21,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1761151541, now seen corresponding path program 1 times [2018-12-08 17:12:21,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:21,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:21,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:21,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:21,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:21,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:12:21,497 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/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 [2018-12-08 17:12:21,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:21,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:12:21,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:12:21,547 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 [2018-12-08 17:12:21,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,558 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 [2018-12-08 17:12:21,560 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 [2018-12-08 17:12:21,560 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-12-08 17:12:21,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:21,610 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 23 [2018-12-08 17:12:21,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:21,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:21,621 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 15 treesize of output 8 [2018-12-08 17:12:21,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-12-08 17:12:21,684 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 3 case distinctions, treesize of input 33 treesize of output 41 [2018-12-08 17:12:21,687 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 34 treesize of output 33 [2018-12-08 17:12:21,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,726 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 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-08 17:12:21,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-12-08 17:12:21,730 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,750 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. [2018-12-08 17:12:21,750 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-12-08 17:12:21,785 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 1 case distinctions, treesize of input 36 treesize of output 34 [2018-12-08 17:12:21,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-12-08 17:12:21,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,815 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 1 case distinctions, treesize of input 26 treesize of output 26 [2018-12-08 17:12:21,817 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 22 treesize of output 15 [2018-12-08 17:12:21,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,826 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 8 [2018-12-08 17:12:21,826 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-08 17:12:21,840 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,843 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:21,847 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. [2018-12-08 17:12:21,847 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-12-08 17:12:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:21,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:12:21,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2018-12-08 17:12:21,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 17:12:21,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 17:12:21,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2018-12-08 17:12:21,878 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 17 states. [2018-12-08 17:12:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:22,489 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-12-08 17:12:22,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 17:12:22,489 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-12-08 17:12:22,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:22,490 INFO L225 Difference]: With dead ends: 101 [2018-12-08 17:12:22,490 INFO L226 Difference]: Without dead ends: 101 [2018-12-08 17:12:22,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=446, Unknown=1, NotChecked=0, Total=552 [2018-12-08 17:12:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-08 17:12:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-12-08 17:12:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-08 17:12:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2018-12-08 17:12:22,492 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 29 [2018-12-08 17:12:22,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:22,492 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2018-12-08 17:12:22,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 17:12:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2018-12-08 17:12:22,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 17:12:22,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:22,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:22,492 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:22,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:22,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1719746328, now seen corresponding path program 1 times [2018-12-08 17:12:22,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:22,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:22,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:22,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:22,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:22,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:22,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 17:12:22,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:12:22,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:12:22,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:12:22,636 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 12 states. [2018-12-08 17:12:23,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:23,020 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-12-08 17:12:23,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 17:12:23,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-12-08 17:12:23,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:23,021 INFO L225 Difference]: With dead ends: 110 [2018-12-08 17:12:23,021 INFO L226 Difference]: Without dead ends: 110 [2018-12-08 17:12:23,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-12-08 17:12:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-08 17:12:23,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-12-08 17:12:23,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-08 17:12:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-12-08 17:12:23,024 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 29 [2018-12-08 17:12:23,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:23,024 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-12-08 17:12:23,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:12:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-12-08 17:12:23,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 17:12:23,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:23,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:23,025 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:23,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:23,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1772528688, now seen corresponding path program 1 times [2018-12-08 17:12:23,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:23,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:23,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:23,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:23,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:23,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:23,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 17:12:23,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 17:12:23,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 17:12:23,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:12:23,243 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 13 states. [2018-12-08 17:12:23,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:23,628 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-12-08 17:12:23,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 17:12:23,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-12-08 17:12:23,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:23,629 INFO L225 Difference]: With dead ends: 129 [2018-12-08 17:12:23,629 INFO L226 Difference]: Without dead ends: 129 [2018-12-08 17:12:23,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-12-08 17:12:23,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-08 17:12:23,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2018-12-08 17:12:23,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-08 17:12:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2018-12-08 17:12:23,632 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 30 [2018-12-08 17:12:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:23,632 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2018-12-08 17:12:23,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 17:12:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2018-12-08 17:12:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 17:12:23,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:23,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:23,633 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:23,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:23,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1772528689, now seen corresponding path program 1 times [2018-12-08 17:12:23,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:23,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:23,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:23,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:23,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:23,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:23,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:23,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:12:23,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:12:23,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:12:23,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:12:23,652 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand 3 states. [2018-12-08 17:12:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:23,683 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-12-08 17:12:23,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:12:23,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 17:12:23,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:23,683 INFO L225 Difference]: With dead ends: 110 [2018-12-08 17:12:23,683 INFO L226 Difference]: Without dead ends: 110 [2018-12-08 17:12:23,684 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 [2018-12-08 17:12:23,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-08 17:12:23,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-08 17:12:23,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-08 17:12:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2018-12-08 17:12:23,685 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 30 [2018-12-08 17:12:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:23,685 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2018-12-08 17:12:23,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:12:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-12-08 17:12:23,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 17:12:23,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:23,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:23,686 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:23,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:23,686 INFO L82 PathProgramCache]: Analyzing trace with hash -886185508, now seen corresponding path program 1 times [2018-12-08 17:12:23,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:23,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:23,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:23,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:23,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:23,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:23,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:12:23,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:12:23,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:12:23,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:12:23,714 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 6 states. [2018-12-08 17:12:23,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:23,772 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-12-08 17:12:23,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:12:23,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-08 17:12:23,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:23,773 INFO L225 Difference]: With dead ends: 109 [2018-12-08 17:12:23,773 INFO L226 Difference]: Without dead ends: 109 [2018-12-08 17:12:23,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:12:23,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-08 17:12:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-08 17:12:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-08 17:12:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-12-08 17:12:23,775 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 31 [2018-12-08 17:12:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:23,776 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-12-08 17:12:23,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:12:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-12-08 17:12:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 17:12:23,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:23,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:23,776 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:23,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:23,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1701946896, now seen corresponding path program 1 times [2018-12-08 17:12:23,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:23,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:23,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:23,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:23,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:23,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:23,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 17:12:23,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 17:12:23,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 17:12:23,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:12:23,998 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 13 states. [2018-12-08 17:12:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:24,309 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-12-08 17:12:24,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 17:12:24,310 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-12-08 17:12:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:24,310 INFO L225 Difference]: With dead ends: 117 [2018-12-08 17:12:24,310 INFO L226 Difference]: Without dead ends: 117 [2018-12-08 17:12:24,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-12-08 17:12:24,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-08 17:12:24,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2018-12-08 17:12:24,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-08 17:12:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-12-08 17:12:24,312 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 32 [2018-12-08 17:12:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:24,312 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-12-08 17:12:24,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 17:12:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-12-08 17:12:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 17:12:24,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:24,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:24,313 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:24,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:24,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1220746145, now seen corresponding path program 1 times [2018-12-08 17:12:24,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:24,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:24,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:24,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:24,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:24,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:24,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:12:24,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:12:24,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:12:24,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:12:24,361 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 8 states. [2018-12-08 17:12:24,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:24,477 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2018-12-08 17:12:24,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 17:12:24,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-12-08 17:12:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:24,478 INFO L225 Difference]: With dead ends: 116 [2018-12-08 17:12:24,478 INFO L226 Difference]: Without dead ends: 116 [2018-12-08 17:12:24,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-08 17:12:24,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-08 17:12:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-12-08 17:12:24,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-08 17:12:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2018-12-08 17:12:24,481 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 33 [2018-12-08 17:12:24,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:24,481 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2018-12-08 17:12:24,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:12:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2018-12-08 17:12:24,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 17:12:24,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:24,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:24,482 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:24,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:24,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1265757093, now seen corresponding path program 1 times [2018-12-08 17:12:24,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:24,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:24,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:24,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:24,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:25,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:25,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 17:12:25,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 17:12:25,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 17:12:25,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:12:25,021 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 17 states. [2018-12-08 17:12:25,360 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2018-12-08 17:12:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:26,552 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-12-08 17:12:26,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 17:12:26,553 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-12-08 17:12:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:26,554 INFO L225 Difference]: With dead ends: 139 [2018-12-08 17:12:26,554 INFO L226 Difference]: Without dead ends: 137 [2018-12-08 17:12:26,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-12-08 17:12:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-08 17:12:26,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 117. [2018-12-08 17:12:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-08 17:12:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-12-08 17:12:26,557 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 37 [2018-12-08 17:12:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:26,558 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-12-08 17:12:26,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 17:12:26,558 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-12-08 17:12:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 17:12:26,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:26,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:26,559 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:26,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:26,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1265757865, now seen corresponding path program 1 times [2018-12-08 17:12:26,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:26,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:26,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:26,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:26,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:26,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:12:26,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 17:12:26,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 17:12:26,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 17:12:26,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-12-08 17:12:26,816 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 16 states. [2018-12-08 17:12:27,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:27,252 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-12-08 17:12:27,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 17:12:27,252 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-12-08 17:12:27,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:27,253 INFO L225 Difference]: With dead ends: 118 [2018-12-08 17:12:27,253 INFO L226 Difference]: Without dead ends: 103 [2018-12-08 17:12:27,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2018-12-08 17:12:27,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-08 17:12:27,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-12-08 17:12:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-08 17:12:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-12-08 17:12:27,256 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 37 [2018-12-08 17:12:27,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:27,256 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-12-08 17:12:27,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 17:12:27,256 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-12-08 17:12:27,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 17:12:27,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:27,256 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:27,257 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:27,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:27,257 INFO L82 PathProgramCache]: Analyzing trace with hash 177997755, now seen corresponding path program 1 times [2018-12-08 17:12:27,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:27,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:27,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:27,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:27,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:27,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:12:27,372 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/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 [2018-12-08 17:12:27,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:27,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:12:27,427 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 [2018-12-08 17:12:27,428 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 [2018-12-08 17:12:27,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:27,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:27,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:27,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-12-08 17:12:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:27,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:12:27,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-12-08 17:12:27,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 17:12:27,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 17:12:27,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:12:27,506 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 17 states. [2018-12-08 17:12:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:27,889 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-12-08 17:12:27,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 17:12:27,890 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-12-08 17:12:27,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:27,890 INFO L225 Difference]: With dead ends: 83 [2018-12-08 17:12:27,890 INFO L226 Difference]: Without dead ends: 83 [2018-12-08 17:12:27,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2018-12-08 17:12:27,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-08 17:12:27,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-08 17:12:27,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-08 17:12:27,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-12-08 17:12:27,893 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 42 [2018-12-08 17:12:27,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:27,893 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-12-08 17:12:27,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 17:12:27,893 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-12-08 17:12:27,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 17:12:27,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:27,893 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:27,894 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:27,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:27,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1970667529, now seen corresponding path program 1 times [2018-12-08 17:12:27,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:27,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:27,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:27,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:27,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:28,441 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2018-12-08 17:12:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:28,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:12:28,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/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 [2018-12-08 17:12:28,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:28,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:12:28,569 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 [2018-12-08 17:12:28,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:28,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:28,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:12:28,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:12:28,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:12:28,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:28,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:28,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:28,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-08 17:12:28,716 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 [2018-12-08 17:12:28,718 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 [2018-12-08 17:12:28,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:28,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:28,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 43 [2018-12-08 17:12:28,738 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 28 treesize of output 27 [2018-12-08 17:12:28,738 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:28,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:28,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:28,756 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-12-08 17:12:28,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:28,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:28,783 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 15 treesize of output 8 [2018-12-08 17:12:28,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:28,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:28,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:44 [2018-12-08 17:12:29,036 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 [2018-12-08 17:12:29,039 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 [2018-12-08 17:12:29,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:29,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:29,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:29,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:135 [2018-12-08 17:12:29,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:29,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:29,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:29,235 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 24 treesize of output 29 [2018-12-08 17:12:29,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:29,252 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 67 treesize of output 91 [2018-12-08 17:12:29,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-12-08 17:12:29,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:29,256 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:12:29,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 102 [2018-12-08 17:12:29,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:29,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:29,274 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:12:29,275 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 84 treesize of output 101 [2018-12-08 17:12:29,277 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 62 treesize of output 53 [2018-12-08 17:12:29,277 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:29,284 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:29,289 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:29,298 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 74 treesize of output 64 [2018-12-08 17:12:29,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-12-08 17:12:29,300 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:12:29,311 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:12:29,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:12:29,320 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:178, output treesize:72 [2018-12-08 17:12:29,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-12-08 17:12:29,379 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 44 treesize of output 31 [2018-12-08 17:12:29,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:29,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:29,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:12:29,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:56 [2018-12-08 17:12:29,437 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 50 treesize of output 46 [2018-12-08 17:12:29,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-12-08 17:12:29,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:29,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:29,446 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:12:29,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-12-08 17:12:29,447 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:29,451 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 [2018-12-08 17:12:29,451 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:29,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:29,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:29,455 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:3 [2018-12-08 17:12:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:29,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:12:29,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 35 [2018-12-08 17:12:29,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-08 17:12:29,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-08 17:12:29,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1143, Unknown=0, NotChecked=0, Total=1260 [2018-12-08 17:12:29,478 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 36 states. [2018-12-08 17:12:30,493 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-12-08 17:12:30,714 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2018-12-08 17:12:31,309 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2018-12-08 17:12:32,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:32,286 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-12-08 17:12:32,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-08 17:12:32,287 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 45 [2018-12-08 17:12:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:32,287 INFO L225 Difference]: With dead ends: 135 [2018-12-08 17:12:32,287 INFO L226 Difference]: Without dead ends: 135 [2018-12-08 17:12:32,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=408, Invalid=3752, Unknown=0, NotChecked=0, Total=4160 [2018-12-08 17:12:32,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-08 17:12:32,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 82. [2018-12-08 17:12:32,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-08 17:12:32,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-12-08 17:12:32,290 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 45 [2018-12-08 17:12:32,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:32,290 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-12-08 17:12:32,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-08 17:12:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-12-08 17:12:32,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 17:12:32,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:32,290 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:32,290 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:32,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:32,291 INFO L82 PathProgramCache]: Analyzing trace with hash 961151324, now seen corresponding path program 1 times [2018-12-08 17:12:32,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:32,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:32,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:32,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:32,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:33,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:12:33,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/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 [2018-12-08 17:12:33,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:33,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:12:33,082 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 [2018-12-08 17:12:33,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:33,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:33,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:12:33,146 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 [2018-12-08 17:12:33,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:33,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:33,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-08 17:12:33,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:12:33,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:12:33,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:33,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:33,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:33,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-12-08 17:12:33,219 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 [2018-12-08 17:12:33,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 17:12:33,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:33,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:33,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-12-08 17:12:33,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, 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 21 [2018-12-08 17:12:33,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:33,259 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:33,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:33,265 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:44 [2018-12-08 17:12:33,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:33,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:33,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-08 17:12:33,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:33,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:33,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46 [2018-12-08 17:12:33,649 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 [2018-12-08 17:12:33,651 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 [2018-12-08 17:12:33,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:33,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:33,661 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. [2018-12-08 17:12:33,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:112 [2018-12-08 17:12:35,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:35,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:35,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:35,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:35,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 71 [2018-12-08 17:12:35,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:35,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-12-08 17:12:35,877 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 44 treesize of output 40 [2018-12-08 17:12:35,877 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:35,881 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:35,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 86 [2018-12-08 17:12:35,905 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-08 17:12:35,908 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 28 treesize of output 29 [2018-12-08 17:12:35,908 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:35,911 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:35,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:35,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:35,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 87 [2018-12-08 17:12:35,929 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 46 treesize of output 41 [2018-12-08 17:12:35,930 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:35,940 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:35,947 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:35,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:35,962 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:157, output treesize:128 [2018-12-08 17:12:36,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 17:12:36,072 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 [2018-12-08 17:12:36,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:36,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:36,085 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. [2018-12-08 17:12:36,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:137, output treesize:126 [2018-12-08 17:12:36,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:36,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:36,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 76 [2018-12-08 17:12:36,143 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2018-12-08 17:12:36,144 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 17:12:36,159 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 42 treesize of output 35 [2018-12-08 17:12:36,159 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:36,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-08 17:12:36,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:36,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 32 [2018-12-08 17:12:36,178 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:12:36,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 52 [2018-12-08 17:12:36,190 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-08 17:12:36,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2018-12-08 17:12:36,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 5 xjuncts. [2018-12-08 17:12:36,271 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:127, output treesize:177 [2018-12-08 17:12:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:36,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:12:36,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2018-12-08 17:12:36,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-08 17:12:36,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-08 17:12:36,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1491, Unknown=1, NotChecked=0, Total=1640 [2018-12-08 17:12:36,389 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 41 states. [2018-12-08 17:12:39,174 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2018-12-08 17:12:43,403 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2018-12-08 17:12:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:12:43,920 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-12-08 17:12:43,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-08 17:12:43,921 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 46 [2018-12-08 17:12:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:12:43,921 INFO L225 Difference]: With dead ends: 82 [2018-12-08 17:12:43,921 INFO L226 Difference]: Without dead ends: 82 [2018-12-08 17:12:43,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=283, Invalid=2685, Unknown=2, NotChecked=0, Total=2970 [2018-12-08 17:12:43,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-08 17:12:43,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-12-08 17:12:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-08 17:12:43,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-12-08 17:12:43,924 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 46 [2018-12-08 17:12:43,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:12:43,924 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-12-08 17:12:43,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-08 17:12:43,925 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-12-08 17:12:43,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 17:12:43,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:12:43,925 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:12:43,925 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:12:43,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:12:43,926 INFO L82 PathProgramCache]: Analyzing trace with hash -269079956, now seen corresponding path program 1 times [2018-12-08 17:12:43,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:12:43,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:12:43,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:43,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:43,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:12:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:44,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:12:44,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/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 [2018-12-08 17:12:44,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:12:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:12:44,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:12:44,639 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 [2018-12-08 17:12:44,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:44,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:44,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:12:44,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:44,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:44,719 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 [2018-12-08 17:12:44,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:44,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:44,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-12-08 17:12:44,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:12:44,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:12:44,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:44,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:44,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:44,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-08 17:12:44,792 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 3 case distinctions, treesize of input 20 treesize of output 32 [2018-12-08 17:12:44,798 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 2 case distinctions, treesize of input 18 treesize of output 26 [2018-12-08 17:12:44,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 17:12:44,815 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 17 treesize of output 16 [2018-12-08 17:12:44,815 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:44,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:12:44,838 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 [2018-12-08 17:12:44,840 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 [2018-12-08 17:12:44,840 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:44,841 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:44,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:12:44,852 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:46, output treesize:72 [2018-12-08 17:12:44,886 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 17:12:44,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:44,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:44,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:44,895 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 15 treesize of output 8 [2018-12-08 17:12:44,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:44,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:44,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:45 [2018-12-08 17:12:45,178 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 [2018-12-08 17:12:45,180 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 [2018-12-08 17:12:45,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:45,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:45,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:12:45,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:106 [2018-12-08 17:12:47,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:47,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:47,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:47,310 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 [2018-12-08 17:12:47,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:47,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-12-08 17:12:47,323 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 44 treesize of output 40 [2018-12-08 17:12:47,323 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:47,326 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:47,342 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 65 treesize of output 68 [2018-12-08 17:12:47,344 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-08 17:12:47,346 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 28 treesize of output 29 [2018-12-08 17:12:47,346 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:47,349 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:47,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:47,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:47,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-12-08 17:12:47,364 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 39 treesize of output 32 [2018-12-08 17:12:47,365 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:47,371 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:47,376 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:47,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:47,384 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:150, output treesize:80 [2018-12-08 17:12:47,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 17:12:47,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 11 treesize of output 3 [2018-12-08 17:12:47,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:47,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:47,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:47,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:94, output treesize:83 [2018-12-08 17:12:47,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:47,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:47,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 53 [2018-12-08 17:12:47,610 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2018-12-08 17:12:47,611 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 17:12:47,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-12-08 17:12:47,618 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:47,623 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 12 treesize of output 4 [2018-12-08 17:12:47,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:47,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:47,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:12:47,626 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:84, output treesize:10 [2018-12-08 17:12:47,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:12:47,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-08 17:12:47,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:12:47,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:12:47,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-12-08 17:12:47,690 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:12:47,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:12:47,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 41 [2018-12-08 17:12:47,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-08 17:12:47,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-08 17:12:47,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1575, Unknown=1, NotChecked=0, Total=1722 [2018-12-08 17:12:47,705 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 42 states. [2018-12-08 17:13:29,792 WARN L180 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2018-12-08 17:13:30,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:13:30,794 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-12-08 17:13:30,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-08 17:13:30,795 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 47 [2018-12-08 17:13:30,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:13:30,796 INFO L225 Difference]: With dead ends: 131 [2018-12-08 17:13:30,796 INFO L226 Difference]: Without dead ends: 131 [2018-12-08 17:13:30,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1667 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=527, Invalid=5015, Unknown=8, NotChecked=0, Total=5550 [2018-12-08 17:13:30,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-08 17:13:30,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 80. [2018-12-08 17:13:30,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-08 17:13:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-12-08 17:13:30,799 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 47 [2018-12-08 17:13:30,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:13:30,800 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-12-08 17:13:30,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-08 17:13:30,800 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-12-08 17:13:30,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 17:13:30,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:13:30,800 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:13:30,801 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:13:30,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:13:30,801 INFO L82 PathProgramCache]: Analyzing trace with hash -887799508, now seen corresponding path program 1 times [2018-12-08 17:13:30,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:13:30,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:13:30,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:13:30,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:13:30,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:13:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:13:31,340 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 34 [2018-12-08 17:13:31,549 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2018-12-08 17:13:31,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:13:31,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:13:31,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/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 [2018-12-08 17:13:31,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:13:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:13:31,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:13:31,806 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 [2018-12-08 17:13:31,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:13:31,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:13:31,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:13:31,894 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 [2018-12-08 17:13:31,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:13:31,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:13:31,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-08 17:13:31,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:13:31,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:13:31,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:13:31,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:13:31,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:13:31,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-12-08 17:13:31,965 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 [2018-12-08 17:13:31,967 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 [2018-12-08 17:13:31,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:13:31,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:13:31,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-12-08 17:13:31,987 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 22 treesize of output 21 [2018-12-08 17:13:31,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:13:32,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:13:32,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:13:32,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2018-12-08 17:13:32,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:13:32,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:13:32,037 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 15 treesize of output 8 [2018-12-08 17:13:32,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:13:32,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:13:32,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:41 [2018-12-08 17:13:42,271 WARN L180 SmtUtils]: Spent 528.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-08 17:14:09,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:09,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:09,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:09,266 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 28 treesize of output 21 [2018-12-08 17:14:09,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,299 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:14:09,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 102 [2018-12-08 17:14:09,308 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:14:09,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 75 [2018-12-08 17:14:09,309 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:09,319 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 57 treesize of output 82 [2018-12-08 17:14:09,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:09,329 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 69 treesize of output 58 [2018-12-08 17:14:09,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:09,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2018-12-08 17:14:09,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-12-08 17:14:09,348 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,353 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2018-12-08 17:14:09,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:09,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2018-12-08 17:14:09,358 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,364 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,365 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 17:14:09,365 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,369 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:14:09,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-12-08 17:14:09,369 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,372 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2018-12-08 17:14:09,385 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2018-12-08 17:14:09,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:09,389 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 34 treesize of output 41 [2018-12-08 17:14:09,389 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,393 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:09,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:09,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 77 [2018-12-08 17:14:09,409 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 39 treesize of output 32 [2018-12-08 17:14:09,409 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,418 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,424 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2018-12-08 17:14:09,441 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 27 treesize of output 23 [2018-12-08 17:14:09,442 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,447 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,448 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 28 treesize of output 26 [2018-12-08 17:14:09,450 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 [2018-12-08 17:14:09,450 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,453 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:14:09,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 17:14:09,469 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 5 variables, input treesize:149, output treesize:113 [2018-12-08 17:14:09,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:09,831 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 114 treesize of output 135 [2018-12-08 17:14:09,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-08 17:14:09,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:09,878 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 56 treesize of output 77 [2018-12-08 17:14:09,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 17:14:09,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-08 17:14:09,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:171, output treesize:361 [2018-12-08 17:14:10,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 57 [2018-12-08 17:14:10,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:10,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:10,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 54 [2018-12-08 17:14:10,061 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 17:14:10,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 17:14:10,132 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 49 treesize of output 43 [2018-12-08 17:14:10,134 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 24 treesize of output 15 [2018-12-08 17:14:10,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:10,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:14:10,141 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 37 treesize of output 33 [2018-12-08 17:14:10,142 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 14 treesize of output 6 [2018-12-08 17:14:10,143 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:10,148 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:14:10,237 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 127 treesize of output 123 [2018-12-08 17:14:10,239 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 15 [2018-12-08 17:14:10,239 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:10,249 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:14:10,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:10,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:10,297 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 79 [2018-12-08 17:14:10,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 10 [2018-12-08 17:14:10,299 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:10,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:10,319 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 50 [2018-12-08 17:14:10,320 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-08 17:14:10,344 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 [2018-12-08 17:14:10,344 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:10,360 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-08 17:14:10,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 133 [2018-12-08 17:14:10,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-12-08 17:14:10,433 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:10,444 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:14:10,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:10,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:10,511 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 81 [2018-12-08 17:14:10,516 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 54 [2018-12-08 17:14:10,517 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:14:10,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:14:10,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2018-12-08 17:14:10,537 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:10,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-12-08 17:14:10,545 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 17:14:10,555 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:14:10,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: 11 dim-0 vars, and 7 xjuncts. [2018-12-08 17:14:10,673 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 16 variables, input treesize:421, output treesize:219 [2018-12-08 17:14:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:14:10,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:14:10,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2018-12-08 17:14:10,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-08 17:14:10,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-08 17:14:10,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1979, Unknown=35, NotChecked=0, Total=2162 [2018-12-08 17:14:10,891 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 47 states. [2018-12-08 17:15:21,932 WARN L180 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 105 DAG size of output: 78 [2018-12-08 17:15:25,832 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2018-12-08 17:15:31,509 WARN L180 SmtUtils]: Spent 3.63 s on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2018-12-08 17:15:43,642 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 105 [2018-12-08 17:15:51,435 WARN L180 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2018-12-08 17:15:55,403 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2018-12-08 17:15:56,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:15:56,730 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2018-12-08 17:15:56,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-08 17:15:56,731 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 49 [2018-12-08 17:15:56,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:15:56,731 INFO L225 Difference]: With dead ends: 132 [2018-12-08 17:15:56,731 INFO L226 Difference]: Without dead ends: 132 [2018-12-08 17:15:56,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 88.2s TimeCoverageRelationStatistics Valid=434, Invalid=5047, Unknown=69, NotChecked=0, Total=5550 [2018-12-08 17:15:56,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-08 17:15:56,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 95. [2018-12-08 17:15:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-08 17:15:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-12-08 17:15:56,735 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 49 [2018-12-08 17:15:56,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:15:56,735 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-12-08 17:15:56,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-08 17:15:56,735 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-12-08 17:15:56,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 17:15:56,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:15:56,736 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:15:56,736 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:15:56,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:15:56,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1751980893, now seen corresponding path program 1 times [2018-12-08 17:15:56,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:15:56,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:15:56,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:15:56,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:15:56,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:15:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:15:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:15:56,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:15:56,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/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 [2018-12-08 17:15:56,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:15:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:15:56,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:15:56,840 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 [2018-12-08 17:15:56,841 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 [2018-12-08 17:15:56,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:15:56,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:15:56,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:15:56,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-08 17:15:56,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:15:56,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:15:56,851 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 15 treesize of output 8 [2018-12-08 17:15:56,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:15:56,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:15:56,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-08 17:15:56,863 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 16 treesize of output 12 [2018-12-08 17:15:56,864 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 12 treesize of output 4 [2018-12-08 17:15:56,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:15:56,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:15:56,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:15:56,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-12-08 17:15:56,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:15:56,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-08 17:15:56,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:15:56,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:15:56,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-08 17:15:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:15:56,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:15:56,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 13 [2018-12-08 17:15:56,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 17:15:56,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 17:15:56,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:15:56,900 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 14 states. [2018-12-08 17:15:57,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:15:57,072 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-12-08 17:15:57,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 17:15:57,072 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-12-08 17:15:57,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:15:57,072 INFO L225 Difference]: With dead ends: 116 [2018-12-08 17:15:57,072 INFO L226 Difference]: Without dead ends: 116 [2018-12-08 17:15:57,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-12-08 17:15:57,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-08 17:15:57,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2018-12-08 17:15:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-08 17:15:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-12-08 17:15:57,074 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 50 [2018-12-08 17:15:57,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:15:57,074 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-12-08 17:15:57,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 17:15:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-12-08 17:15:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 17:15:57,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:15:57,075 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:15:57,075 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:15:57,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:15:57,075 INFO L82 PathProgramCache]: Analyzing trace with hash 344336873, now seen corresponding path program 1 times [2018-12-08 17:15:57,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:15:57,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:15:57,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:15:57,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:15:57,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:15:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:15:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:15:57,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:15:57,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/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 [2018-12-08 17:15:57,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:15:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:15:57,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:15:57,350 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 [2018-12-08 17:15:57,351 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 [2018-12-08 17:15:57,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:15:57,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:15:57,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:15:57,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-12-08 17:16:00,591 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-08 17:16:01,536 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#t~ite6.base| Int) (append_~item~0.base Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~item~0.base (store (store (select |c_old(#memory_$Pointer$.base)| append_~item~0.base) 0 (select (select |c_old(#memory_$Pointer$.base)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|)) 4 |append_#t~ite6.base|)))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) |c_append_#in~plist.offset| append_~item~0.base))))) is different from true [2018-12-08 17:16:01,555 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 39 treesize of output 39 [2018-12-08 17:16:01,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 17:16:01,559 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 19 [2018-12-08 17:16:01,559 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-12-08 17:16:01,572 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 24 treesize of output 16 [2018-12-08 17:16:01,572 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,576 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-12-08 17:16:01,584 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-12-08 17:16:01,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:01,586 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 27 treesize of output 31 [2018-12-08 17:16:01,586 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,591 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,597 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 27 treesize of output 20 [2018-12-08 17:16:01,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:01,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-12-08 17:16:01,600 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,610 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,614 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:16:01,624 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:53, output treesize:28 [2018-12-08 17:16:01,733 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 45 treesize of output 41 [2018-12-08 17:16:01,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-12-08 17:16:01,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-12-08 17:16:01,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-12-08 17:16:01,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:16:01,758 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:86, output treesize:64 [2018-12-08 17:16:01,835 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 37 treesize of output 36 [2018-12-08 17:16:01,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,847 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 32 treesize of output 31 [2018-12-08 17:16:01,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:16:01,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:68 [2018-12-08 17:16:01,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:01,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:01,903 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 49 treesize of output 43 [2018-12-08 17:16:01,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,904 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 17:16:01,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,916 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 40 treesize of output 32 [2018-12-08 17:16:01,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-12-08 17:16:01,919 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:16:01,923 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:16:01,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:16:01,927 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:94, output treesize:27 [2018-12-08 17:16:01,962 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 27 treesize of output 23 [2018-12-08 17:16:01,963 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 14 treesize of output 6 [2018-12-08 17:16:01,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,967 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 12 treesize of output 4 [2018-12-08 17:16:01,967 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:01,970 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:4 [2018-12-08 17:16:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-08 17:16:02,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:16:02,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2018-12-08 17:16:02,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-08 17:16:02,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-08 17:16:02,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1084, Unknown=8, NotChecked=66, Total=1260 [2018-12-08 17:16:02,004 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 36 states. [2018-12-08 17:16:07,306 WARN L180 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-12-08 17:16:10,809 WARN L180 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-12-08 17:16:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:16:16,516 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-12-08 17:16:16,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-08 17:16:16,517 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 54 [2018-12-08 17:16:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:16:16,518 INFO L225 Difference]: With dead ends: 119 [2018-12-08 17:16:16,518 INFO L226 Difference]: Without dead ends: 119 [2018-12-08 17:16:16,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=335, Invalid=2958, Unknown=17, NotChecked=112, Total=3422 [2018-12-08 17:16:16,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-08 17:16:16,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2018-12-08 17:16:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-08 17:16:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-12-08 17:16:16,525 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 54 [2018-12-08 17:16:16,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:16:16,526 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-12-08 17:16:16,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-08 17:16:16,526 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-12-08 17:16:16,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 17:16:16,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:16:16,527 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:16:16,527 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:16:16,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:16:16,528 INFO L82 PathProgramCache]: Analyzing trace with hash 344337645, now seen corresponding path program 1 times [2018-12-08 17:16:16,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:16:16,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:16:16,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:16:16,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:16:16,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:16:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:16:17,238 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2018-12-08 17:16:17,623 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-12-08 17:16:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:16:18,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:16:18,148 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/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 [2018-12-08 17:16:18,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:16:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:16:18,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:16:18,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:18,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:18,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 17:16:18,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:18,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:18,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-12-08 17:16:18,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:16:18,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:16:18,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:18,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:18,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:18,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-12-08 17:16:18,318 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 [2018-12-08 17:16:18,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 17:16:18,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:18,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:18,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 32 [2018-12-08 17:16:18,337 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 21 treesize of output 20 [2018-12-08 17:16:18,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:18,352 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 2 case distinctions, treesize of input 18 treesize of output 26 [2018-12-08 17:16:18,352 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-08 17:16:18,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:16:18,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:16:18,369 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:36, output treesize:57 [2018-12-08 17:16:29,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:29,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:29,006 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 15 treesize of output 8 [2018-12-08 17:16:29,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,038 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 1 case distinctions, treesize of input 78 treesize of output 77 [2018-12-08 17:16:29,040 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-12-08 17:16:29,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:29,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 55 [2018-12-08 17:16:29,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:29,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:29,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 91 [2018-12-08 17:16:29,075 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 87 treesize of output 82 [2018-12-08 17:16:29,075 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:29,098 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:16:29,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:29,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 86 [2018-12-08 17:16:29,101 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,112 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,118 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,121 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:16:29,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 107 [2018-12-08 17:16:29,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2018-12-08 17:16:29,129 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:29,141 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 53 treesize of output 76 [2018-12-08 17:16:29,142 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:29,152 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 78 treesize of output 63 [2018-12-08 17:16:29,165 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 17:16:29,165 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:29,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 67 [2018-12-08 17:16:29,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-12-08 17:16:29,170 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:16:29,180 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:16:29,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:29,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:29,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 79 [2018-12-08 17:16:29,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-12-08 17:16:29,186 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:16:29,198 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:16:29,214 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 44 treesize of output 25 [2018-12-08 17:16:29,214 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,216 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 33 [2018-12-08 17:16:29,216 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,228 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 17:16:29,241 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 17:16:29,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-12-08 17:16:29,266 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 [2018-12-08 17:16:29,266 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,274 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,275 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 69 treesize of output 65 [2018-12-08 17:16:29,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-08 17:16:29,277 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,285 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,286 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 43 treesize of output 41 [2018-12-08 17:16:29,288 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 [2018-12-08 17:16:29,288 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,294 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:29,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 17:16:29,315 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 4 variables, input treesize:143, output treesize:147 [2018-12-08 17:16:29,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:29,815 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 2 case distinctions, treesize of input 70 treesize of output 87 [2018-12-08 17:16:29,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-08 17:16:29,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:29,861 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 2 case distinctions, treesize of input 124 treesize of output 149 [2018-12-08 17:16:29,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 17:16:29,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-12-08 17:16:29,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:195, output treesize:420 [2018-12-08 17:16:30,037 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 106 treesize of output 94 [2018-12-08 17:16:30,039 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 77 treesize of output 62 [2018-12-08 17:16:30,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:30,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:30,109 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 137 treesize of output 129 [2018-12-08 17:16:30,110 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 41 treesize of output 30 [2018-12-08 17:16:30,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:30,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:30,179 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 149 treesize of output 139 [2018-12-08 17:16:30,181 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 64 treesize of output 51 [2018-12-08 17:16:30,181 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:30,191 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:30,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 75 [2018-12-08 17:16:30,244 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 41 treesize of output 30 [2018-12-08 17:16:30,244 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:30,253 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:16:30,301 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 4 xjuncts. [2018-12-08 17:16:30,302 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:476, output treesize:388 [2018-12-08 17:16:30,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:30,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:30,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 125 [2018-12-08 17:16:30,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:30,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:30,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:30,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 79 [2018-12-08 17:16:30,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:30,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:16:30,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:155, output treesize:125 [2018-12-08 17:16:30,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:30,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:30,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:30,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:30,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 108 [2018-12-08 17:16:30,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:30,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:30,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:30,734 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 128 [2018-12-08 17:16:30,736 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-08 17:16:30,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:30,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 76 [2018-12-08 17:16:30,821 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:16:30,882 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:16:30,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-12-08 17:16:31,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-12-08 17:16:31,053 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:151, output treesize:377 [2018-12-08 17:16:35,225 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 109 DAG size of output: 50 [2018-12-08 17:16:35,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:35,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:35,233 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 70 treesize of output 65 [2018-12-08 17:16:35,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:35,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-12-08 17:16:35,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:35,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-08 17:16:35,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:16:35,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-08 17:16:35,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:35,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:16:35,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:35,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 50 [2018-12-08 17:16:35,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:35,274 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 20 treesize of output 12 [2018-12-08 17:16:35,275 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:16:35,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:16:35,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-12-08 17:16:35,282 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:16:35,286 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:16:35,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-08 17:16:35,295 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:136, output treesize:42 [2018-12-08 17:16:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:16:35,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:16:35,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2018-12-08 17:16:35,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-08 17:16:35,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-08 17:16:35,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2888, Unknown=9, NotChecked=0, Total=3080 [2018-12-08 17:16:35,399 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 56 states. [2018-12-08 17:16:57,785 WARN L180 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2018-12-08 17:16:58,678 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2018-12-08 17:16:59,011 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2018-12-08 17:17:03,720 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2018-12-08 17:17:05,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:17:05,380 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-12-08 17:17:05,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-08 17:17:05,381 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 54 [2018-12-08 17:17:05,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:17:05,382 INFO L225 Difference]: With dead ends: 128 [2018-12-08 17:17:05,382 INFO L226 Difference]: Without dead ends: 128 [2018-12-08 17:17:05,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2199 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=597, Invalid=7766, Unknown=9, NotChecked=0, Total=8372 [2018-12-08 17:17:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-08 17:17:05,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 101. [2018-12-08 17:17:05,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-08 17:17:05,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-12-08 17:17:05,388 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 54 [2018-12-08 17:17:05,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:17:05,389 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-12-08 17:17:05,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-08 17:17:05,389 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-12-08 17:17:05,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 17:17:05,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:17:05,390 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:17:05,390 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:17:05,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:17:05,390 INFO L82 PathProgramCache]: Analyzing trace with hash 344337646, now seen corresponding path program 1 times [2018-12-08 17:17:05,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:17:05,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:17:05,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:17:05,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:17:05,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:17:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:17:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:17:05,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:17:05,788 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:17:05,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:17:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:17:05,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:17:05,834 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 [2018-12-08 17:17:05,835 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 [2018-12-08 17:17:05,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:05,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:05,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:05,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-08 17:17:05,925 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 [2018-12-08 17:17:05,927 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 [2018-12-08 17:17:05,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:05,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:05,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:05,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-12-08 17:17:06,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-08 17:17:06,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:06,132 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 25 [2018-12-08 17:17:06,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:06,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:06,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:17:06,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:39 [2018-12-08 17:17:07,111 WARN L180 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-08 17:17:07,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-12-08 17:17:07,134 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 22 treesize of output 21 [2018-12-08 17:17:07,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:07,155 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 2 case distinctions, treesize of input 19 treesize of output 27 [2018-12-08 17:17:07,155 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:17:07,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:17:07,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 17:17:07,182 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:62, output treesize:109 [2018-12-08 17:17:08,634 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 42 [2018-12-08 17:17:08,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2018-12-08 17:17:08,687 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 40 treesize of output 33 [2018-12-08 17:17:08,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:08,690 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 42 [2018-12-08 17:17:08,690 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:08,696 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:08,704 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:17:08,704 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 38 treesize of output 35 [2018-12-08 17:17:08,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:08,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2018-12-08 17:17:08,708 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:08,712 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:08,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:08,724 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 66 treesize of output 62 [2018-12-08 17:17:08,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-12-08 17:17:08,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:08,729 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 39 [2018-12-08 17:17:08,729 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:08,733 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:08,744 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:17:08,745 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 49 treesize of output 48 [2018-12-08 17:17:08,747 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 29 treesize of output 22 [2018-12-08 17:17:08,747 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:08,752 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:08,758 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:08,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-12-08 17:17:08,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-08 17:17:08,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:08,783 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 17 treesize of output 23 [2018-12-08 17:17:08,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-12-08 17:17:08,787 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:08,790 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:08,793 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:08,798 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:08,810 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 2 xjuncts. [2018-12-08 17:17:08,810 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:126, output treesize:59 [2018-12-08 17:17:09,148 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 75 treesize of output 74 [2018-12-08 17:17:09,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:09,170 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 62 [2018-12-08 17:17:09,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:09,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:17:09,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:139, output treesize:137 [2018-12-08 17:17:09,260 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 17:17:09,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:09,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:09,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:09,264 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 95 treesize of output 89 [2018-12-08 17:17:09,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:09,297 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 79 treesize of output 67 [2018-12-08 17:17:09,300 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 55 [2018-12-08 17:17:09,300 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:17:09,306 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:17:09,316 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:17:09,317 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 49 treesize of output 55 [2018-12-08 17:17:09,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2018-12-08 17:17:09,319 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:09,324 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:09,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:17:09,330 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:179, output treesize:46 [2018-12-08 17:17:09,377 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 28 treesize of output 24 [2018-12-08 17:17:09,378 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 7 [2018-12-08 17:17:09,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:09,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 17:17:09,383 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:09,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:09,390 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 26 treesize of output 22 [2018-12-08 17:17:09,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 17:17:09,391 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:09,395 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 [2018-12-08 17:17:09,395 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:09,396 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:09,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:09,399 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:57, output treesize:9 [2018-12-08 17:17:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:17:09,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 17:17:09,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [19] total 39 [2018-12-08 17:17:09,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-08 17:17:09,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-08 17:17:09,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1435, Unknown=1, NotChecked=0, Total=1560 [2018-12-08 17:17:09,454 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 40 states. [2018-12-08 17:17:12,848 WARN L180 SmtUtils]: Spent 922.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2018-12-08 17:17:14,251 WARN L180 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2018-12-08 17:17:21,837 WARN L180 SmtUtils]: Spent 6.58 s on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2018-12-08 17:17:26,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:17:26,041 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-12-08 17:17:26,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-08 17:17:26,042 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 54 [2018-12-08 17:17:26,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:17:26,043 INFO L225 Difference]: With dead ends: 126 [2018-12-08 17:17:26,043 INFO L226 Difference]: Without dead ends: 126 [2018-12-08 17:17:26,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=402, Invalid=4015, Unknown=5, NotChecked=0, Total=4422 [2018-12-08 17:17:26,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-08 17:17:26,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 103. [2018-12-08 17:17:26,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-08 17:17:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2018-12-08 17:17:26,046 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 54 [2018-12-08 17:17:26,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:17:26,046 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2018-12-08 17:17:26,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-08 17:17:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2018-12-08 17:17:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 17:17:26,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:17:26,047 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:17:26,047 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:17:26,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:17:26,048 INFO L82 PathProgramCache]: Analyzing trace with hash -626068770, now seen corresponding path program 1 times [2018-12-08 17:17:26,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:17:26,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:17:26,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:17:26,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:17:26,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:17:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:17:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:17:26,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:17:26,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:17:26,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:17:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:17:26,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:17:26,315 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 [2018-12-08 17:17:26,316 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 [2018-12-08 17:17:26,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:26,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:26,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:26,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-08 17:17:28,041 WARN L180 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-08 17:17:28,046 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 [2018-12-08 17:17:28,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 17:17:28,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:28,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:28,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:17:28,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:67 [2018-12-08 17:17:28,933 WARN L180 SmtUtils]: Spent 853.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-08 17:17:28,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:28,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:28,962 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 15 treesize of output 8 [2018-12-08 17:17:28,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:28,973 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 42 treesize of output 46 [2018-12-08 17:17:28,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-12-08 17:17:28,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:28,978 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 39 [2018-12-08 17:17:28,978 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:28,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:28,990 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:17:28,990 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 49 treesize of output 48 [2018-12-08 17:17:28,995 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 29 treesize of output 22 [2018-12-08 17:17:28,995 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:29,000 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:29,004 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:29,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:29,009 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:82, output treesize:30 [2018-12-08 17:17:29,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-12-08 17:17:29,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-12-08 17:17:29,102 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:17:29,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:17:29,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:17:29,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:33 [2018-12-08 17:17:29,178 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:17:29,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2018-12-08 17:17:29,181 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 31 treesize of output 22 [2018-12-08 17:17:29,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:29,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:29,188 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. [2018-12-08 17:17:29,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2018-12-08 17:17:29,214 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 26 treesize of output 22 [2018-12-08 17:17:29,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 17:17:29,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:29,219 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 [2018-12-08 17:17:29,220 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:29,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:29,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:29,222 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-12-08 17:17:29,240 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:17:29,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:17:29,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 32 [2018-12-08 17:17:29,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-08 17:17:29,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-08 17:17:29,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=926, Unknown=3, NotChecked=0, Total=1056 [2018-12-08 17:17:29,255 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand 33 states. [2018-12-08 17:17:34,761 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-12-08 17:17:39,756 WARN L180 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-08 17:17:40,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:17:40,178 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-12-08 17:17:40,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-08 17:17:40,178 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 58 [2018-12-08 17:17:40,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:17:40,179 INFO L225 Difference]: With dead ends: 122 [2018-12-08 17:17:40,179 INFO L226 Difference]: Without dead ends: 122 [2018-12-08 17:17:40,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=317, Invalid=2329, Unknown=6, NotChecked=0, Total=2652 [2018-12-08 17:17:40,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-08 17:17:40,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2018-12-08 17:17:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-08 17:17:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2018-12-08 17:17:40,183 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 58 [2018-12-08 17:17:40,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:17:40,184 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2018-12-08 17:17:40,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-08 17:17:40,184 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2018-12-08 17:17:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 17:17:40,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:17:40,184 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:17:40,185 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:17:40,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:17:40,185 INFO L82 PathProgramCache]: Analyzing trace with hash -626080717, now seen corresponding path program 1 times [2018-12-08 17:17:40,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:17:40,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:17:40,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:17:40,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:17:40,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:17:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:17:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 17:17:40,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:17:40,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:17:40,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:17:40,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:17:40,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:17:40,216 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand 5 states. [2018-12-08 17:17:40,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:17:40,282 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-12-08 17:17:40,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:17:40,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-12-08 17:17:40,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:17:40,283 INFO L225 Difference]: With dead ends: 116 [2018-12-08 17:17:40,283 INFO L226 Difference]: Without dead ends: 116 [2018-12-08 17:17:40,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:17:40,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-08 17:17:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2018-12-08 17:17:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-08 17:17:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2018-12-08 17:17:40,284 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 58 [2018-12-08 17:17:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:17:40,285 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2018-12-08 17:17:40,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:17:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2018-12-08 17:17:40,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 17:17:40,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:17:40,285 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:17:40,285 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:17:40,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:17:40,285 INFO L82 PathProgramCache]: Analyzing trace with hash -626080716, now seen corresponding path program 1 times [2018-12-08 17:17:40,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:17:40,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:17:40,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:17:40,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:17:40,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:17:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:17:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:17:40,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:17:40,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:17:40,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:17:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:17:40,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:17:40,949 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 [2018-12-08 17:17:40,950 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 [2018-12-08 17:17:40,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:40,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:40,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:40,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-08 17:17:41,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2018-12-08 17:17:41,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2018-12-08 17:17:41,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:41,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:41,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:41,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-12-08 17:17:41,220 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 29 treesize of output 24 [2018-12-08 17:17:41,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:41,227 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 24 treesize of output 31 [2018-12-08 17:17:41,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:41,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:41,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:17:41,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:45 [2018-12-08 17:17:42,318 WARN L180 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-12-08 17:17:42,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2018-12-08 17:17:42,338 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 28 treesize of output 27 [2018-12-08 17:17:42,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:42,359 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 2 case distinctions, treesize of input 25 treesize of output 33 [2018-12-08 17:17:42,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:17:42,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:17:42,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 17:17:42,388 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:121 [2018-12-08 17:17:43,639 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 44 [2018-12-08 17:17:43,691 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 50 treesize of output 41 [2018-12-08 17:17:43,693 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 31 treesize of output 27 [2018-12-08 17:17:43,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:43,696 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 17 treesize of output 23 [2018-12-08 17:17:43,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-12-08 17:17:43,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:43,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:43,706 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:43,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:43,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 67 [2018-12-08 17:17:43,754 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 57 treesize of output 48 [2018-12-08 17:17:43,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:43,758 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 42 [2018-12-08 17:17:43,758 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:43,764 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:43,772 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:17:43,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-12-08 17:17:43,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:43,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2018-12-08 17:17:43,776 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:43,780 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:43,785 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:43,789 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 72 treesize of output 68 [2018-12-08 17:17:43,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-12-08 17:17:43,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:43,794 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 39 [2018-12-08 17:17:43,794 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:43,798 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:43,809 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:17:43,809 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 68 treesize of output 65 [2018-12-08 17:17:43,811 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 46 treesize of output 37 [2018-12-08 17:17:43,811 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:43,817 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:43,823 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:43,842 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 2 xjuncts. [2018-12-08 17:17:43,842 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:138, output treesize:63 [2018-12-08 17:17:44,230 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 77 treesize of output 76 [2018-12-08 17:17:44,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:44,254 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 65 treesize of output 64 [2018-12-08 17:17:44,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:44,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:17:44,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:143, output treesize:141 [2018-12-08 17:17:44,347 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 17:17:44,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:44,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:44,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:44,351 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 97 treesize of output 91 [2018-12-08 17:17:44,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:44,392 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 81 treesize of output 69 [2018-12-08 17:17:44,394 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 68 treesize of output 57 [2018-12-08 17:17:44,395 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:17:44,402 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:17:44,412 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:17:44,413 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 49 treesize of output 55 [2018-12-08 17:17:44,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2018-12-08 17:17:44,415 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:44,420 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:44,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:17:44,426 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:183, output treesize:48 [2018-12-08 17:17:44,579 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 28 treesize of output 24 [2018-12-08 17:17:44,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 17:17:44,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:44,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 17:17:44,586 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:44,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:44,594 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 26 treesize of output 22 [2018-12-08 17:17:44,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 17:17:44,596 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:44,600 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 [2018-12-08 17:17:44,600 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:44,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:44,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:44,604 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:57, output treesize:9 [2018-12-08 17:17:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:17:44,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 17:17:44,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [21] total 42 [2018-12-08 17:17:44,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-08 17:17:44,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-08 17:17:44,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1667, Unknown=1, NotChecked=0, Total=1806 [2018-12-08 17:17:44,663 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 43 states. [2018-12-08 17:17:45,220 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-12-08 17:17:45,762 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-12-08 17:17:48,991 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2018-12-08 17:17:50,468 WARN L180 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-08 17:17:53,209 WARN L180 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-12-08 17:17:56,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:17:56,707 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-12-08 17:17:56,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-08 17:17:56,707 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 58 [2018-12-08 17:17:56,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:17:56,707 INFO L225 Difference]: With dead ends: 122 [2018-12-08 17:17:56,707 INFO L226 Difference]: Without dead ends: 122 [2018-12-08 17:17:56,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=436, Invalid=4529, Unknown=5, NotChecked=0, Total=4970 [2018-12-08 17:17:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-08 17:17:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 111. [2018-12-08 17:17:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-08 17:17:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-12-08 17:17:56,709 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 58 [2018-12-08 17:17:56,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:17:56,709 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-12-08 17:17:56,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-08 17:17:56,709 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-12-08 17:17:56,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 17:17:56,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:17:56,710 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:17:56,710 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:17:56,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:17:56,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2066704733, now seen corresponding path program 1 times [2018-12-08 17:17:56,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:17:56,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:17:56,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:17:56,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:17:56,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:17:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:17:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 17:17:56,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:17:56,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:17:56,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:17:56,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:17:56,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:17:56,739 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 5 states. [2018-12-08 17:17:56,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:17:56,801 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-12-08 17:17:56,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:17:56,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-12-08 17:17:56,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:17:56,802 INFO L225 Difference]: With dead ends: 115 [2018-12-08 17:17:56,802 INFO L226 Difference]: Without dead ends: 115 [2018-12-08 17:17:56,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:17:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-08 17:17:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-12-08 17:17:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-08 17:17:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2018-12-08 17:17:56,804 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 59 [2018-12-08 17:17:56,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:17:56,804 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2018-12-08 17:17:56,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:17:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2018-12-08 17:17:56,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 17:17:56,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:17:56,805 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:17:56,805 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:17:56,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:17:56,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2066334302, now seen corresponding path program 1 times [2018-12-08 17:17:56,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:17:56,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:17:56,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:17:56,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:17:56,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:17:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:17:58,206 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:17:58,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:17:58,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:17:58,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:17:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:17:58,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:17:58,253 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 [2018-12-08 17:17:58,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:58,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:58,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:17:58,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:17:58,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:17:58,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:58,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:58,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:58,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-08 17:17:58,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-12-08 17:17:58,395 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 20 treesize of output 19 [2018-12-08 17:17:58,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:58,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:58,436 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 [2018-12-08 17:17:58,437 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 [2018-12-08 17:17:58,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:58,438 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:58,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:58,444 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:37 [2018-12-08 17:17:58,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:58,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:17:58,474 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 15 treesize of output 8 [2018-12-08 17:17:58,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:17:58,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:17:58,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:39 [2018-12-08 17:18:04,501 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 38 [2018-12-08 17:18:18,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:18,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:18,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-08 17:18:18,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:18,802 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 67 treesize of output 55 [2018-12-08 17:18:18,804 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-12-08 17:18:18,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:18,808 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 42 treesize of output 50 [2018-12-08 17:18:18,808 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:18,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:18:18,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:18,838 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 38 treesize of output 29 [2018-12-08 17:18:18,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:18,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-08 17:18:18,842 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:18:18,848 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:18:18,858 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:18:18,865 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 58 treesize of output 58 [2018-12-08 17:18:18,867 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 17:18:18,871 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 19 [2018-12-08 17:18:18,871 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:18,876 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:18:18,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:18,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:18,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 59 [2018-12-08 17:18:18,901 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 48 treesize of output 43 [2018-12-08 17:18:18,901 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:18,910 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:18:18,920 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:18:18,959 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 17:18:18,959 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:18,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 72 [2018-12-08 17:18:18,967 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 40 treesize of output 33 [2018-12-08 17:18:18,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:18,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 42 [2018-12-08 17:18:18,971 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:18,976 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:18:18,989 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:18:18,990 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 50 [2018-12-08 17:18:18,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:18,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2018-12-08 17:18:18,994 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,000 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,006 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,014 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 79 treesize of output 83 [2018-12-08 17:18:19,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-12-08 17:18:19,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:19,019 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 39 [2018-12-08 17:18:19,019 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,023 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:19,039 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:18:19,040 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 60 treesize of output 79 [2018-12-08 17:18:19,042 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 29 treesize of output 22 [2018-12-08 17:18:19,042 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,049 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,058 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:18:19,078 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 6 variables, input treesize:126, output treesize:99 [2018-12-08 17:18:19,545 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 105 treesize of output 104 [2018-12-08 17:18:19,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,571 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 69 treesize of output 68 [2018-12-08 17:18:19,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:18:19,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:175, output treesize:173 [2018-12-08 17:18:19,676 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 17:18:19,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:19,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:19,680 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 125 treesize of output 119 [2018-12-08 17:18:19,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:19,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:19,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:19,699 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 107 [2018-12-08 17:18:19,712 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 112 [2018-12-08 17:18:19,713 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-08 17:18:19,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-08 17:18:19,815 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:18:19,818 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 80 treesize of output 82 [2018-12-08 17:18:19,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2018-12-08 17:18:19,820 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,827 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:19,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:19,832 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:18:19,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 104 [2018-12-08 17:18:19,837 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 54 treesize of output 41 [2018-12-08 17:18:19,837 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,847 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:19,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:18:19,853 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:18:19,854 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 124 treesize of output 152 [2018-12-08 17:18:19,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, 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 61 [2018-12-08 17:18:19,856 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,866 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:18:19,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-08 17:18:19,952 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:215, output treesize:241 [2018-12-08 17:18:20,441 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 46 treesize of output 38 [2018-12-08 17:18:20,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 17:18:20,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:20,449 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 27 treesize of output 16 [2018-12-08 17:18:20,449 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:20,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:18:20,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:18:20,461 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:75, output treesize:45 [2018-12-08 17:18:20,512 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 39 treesize of output 39 [2018-12-08 17:18:20,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 17:18:20,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:20,520 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 5 [2018-12-08 17:18:20,520 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:20,523 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 [2018-12-08 17:18:20,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:18:20,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:18:20,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:18:20,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:3 [2018-12-08 17:18:20,544 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:18:20,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:18:20,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 46 [2018-12-08 17:18:20,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-08 17:18:20,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-08 17:18:20,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1993, Unknown=14, NotChecked=0, Total=2162 [2018-12-08 17:18:20,560 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 47 states. [2018-12-08 17:18:44,011 WARN L180 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-12-08 17:18:46,613 WARN L180 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-12-08 17:18:52,107 WARN L180 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-12-08 17:19:06,928 WARN L180 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2018-12-08 17:19:11,105 WARN L180 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2018-12-08 17:19:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:19:13,120 INFO L93 Difference]: Finished difference Result 192 states and 203 transitions. [2018-12-08 17:19:13,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-08 17:19:13,121 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 59 [2018-12-08 17:19:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:19:13,122 INFO L225 Difference]: With dead ends: 192 [2018-12-08 17:19:13,122 INFO L226 Difference]: Without dead ends: 192 [2018-12-08 17:19:13,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1442 ImplicationChecksByTransitivity, 41.8s TimeCoverageRelationStatistics Valid=473, Invalid=5060, Unknown=17, NotChecked=0, Total=5550 [2018-12-08 17:19:13,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-08 17:19:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 119. [2018-12-08 17:19:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-08 17:19:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2018-12-08 17:19:13,125 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 59 [2018-12-08 17:19:13,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:19:13,125 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2018-12-08 17:19:13,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-08 17:19:13,125 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2018-12-08 17:19:13,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 17:19:13,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:19:13,126 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:19:13,126 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:19:13,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:19:13,126 INFO L82 PathProgramCache]: Analyzing trace with hash -356662591, now seen corresponding path program 1 times [2018-12-08 17:19:13,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:19:13,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:19:13,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:19:13,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:19:13,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:19:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:19:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:19:13,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:19:13,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:19:13,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:19:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:19:13,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:19:13,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 6 treesize of output 5 [2018-12-08 17:19:13,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:19:13,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:19:13,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:19:13,551 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 [2018-12-08 17:19:13,552 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 [2018-12-08 17:19:13,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:19:13,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:19:13,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:19:13,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-12-08 17:19:13,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:19:13,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:19:13,575 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 15 treesize of output 8 [2018-12-08 17:19:13,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:19:13,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:19:13,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-12-08 17:19:15,744 WARN L180 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-08 17:19:24,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:19:24,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:19:24,080 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 [2018-12-08 17:19:24,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:19:24,090 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 35 treesize of output 39 [2018-12-08 17:19:24,091 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 17:19:24,093 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 19 [2018-12-08 17:19:24,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:19:24,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:19:24,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-12-08 17:19:24,106 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 24 treesize of output 16 [2018-12-08 17:19:24,107 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:19:24,110 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:19:24,113 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:19:24,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:19:24,117 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:16 [2018-12-08 17:19:24,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-08 17:19:24,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-12-08 17:19:24,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:19:24,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:19:24,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:19:24,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:27 [2018-12-08 17:19:24,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:19:24,260 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 32 treesize of output 32 [2018-12-08 17:19:24,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-12-08 17:19:24,263 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:19:24,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:19:24,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:19:24,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:32 [2018-12-08 17:19:24,309 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 27 treesize of output 23 [2018-12-08 17:19:24,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 17:19:24,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:19:24,314 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 12 treesize of output 4 [2018-12-08 17:19:24,315 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:19:24,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:19:24,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:19:24,319 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:36, output treesize:10 [2018-12-08 17:19:24,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:19:24,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-08 17:19:24,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:19:24,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:19:24,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-08 17:19:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:19:24,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:19:24,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 39 [2018-12-08 17:19:24,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-08 17:19:24,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-08 17:19:24,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1407, Unknown=11, NotChecked=0, Total=1560 [2018-12-08 17:19:24,375 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand 40 states. [2018-12-08 17:19:39,904 WARN L180 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2018-12-08 17:19:45,763 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-12-08 17:19:54,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:19:54,812 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-12-08 17:19:54,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-08 17:19:54,812 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 60 [2018-12-08 17:19:54,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:19:54,813 INFO L225 Difference]: With dead ends: 168 [2018-12-08 17:19:54,813 INFO L226 Difference]: Without dead ends: 168 [2018-12-08 17:19:54,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=413, Invalid=3235, Unknown=12, NotChecked=0, Total=3660 [2018-12-08 17:19:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-08 17:19:54,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 122. [2018-12-08 17:19:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-08 17:19:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2018-12-08 17:19:54,817 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 60 [2018-12-08 17:19:54,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:19:54,817 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2018-12-08 17:19:54,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-08 17:19:54,817 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-12-08 17:19:54,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 17:19:54,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:19:54,818 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:19:54,818 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr9REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-12-08 17:19:54,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:19:54,818 INFO L82 PathProgramCache]: Analyzing trace with hash -368145965, now seen corresponding path program 1 times [2018-12-08 17:19:54,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:19:54,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:19:54,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:19:54,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:19:54,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:19:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:19:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:19:54,857 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 17:19:54,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 05:19:54 BoogieIcfgContainer [2018-12-08 17:19:54,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 17:19:54,884 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:19:54,884 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:19:54,884 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:19:54,884 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:12:17" (3/4) ... [2018-12-08 17:19:54,886 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 17:19:54,919 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f1038e60-6cf8-405a-97d3-d35daedd2043/bin-2019/uautomizer/witness.graphml [2018-12-08 17:19:54,919 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:19:54,919 INFO L168 Benchmark]: Toolchain (without parser) took 457549.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 951.7 MB in the beginning and 950.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 167.3 MB. Max. memory is 11.5 GB. [2018-12-08 17:19:54,920 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:19:54,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -149.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-08 17:19:54,920 INFO L168 Benchmark]: Boogie Preprocessor took 29.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 17:19:54,920 INFO L168 Benchmark]: RCFGBuilder took 308.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2018-12-08 17:19:54,920 INFO L168 Benchmark]: TraceAbstraction took 456907.51 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.0 GB in the beginning and 950.1 MB in the end (delta: 94.2 MB). Peak memory consumption was 147.6 MB. Max. memory is 11.5 GB. [2018-12-08 17:19:54,921 INFO L168 Benchmark]: Witness Printer took 35.20 ms. Allocated memory is still 1.2 GB. Free memory was 950.1 MB in the beginning and 950.1 MB in the end (delta: 2.1 kB). Peak memory consumption was 2.1 kB. Max. memory is 11.5 GB. [2018-12-08 17:19:54,922 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -149.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 308.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 456907.51 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.0 GB in the beginning and 950.1 MB in the end (delta: 94.2 MB). Peak memory consumption was 147.6 MB. Max. memory is 11.5 GB. * Witness Printer took 35.20 ms. Allocated memory is still 1.2 GB. Free memory was 950.1 MB in the beginning and 950.1 MB in the end (delta: 2.1 kB). Peak memory consumption was 2.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 648]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L635] struct item *list = ((void *)0); VAL [list={10:0}] [L637] CALL append(&list) VAL [plist={10:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L627] item->next = *plist VAL [\read(**plist)={0:0}, item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628] EXPR item->next VAL [item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={14:0}, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={14:0}, plist={10:0}, plist={10:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={14:0}, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={14:0}, plist={10:0}, plist={10:0}] [L631] *plist = item VAL [item={11:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={14:0}, plist={10:0}, plist={10:0}] [L637] RET append(&list) VAL [list={10:0}] [L638] COND TRUE __VERIFIER_nondet_int() [L637] CALL append(&list) VAL [plist={10:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={12:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={11:0}, item={12:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L627] item->next = *plist VAL [\read(**plist)={11:0}, item={12:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L628] EXPR item->next VAL [item={12:0}, item->next={11:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [item={12:0}, item->next={11:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L629] EXPR item->next VAL [item={12:0}, item->next={11:0}, item->next={11:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L629] EXPR item->next->data VAL [item={12:0}, item->next={11:0}, item->next={11:0}, item->next->data={14:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={14:0}, item={12:0}, item->next={11:0}, item->next={11:0}, item->next->data={14:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={14:0}, item={12:0}, item->next={11:0}, item->next={11:0}, item->next->data={14:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L631] *plist = item VAL [item={12:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L637] RET append(&list) VAL [list={10:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] \read(*list) VAL [\read(*list)={12:0}, list={10:0}] [L639] COND TRUE \read(*list) [L640] EXPR \read(*list) VAL [\read(*list)={12:0}, list={10:0}] [L640] EXPR list->next VAL [\read(*list)={12:0}, list={10:0}, list->next={11:0}] [L640] struct item *next = list->next; [L641] EXPR \read(*list) VAL [\read(*list)={12:0}, list={10:0}, next={11:0}] [L641] EXPR list->data VAL [\read(*list)={12:0}, list={10:0}, list->data={14:0}, next={11:0}] [L641] free(list->data) VAL [\read(*list)={12:0}, list={10:0}, list->data={14:0}, next={11:0}] [L641] free(list->data) [L642] EXPR \read(*list) VAL [\read(*list)={12:0}, list={10:0}, next={11:0}] [L642] free(list) VAL [\read(*list)={12:0}, list={10:0}, next={11:0}] [L642] free(list) [L643] list = next VAL [list={10:0}, next={11:0}] [L645] \read(*list) VAL [\read(*list)={11:0}, list={10:0}, next={11:0}] [L645] COND TRUE \read(*list) [L646] EXPR \read(*list) VAL [\read(*list)={11:0}, list={10:0}, next={11:0}] [L646] EXPR list->next VAL [\read(*list)={11:0}, list={10:0}, list->next={0:0}, next={11:0}] [L646] struct item *next = list->next; [L647] COND TRUE !next VAL [list={10:0}, next={0:0}, next={11:0}] [L648] EXPR \read(*list) VAL [\read(*list)={11:0}, list={10:0}, next={11:0}, next={0:0}] [L648] EXPR list->data VAL [\read(*list)={11:0}, list={10:0}, list->data={14:0}, next={11:0}, next={0:0}] [L648] free(list->data) VAL [\read(*list)={11:0}, list={10:0}, list->data={14:0}, next={11:0}, next={0:0}] [L648] free(list->data) VAL [\read(*list)={11:0}, list={10:0}, list->data={14:0}, next={0:0}, next={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 106 locations, 51 error locations. UNSAFE Result, 456.8s OverallTime, 39 OverallIterations, 2 TraceHistogramMax, 332.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1895 SDtfs, 4547 SDslu, 12147 SDs, 0 SdLazy, 20165 SolverSat, 966 SolverUnsat, 152 SolverUnknown, 0 SolverNotchecked, 186.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1601 GetRequests, 512 SyntacticMatches, 56 SemanticMatches, 1033 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13547 ImplicationChecksByTransitivity, 258.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=38, 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, 38 MinimizatonAttempts, 517 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 122.4s InterpolantComputationTime, 2137 NumberOfCodeBlocks, 2137 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 2024 ConstructedInterpolants, 178 QuantifiedInterpolants, 2402398 SizeOfPredicates, 366 NumberOfNonLiveVariables, 4138 ConjunctsInSsa, 1065 ConjunctsInUnsatCore, 53 InterpolantComputations, 25 PerfectInterpolantSequences, 195/420 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...