./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.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_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/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 f0eb6dcabc0b5a8d392af7836fd5c7e700568e57 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/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 f0eb6dcabc0b5a8d392af7836fd5c7e700568e57 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_130 input size 25 context size 25 output size 25 --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 05:02:30,862 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:02:30,863 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:02:30,869 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:02:30,869 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:02:30,870 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:02:30,870 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:02:30,871 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:02:30,872 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:02:30,872 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:02:30,873 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:02:30,873 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:02:30,873 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:02:30,874 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:02:30,874 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:02:30,874 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:02:30,875 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:02:30,876 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:02:30,877 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:02:30,877 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:02:30,878 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:02:30,879 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:02:30,880 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:02:30,880 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:02:30,880 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:02:30,880 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:02:30,881 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:02:30,881 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:02:30,882 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:02:30,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:02:30,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:02:30,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:02:30,883 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:02:30,883 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:02:30,883 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:02:30,884 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:02:30,884 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 05:02:30,891 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:02:30,891 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:02:30,891 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:02:30,891 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:02:30,892 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 05:02:30,892 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 05:02:30,892 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 05:02:30,892 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:02:30,892 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:02:30,892 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 05:02:30,892 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:02:30,892 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:02:30,892 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:02:30,892 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 05:02:30,892 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 05:02:30,893 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 05:02:30,893 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:02:30,893 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:02:30,893 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 05:02:30,893 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:02:30,893 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:02:30,893 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:02:30,893 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:02:30,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:02:30,893 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:02:30,893 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:02:30,893 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 05:02:30,893 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:02:30,894 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_c8cc44f5-9360-4486-9122-4fa30632a2e4/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 -> f0eb6dcabc0b5a8d392af7836fd5c7e700568e57 [2018-12-02 05:02:30,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:02:30,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:02:30,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:02:30,921 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:02:30,921 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:02:30,922 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-12-02 05:02:30,960 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/data/80992fee1/5d18cf7412f84ba4ad5e5ddf89b53b11/FLAG107c3cb39 [2018-12-02 05:02:31,406 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:02:31,407 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-12-02 05:02:31,412 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/data/80992fee1/5d18cf7412f84ba4ad5e5ddf89b53b11/FLAG107c3cb39 [2018-12-02 05:02:31,420 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/data/80992fee1/5d18cf7412f84ba4ad5e5ddf89b53b11 [2018-12-02 05:02:31,422 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:02:31,423 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 05:02:31,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:02:31,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:02:31,425 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:02:31,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:02:31" (1/1) ... [2018-12-02 05:02:31,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:31, skipping insertion in model container [2018-12-02 05:02:31,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:02:31" (1/1) ... [2018-12-02 05:02:31,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:02:31,449 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:02:31,588 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:02:31,593 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:02:31,651 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:02:31,671 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:02:31,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:31 WrapperNode [2018-12-02 05:02:31,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:02:31,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:02:31,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:02:31,672 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:02:31,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:31" (1/1) ... [2018-12-02 05:02:31,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:31" (1/1) ... [2018-12-02 05:02:31,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:31" (1/1) ... [2018-12-02 05:02:31,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:31" (1/1) ... [2018-12-02 05:02:31,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:31" (1/1) ... [2018-12-02 05:02:31,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:31" (1/1) ... [2018-12-02 05:02:31,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:31" (1/1) ... [2018-12-02 05:02:31,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:02:31,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:02:31,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:02:31,703 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:02:31,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/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-02 05:02:31,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 05:02:31,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:02:31,735 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-02 05:02:31,736 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 05:02:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-02 05:02:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 05:02:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 05:02:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 05:02:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 05:02:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 05:02:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 05:02:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 05:02:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 05:02:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 05:02:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 05:02:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 05:02:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 05:02:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 05:02:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 05:02:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 05:02:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 05:02:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 05:02:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 05:02:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 05:02:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 05:02:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 05:02:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 05:02:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 05:02:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 05:02:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 05:02:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 05:02:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 05:02:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 05:02:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 05:02:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 05:02:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 05:02:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 05:02:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 05:02:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 05:02:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 05:02:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 05:02:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 05:02:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 05:02:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 05:02:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 05:02:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 05:02:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 05:02:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 05:02:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 05:02:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 05:02:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 05:02:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 05:02:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 05:02:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 05:02:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 05:02:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 05:02:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 05:02:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 05:02:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 05:02:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 05:02:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 05:02:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 05:02:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 05:02:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 05:02:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 05:02:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 05:02:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 05:02:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 05:02:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 05:02:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-02 05:02:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 05:02:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 05:02:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 05:02:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 05:02:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 05:02:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 05:02:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 05:02:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 05:02:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 05:02:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 05:02:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 05:02:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 05:02:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 05:02:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 05:02:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 05:02:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 05:02:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 05:02:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 05:02:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 05:02:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 05:02:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 05:02:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 05:02:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 05:02:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 05:02:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 05:02:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 05:02:31,741 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 05:02:31,742 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 05:02:31,742 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 05:02:31,742 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 05:02:31,742 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 05:02:31,742 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 05:02:31,742 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 05:02:31,742 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 05:02:31,742 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 05:02:31,742 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 05:02:31,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-02 05:02:31,742 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-02 05:02:31,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:02:31,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 05:02:31,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 05:02:31,742 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 05:02:31,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 05:02:31,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 05:02:31,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 05:02:31,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:02:31,995 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:02:31,995 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 05:02:31,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:02:31 BoogieIcfgContainer [2018-12-02 05:02:31,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:02:31,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:02:31,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:02:31,998 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:02:31,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:02:31" (1/3) ... [2018-12-02 05:02:31,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3900e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:02:31, skipping insertion in model container [2018-12-02 05:02:31,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:02:31" (2/3) ... [2018-12-02 05:02:31,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3900e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:02:31, skipping insertion in model container [2018-12-02 05:02:31,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:02:31" (3/3) ... [2018-12-02 05:02:32,000 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_true-valid-memsafety_true-termination.i [2018-12-02 05:02:32,007 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:02:32,012 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-12-02 05:02:32,022 INFO L257 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2018-12-02 05:02:32,036 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 05:02:32,037 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:02:32,037 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 05:02:32,037 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:02:32,037 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:02:32,037 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:02:32,037 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:02:32,037 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:02:32,037 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:02:32,047 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-12-02 05:02:32,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 05:02:32,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:32,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:32,055 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:32,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:32,058 INFO L82 PathProgramCache]: Analyzing trace with hash 343891185, now seen corresponding path program 1 times [2018-12-02 05:02:32,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:32,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:32,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:32,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:32,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:32,181 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-02 05:02:32,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:32,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:02:32,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:02:32,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:02:32,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:02:32,195 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 5 states. [2018-12-02 05:02:32,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:32,316 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-12-02 05:02:32,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:02:32,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 05:02:32,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:32,323 INFO L225 Difference]: With dead ends: 86 [2018-12-02 05:02:32,323 INFO L226 Difference]: Without dead ends: 83 [2018-12-02 05:02:32,324 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-02 05:02:32,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-02 05:02:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-02 05:02:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 05:02:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-12-02 05:02:32,347 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 9 [2018-12-02 05:02:32,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:32,348 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-12-02 05:02:32,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:02:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-12-02 05:02:32,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 05:02:32,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:32,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:32,348 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:32,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:32,349 INFO L82 PathProgramCache]: Analyzing trace with hash 343891186, now seen corresponding path program 1 times [2018-12-02 05:02:32,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:32,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:32,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:32,403 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-02 05:02:32,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:32,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:02:32,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:02:32,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:02:32,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:02:32,404 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 5 states. [2018-12-02 05:02:32,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:32,526 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-12-02 05:02:32,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:02:32,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 05:02:32,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:32,528 INFO L225 Difference]: With dead ends: 99 [2018-12-02 05:02:32,528 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 05:02:32,529 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-02 05:02:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 05:02:32,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-12-02 05:02:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 05:02:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-12-02 05:02:32,534 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 9 [2018-12-02 05:02:32,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:32,534 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-12-02 05:02:32,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:02:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-12-02 05:02:32,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 05:02:32,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:32,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:32,535 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:32,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:32,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2070692204, now seen corresponding path program 1 times [2018-12-02 05:02:32,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:32,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:32,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:32,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:32,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:32,554 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-02 05:02:32,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:32,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:02:32,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:02:32,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:02:32,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:02:32,555 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 3 states. [2018-12-02 05:02:32,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:32,590 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-12-02 05:02:32,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:02:32,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 05:02:32,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:32,591 INFO L225 Difference]: With dead ends: 84 [2018-12-02 05:02:32,591 INFO L226 Difference]: Without dead ends: 84 [2018-12-02 05:02:32,592 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-02 05:02:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-02 05:02:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-02 05:02:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-02 05:02:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-12-02 05:02:32,597 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 10 [2018-12-02 05:02:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:32,598 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-12-02 05:02:32,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:02:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-12-02 05:02:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 05:02:32,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:32,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:32,599 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:32,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:32,599 INFO L82 PathProgramCache]: Analyzing trace with hash 2070692205, now seen corresponding path program 1 times [2018-12-02 05:02:32,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:32,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:32,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:32,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:32,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:32,623 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-02 05:02:32,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:32,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:02:32,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:02:32,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:02:32,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:02:32,624 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 3 states. [2018-12-02 05:02:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:32,655 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-12-02 05:02:32,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:02:32,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 05:02:32,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:32,656 INFO L225 Difference]: With dead ends: 80 [2018-12-02 05:02:32,656 INFO L226 Difference]: Without dead ends: 80 [2018-12-02 05:02:32,656 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-02 05:02:32,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-02 05:02:32,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-02 05:02:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-02 05:02:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-12-02 05:02:32,660 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 10 [2018-12-02 05:02:32,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:32,660 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-12-02 05:02:32,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:02:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-12-02 05:02:32,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 05:02:32,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:32,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:32,661 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:32,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:32,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1862549020, now seen corresponding path program 1 times [2018-12-02 05:02:32,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:32,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:32,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:32,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:32,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:32,733 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-02 05:02:32,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:32,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 05:02:32,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:02:32,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:02:32,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:02:32,734 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 8 states. [2018-12-02 05:02:32,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:32,877 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-12-02 05:02:32,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:02:32,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-02 05:02:32,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:32,878 INFO L225 Difference]: With dead ends: 91 [2018-12-02 05:02:32,878 INFO L226 Difference]: Without dead ends: 91 [2018-12-02 05:02:32,878 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-02 05:02:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-02 05:02:32,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-12-02 05:02:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-02 05:02:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-12-02 05:02:32,883 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 15 [2018-12-02 05:02:32,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:32,884 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-12-02 05:02:32,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:02:32,884 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-12-02 05:02:32,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 05:02:32,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:32,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:32,884 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:32,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:32,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1904722897, now seen corresponding path program 1 times [2018-12-02 05:02:32,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:32,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:32,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:32,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:32,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:32,939 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-02 05:02:32,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:32,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:02:32,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:02:32,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:02:32,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:02:32,940 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 6 states. [2018-12-02 05:02:33,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:33,037 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-12-02 05:02:33,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:02:33,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-02 05:02:33,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:33,038 INFO L225 Difference]: With dead ends: 93 [2018-12-02 05:02:33,039 INFO L226 Difference]: Without dead ends: 93 [2018-12-02 05:02:33,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:02:33,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-02 05:02:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2018-12-02 05:02:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 05:02:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-12-02 05:02:33,042 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 16 [2018-12-02 05:02:33,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:33,042 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-12-02 05:02:33,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:02:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-12-02 05:02:33,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 05:02:33,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:33,049 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-02 05:02:33,050 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:33,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:33,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1198031841, now seen corresponding path program 1 times [2018-12-02 05:02:33,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:33,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:33,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:33,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:33,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:33,117 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-02 05:02:33,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:33,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:02:33,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:02:33,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:02:33,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:02:33,118 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 7 states. [2018-12-02 05:02:33,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:33,221 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-12-02 05:02:33,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:02:33,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-02 05:02:33,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:33,222 INFO L225 Difference]: With dead ends: 89 [2018-12-02 05:02:33,222 INFO L226 Difference]: Without dead ends: 89 [2018-12-02 05:02:33,222 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-02 05:02:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-02 05:02:33,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2018-12-02 05:02:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 05:02:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-12-02 05:02:33,226 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 24 [2018-12-02 05:02:33,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:33,227 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-12-02 05:02:33,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:02:33,227 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-12-02 05:02:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 05:02:33,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:33,228 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-02 05:02:33,228 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:33,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:33,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1198031840, now seen corresponding path program 1 times [2018-12-02 05:02:33,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:33,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:33,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:33,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:33,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:33,318 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-02 05:02:33,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:33,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:02:33,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:02:33,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:02:33,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:02:33,319 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 7 states. [2018-12-02 05:02:33,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:33,416 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-12-02 05:02:33,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:02:33,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-02 05:02:33,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:33,417 INFO L225 Difference]: With dead ends: 91 [2018-12-02 05:02:33,417 INFO L226 Difference]: Without dead ends: 91 [2018-12-02 05:02:33,418 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-02 05:02:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-02 05:02:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2018-12-02 05:02:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-02 05:02:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-12-02 05:02:33,421 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 24 [2018-12-02 05:02:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:33,421 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-12-02 05:02:33,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:02:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-12-02 05:02:33,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 05:02:33,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:33,422 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] [2018-12-02 05:02:33,422 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:33,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:33,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1516648738, now seen corresponding path program 1 times [2018-12-02 05:02:33,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:33,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:33,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:33,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:33,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:33,445 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-02 05:02:33,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:33,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:02:33,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:02:33,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:02:33,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:02:33,446 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 4 states. [2018-12-02 05:02:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:33,458 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-12-02 05:02:33,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:02:33,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-12-02 05:02:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:33,459 INFO L225 Difference]: With dead ends: 77 [2018-12-02 05:02:33,459 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 05:02:33,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:02:33,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 05:02:33,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-12-02 05:02:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-02 05:02:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-12-02 05:02:33,462 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 25 [2018-12-02 05:02:33,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:33,463 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-12-02 05:02:33,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:02:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-12-02 05:02:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 05:02:33,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:33,463 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-02 05:02:33,464 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:33,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:33,464 INFO L82 PathProgramCache]: Analyzing trace with hash 611651585, now seen corresponding path program 1 times [2018-12-02 05:02:33,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:33,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:33,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:33,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:33,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:33,515 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-02 05:02:33,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:33,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:02:33,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:02:33,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:02:33,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:02:33,516 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 7 states. [2018-12-02 05:02:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:33,617 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-12-02 05:02:33,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:02:33,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-02 05:02:33,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:33,618 INFO L225 Difference]: With dead ends: 75 [2018-12-02 05:02:33,618 INFO L226 Difference]: Without dead ends: 75 [2018-12-02 05:02:33,618 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-02 05:02:33,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-02 05:02:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-02 05:02:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 05:02:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-12-02 05:02:33,621 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 27 [2018-12-02 05:02:33,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:33,621 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-12-02 05:02:33,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:02:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-12-02 05:02:33,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 05:02:33,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:33,622 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-02 05:02:33,623 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:33,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:33,623 INFO L82 PathProgramCache]: Analyzing trace with hash 611651586, now seen corresponding path program 1 times [2018-12-02 05:02:33,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:33,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:33,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:33,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:33,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:33,707 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-02 05:02:33,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:33,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:02:33,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:02:33,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:02:33,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:02:33,708 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 8 states. [2018-12-02 05:02:33,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:33,802 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-12-02 05:02:33,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:02:33,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-02 05:02:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:33,803 INFO L225 Difference]: With dead ends: 74 [2018-12-02 05:02:33,804 INFO L226 Difference]: Without dead ends: 74 [2018-12-02 05:02:33,804 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-02 05:02:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-02 05:02:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-02 05:02:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-02 05:02:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-12-02 05:02:33,806 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 27 [2018-12-02 05:02:33,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:33,807 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-12-02 05:02:33,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:02:33,807 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-12-02 05:02:33,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 05:02:33,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:33,808 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-02 05:02:33,808 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:33,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:33,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1781329954, now seen corresponding path program 1 times [2018-12-02 05:02:33,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:33,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:33,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:33,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:33,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:33,975 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-02 05:02:33,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:33,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:02:33,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:02:33,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:02:33,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:02:33,976 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 12 states. [2018-12-02 05:02:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:34,274 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-12-02 05:02:34,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 05:02:34,275 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-12-02 05:02:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:34,275 INFO L225 Difference]: With dead ends: 105 [2018-12-02 05:02:34,275 INFO L226 Difference]: Without dead ends: 105 [2018-12-02 05:02:34,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:02:34,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-02 05:02:34,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2018-12-02 05:02:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 05:02:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-12-02 05:02:34,278 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 28 [2018-12-02 05:02:34,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:34,279 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-12-02 05:02:34,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:02:34,279 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-12-02 05:02:34,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 05:02:34,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:34,279 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-02 05:02:34,280 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:34,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:34,280 INFO L82 PathProgramCache]: Analyzing trace with hash -613346207, now seen corresponding path program 1 times [2018-12-02 05:02:34,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:34,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:34,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:34,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:34,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:34,426 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-02 05:02:34,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:34,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:02:34,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:02:34,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:02:34,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:02:34,426 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 12 states. [2018-12-02 05:02:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:34,682 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-12-02 05:02:34,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 05:02:34,682 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-12-02 05:02:34,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:34,683 INFO L225 Difference]: With dead ends: 94 [2018-12-02 05:02:34,683 INFO L226 Difference]: Without dead ends: 94 [2018-12-02 05:02:34,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-12-02 05:02:34,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-02 05:02:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-12-02 05:02:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-02 05:02:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-12-02 05:02:34,686 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 29 [2018-12-02 05:02:34,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:34,687 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-12-02 05:02:34,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:02:34,687 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-12-02 05:02:34,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 05:02:34,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:34,687 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:34,688 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:34,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:34,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1145959465, now seen corresponding path program 1 times [2018-12-02 05:02:34,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:34,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:34,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:34,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:34,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:34,771 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-02 05:02:34,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:34,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/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-02 05:02:34,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:34,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:34,850 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-02 05:02:34,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 05:02:34,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:34,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:34,859 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-02 05:02:34,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-02 05:02:34,886 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-02 05:02:34,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:34,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:34,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-12-02 05:02:34,944 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-02 05:02:34,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-02 05:02:34,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:34,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:34,967 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-02 05:02:34,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-02 05:02:34,998 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-02 05:02:35,002 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-02 05:02:35,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,022 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-02 05:02:35,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-12-02 05:02:35,032 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-02 05:02:35,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:02:35,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2018-12-02 05:02:35,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 05:02:35,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 05:02:35,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-12-02 05:02:35,058 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 17 states. [2018-12-02 05:02:35,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:35,386 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-12-02 05:02:35,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 05:02:35,386 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-12-02 05:02:35,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:35,387 INFO L225 Difference]: With dead ends: 94 [2018-12-02 05:02:35,387 INFO L226 Difference]: Without dead ends: 94 [2018-12-02 05:02:35,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2018-12-02 05:02:35,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-02 05:02:35,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-12-02 05:02:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 05:02:35,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2018-12-02 05:02:35,391 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 30 [2018-12-02 05:02:35,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:35,391 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2018-12-02 05:02:35,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 05:02:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-12-02 05:02:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 05:02:35,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:35,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, 1] [2018-12-02 05:02:35,392 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:35,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:35,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1145959466, now seen corresponding path program 1 times [2018-12-02 05:02:35,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:35,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:35,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:35,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:35,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:35,514 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-02 05:02:35,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:35,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/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-02 05:02:35,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:35,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:35,565 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-02 05:02:35,567 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-02 05:02:35,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,578 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-02 05:02:35,579 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-02 05:02:35,579 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,586 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-02 05:02:35,586 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-12-02 05:02:35,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:02:35,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:02:35,618 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-02 05:02:35,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,627 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-02 05:02:35,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-12-02 05:02:35,697 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-02 05:02:35,700 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-02 05:02:35,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,728 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-02 05:02:35,732 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 27 treesize of output 27 [2018-12-02 05:02:35,733 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,749 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 30 treesize of output 29 [2018-12-02 05:02:35,749 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,761 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-02 05:02:35,761 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-12-02 05:02:35,792 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-02 05:02:35,794 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 30 treesize of output 23 [2018-12-02 05:02:35,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,805 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 23 treesize of output 14 [2018-12-02 05:02:35,805 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,815 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-02 05:02:35,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,829 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-02 05:02:35,831 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-02 05:02:35,832 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,836 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:35,840 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-02 05:02:35,840 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-12-02 05:02:35,855 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-02 05:02:35,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:02:35,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2018-12-02 05:02:35,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 05:02:35,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 05:02:35,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2018-12-02 05:02:35,871 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 17 states. [2018-12-02 05:02:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:36,618 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-12-02 05:02:36,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:02:36,619 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-12-02 05:02:36,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:36,619 INFO L225 Difference]: With dead ends: 90 [2018-12-02 05:02:36,619 INFO L226 Difference]: Without dead ends: 90 [2018-12-02 05:02:36,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=446, Unknown=1, NotChecked=0, Total=552 [2018-12-02 05:02:36,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-02 05:02:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-12-02 05:02:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 05:02:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-12-02 05:02:36,625 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 30 [2018-12-02 05:02:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:36,625 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-12-02 05:02:36,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 05:02:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-12-02 05:02:36,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 05:02:36,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:36,626 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-02 05:02:36,627 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:36,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:36,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1833863163, now seen corresponding path program 1 times [2018-12-02 05:02:36,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:36,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:36,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:36,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:36,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:36,846 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-02 05:02:36,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:36,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 05:02:36,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 05:02:36,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 05:02:36,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:02:36,847 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 13 states. [2018-12-02 05:02:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:37,132 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-12-02 05:02:37,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 05:02:37,133 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-12-02 05:02:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:37,133 INFO L225 Difference]: With dead ends: 116 [2018-12-02 05:02:37,133 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 05:02:37,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:02:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 05:02:37,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 105. [2018-12-02 05:02:37,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 05:02:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-12-02 05:02:37,135 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 30 [2018-12-02 05:02:37,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:37,136 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-12-02 05:02:37,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 05:02:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-12-02 05:02:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 05:02:37,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:37,136 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-02 05:02:37,136 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:37,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:37,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1833863162, now seen corresponding path program 1 times [2018-12-02 05:02:37,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:37,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:37,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:37,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:37,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:37,149 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-02 05:02:37,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:37,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:02:37,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:02:37,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:02:37,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:02:37,150 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 3 states. [2018-12-02 05:02:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:37,171 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-12-02 05:02:37,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:02:37,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 05:02:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:37,173 INFO L225 Difference]: With dead ends: 100 [2018-12-02 05:02:37,173 INFO L226 Difference]: Without dead ends: 100 [2018-12-02 05:02:37,173 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-02 05:02:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-02 05:02:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-02 05:02:37,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 05:02:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-12-02 05:02:37,175 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 30 [2018-12-02 05:02:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:37,175 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-12-02 05:02:37,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:02:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-12-02 05:02:37,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 05:02:37,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:37,176 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-02 05:02:37,176 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:37,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:37,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1015183195, now seen corresponding path program 1 times [2018-12-02 05:02:37,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:37,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:37,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:37,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:37,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:37,202 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-02 05:02:37,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:37,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:02:37,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:02:37,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:02:37,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:02:37,203 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 6 states. [2018-12-02 05:02:37,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:37,259 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-12-02 05:02:37,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:02:37,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-02 05:02:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:37,260 INFO L225 Difference]: With dead ends: 99 [2018-12-02 05:02:37,260 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 05:02:37,260 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-02 05:02:37,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 05:02:37,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-02 05:02:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 05:02:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-12-02 05:02:37,261 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 31 [2018-12-02 05:02:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:37,262 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-12-02 05:02:37,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:02:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-12-02 05:02:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 05:02:37,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:37,262 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-02 05:02:37,262 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:37,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:37,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1405907899, now seen corresponding path program 1 times [2018-12-02 05:02:37,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:37,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:37,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:37,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:37,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:37,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-02 05:02:37,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:37,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 05:02:37,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 05:02:37,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 05:02:37,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:02:37,458 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 13 states. [2018-12-02 05:02:37,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:37,720 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-12-02 05:02:37,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 05:02:37,721 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-12-02 05:02:37,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:37,722 INFO L225 Difference]: With dead ends: 107 [2018-12-02 05:02:37,722 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 05:02:37,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-12-02 05:02:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 05:02:37,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2018-12-02 05:02:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 05:02:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-02 05:02:37,726 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 32 [2018-12-02 05:02:37,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:37,726 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-02 05:02:37,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 05:02:37,727 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-02 05:02:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 05:02:37,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:37,727 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-02 05:02:37,727 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:37,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:37,728 INFO L82 PathProgramCache]: Analyzing trace with hash -633471832, now seen corresponding path program 1 times [2018-12-02 05:02:37,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:37,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:37,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:37,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:37,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:37,780 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-02 05:02:37,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:37,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:02:37,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:02:37,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:02:37,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:02:37,781 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 8 states. [2018-12-02 05:02:37,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:37,882 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-12-02 05:02:37,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:02:37,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-12-02 05:02:37,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:37,883 INFO L225 Difference]: With dead ends: 106 [2018-12-02 05:02:37,883 INFO L226 Difference]: Without dead ends: 106 [2018-12-02 05:02:37,884 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-02 05:02:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-02 05:02:37,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-12-02 05:02:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 05:02:37,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-12-02 05:02:37,887 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 33 [2018-12-02 05:02:37,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:37,887 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-12-02 05:02:37,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:02:37,888 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-12-02 05:02:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 05:02:37,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:37,888 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-02 05:02:37,888 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:37,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:37,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1546126098, now seen corresponding path program 1 times [2018-12-02 05:02:37,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:37,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:37,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:37,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:37,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:38,555 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-02 05:02:38,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:38,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-02 05:02:38,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 05:02:38,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 05:02:38,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-12-02 05:02:38,557 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 17 states. [2018-12-02 05:02:39,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:39,355 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-12-02 05:02:39,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 05:02:39,356 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-12-02 05:02:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:39,357 INFO L225 Difference]: With dead ends: 120 [2018-12-02 05:02:39,357 INFO L226 Difference]: Without dead ends: 118 [2018-12-02 05:02:39,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-12-02 05:02:39,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-02 05:02:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 107. [2018-12-02 05:02:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-02 05:02:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-12-02 05:02:39,363 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 37 [2018-12-02 05:02:39,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:39,364 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-12-02 05:02:39,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 05:02:39,364 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-12-02 05:02:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 05:02:39,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:39,365 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-02 05:02:39,365 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:39,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:39,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1546127350, now seen corresponding path program 1 times [2018-12-02 05:02:39,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:39,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:39,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:39,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:39,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:39,401 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-02 05:02:39,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:02:39,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:02:39,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:02:39,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:02:39,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:02:39,402 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 5 states. [2018-12-02 05:02:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:39,415 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-12-02 05:02:39,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:02:39,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-12-02 05:02:39,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:39,417 INFO L225 Difference]: With dead ends: 110 [2018-12-02 05:02:39,417 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 05:02:39,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:02:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 05:02:39,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2018-12-02 05:02:39,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-02 05:02:39,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-12-02 05:02:39,420 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 37 [2018-12-02 05:02:39,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:39,420 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-12-02 05:02:39,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:02:39,421 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2018-12-02 05:02:39,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 05:02:39,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:39,421 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:39,421 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:39,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:39,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1495152437, now seen corresponding path program 1 times [2018-12-02 05:02:39,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:39,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:39,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:39,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:39,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:02:39,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:39,527 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/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-02 05:02:39,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:39,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:39,565 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-02 05:02:39,566 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-02 05:02:39,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:39,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:39,570 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-02 05:02:39,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-12-02 05:02:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:02:39,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:02:39,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-12-02 05:02:39,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 05:02:39,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 05:02:39,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-12-02 05:02:39,632 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 17 states. [2018-12-02 05:02:39,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:39,975 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-12-02 05:02:39,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 05:02:39,976 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-12-02 05:02:39,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:39,976 INFO L225 Difference]: With dead ends: 74 [2018-12-02 05:02:39,976 INFO L226 Difference]: Without dead ends: 74 [2018-12-02 05:02:39,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 05:02:39,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-02 05:02:39,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-02 05:02:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-02 05:02:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-12-02 05:02:39,977 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 43 [2018-12-02 05:02:39,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:39,978 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-12-02 05:02:39,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 05:02:39,978 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-12-02 05:02:39,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 05:02:39,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:39,978 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:39,978 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:39,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:39,978 INFO L82 PathProgramCache]: Analyzing trace with hash -446000608, now seen corresponding path program 1 times [2018-12-02 05:02:39,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:39,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:39,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:39,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:39,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:02:40,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:40,472 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/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-02 05:02:40,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:40,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:40,505 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-02 05:02:40,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:40,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:40,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:02:40,581 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-02 05:02:40,582 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-02 05:02:40,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:40,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:40,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:40,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-02 05:02:40,615 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-02 05:02:40,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 05:02:40,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:40,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:40,635 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-02 05:02:40,638 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 21 treesize of output 22 [2018-12-02 05:02:40,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:40,649 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-02 05:02:40,650 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:40,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:40,660 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-02 05:02:40,660 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-12-02 05:02:40,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:02:40,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:02:40,685 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-02 05:02:40,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:40,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:40,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:44 [2018-12-02 05:02:40,977 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-02 05:02:40,979 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-02 05:02:40,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:40,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:40,990 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-02 05:02:40,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:142 [2018-12-02 05:02:42,290 WARN L180 SmtUtils]: Spent 677.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-02 05:02:42,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:02:42,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:02:42,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:02:42,352 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-02 05:02:42,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:42,373 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 69 treesize of output 93 [2018-12-02 05:02:42,374 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 35 treesize of output 38 [2018-12-02 05:02:42,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:02:42,377 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:02:42,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2018-12-02 05:02:42,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:42,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:42,395 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 82 treesize of output 101 [2018-12-02 05:02:42,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2018-12-02 05:02:42,398 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:42,406 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:42,411 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-02 05:02:42,421 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 76 treesize of output 66 [2018-12-02 05:02:42,422 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 66 treesize of output 56 [2018-12-02 05:02:42,423 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-02 05:02:42,428 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-02 05:02:42,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:02:42,437 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:185, output treesize:82 [2018-12-02 05:02:42,597 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 64 treesize of output 54 [2018-12-02 05:02:42,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 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-02 05:02:42,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:42,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:42,616 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-02 05:02:42,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:73 [2018-12-02 05:02:42,676 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 67 treesize of output 57 [2018-12-02 05:02:42,678 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 40 treesize of output 30 [2018-12-02 05:02:42,679 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-02 05:02:42,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:02:42,690 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 12 [2018-12-02 05:02:42,690 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:42,695 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-02 05:02:42,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:42,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:42,703 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-02 05:02:42,703 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:3 [2018-12-02 05:02:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:02:42,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:02:42,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 39 [2018-12-02 05:02:42,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-02 05:02:42,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-02 05:02:42,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1440, Unknown=1, NotChecked=0, Total=1560 [2018-12-02 05:02:42,736 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 40 states. [2018-12-02 05:02:48,203 WARN L180 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2018-12-02 05:02:49,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:02:49,201 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-12-02 05:02:49,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-02 05:02:49,202 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 46 [2018-12-02 05:02:49,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:02:49,202 INFO L225 Difference]: With dead ends: 120 [2018-12-02 05:02:49,202 INFO L226 Difference]: Without dead ends: 120 [2018-12-02 05:02:49,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=418, Invalid=4136, Unknown=2, NotChecked=0, Total=4556 [2018-12-02 05:02:49,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-02 05:02:49,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 85. [2018-12-02 05:02:49,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-02 05:02:49,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2018-12-02 05:02:49,204 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 46 [2018-12-02 05:02:49,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:02:49,205 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2018-12-02 05:02:49,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-02 05:02:49,205 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-12-02 05:02:49,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 05:02:49,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:02:49,205 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:02:49,205 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:02:49,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:02:49,205 INFO L82 PathProgramCache]: Analyzing trace with hash -941116893, now seen corresponding path program 1 times [2018-12-02 05:02:49,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:02:49,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:02:49,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:49,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:49,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:02:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:50,165 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:02:50,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:02:50,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/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-02 05:02:50,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:02:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:02:50,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:02:50,233 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-02 05:02:50,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:50,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:50,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:02:50,399 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-02 05:02:50,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:50,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:50,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-02 05:02:50,468 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-02 05:02:50,470 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-02 05:02:50,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:50,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:50,486 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-02 05:02:50,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-12-02 05:02:50,585 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-02 05:02:50,589 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-02 05:02:50,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:50,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:50,637 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-02 05:02:50,638 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-02 05:02:50,638 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:50,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:50,645 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-02 05:02:50,645 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:44 [2018-12-02 05:02:50,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:02:50,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:02:50,674 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-02 05:02:50,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:50,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:50,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46 [2018-12-02 05:02:50,711 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-02 05:02:50,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:02:50,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:02:50,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-12-02 05:02:55,003 WARN L180 SmtUtils]: Spent 493.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-02 05:03:06,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:03:06,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:03:06,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:03:06,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:03:06,147 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-02 05:03:06,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:03:06,170 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 50 treesize of output 46 [2018-12-02 05:03:06,172 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 46 treesize of output 42 [2018-12-02 05:03:06,172 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:03:06,176 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:03:06,199 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 89 treesize of output 88 [2018-12-02 05:03:06,202 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 27 treesize of output 30 [2018-12-02 05:03:06,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:03:06,205 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 37 [2018-12-02 05:03:06,205 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:03:06,210 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:03:06,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:03:06,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:03:06,226 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 92 treesize of output 89 [2018-12-02 05:03:06,228 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-02 05:03:06,228 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:03:06,237 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:03:06,244 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-02 05:03:06,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:03:06,259 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:165, output treesize:138 [2018-12-02 05:03:06,450 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-02 05:03:06,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-02 05:03:06,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:03:06,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:03:06,468 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-02 05:03:06,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:154, output treesize:143 [2018-12-02 05:03:06,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-12-02 05:03:06,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:03:06,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:03:06,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:03:06,543 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 126 treesize of output 80 [2018-12-02 05:03:06,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-02 05:03:06,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:03:06,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-12-02 05:03:06,555 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-02 05:03:06,564 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:03:06,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:03:06,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-12-02 05:03:06,567 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-02 05:03:06,575 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:03:06,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 05:03:06,585 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:160, output treesize:37 [2018-12-02 05:03:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:03:06,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:03:06,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-12-02 05:03:06,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-02 05:03:06,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-02 05:03:06,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1570, Unknown=13, NotChecked=0, Total=1722 [2018-12-02 05:03:06,653 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 42 states. [2018-12-02 05:04:07,725 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 138 DAG size of output: 84 [2018-12-02 05:04:12,249 WARN L180 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 111 DAG size of output: 65 [2018-12-02 05:04:17,284 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2018-12-02 05:04:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:04:17,867 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-12-02 05:04:17,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 05:04:17,868 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 47 [2018-12-02 05:04:17,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:04:17,868 INFO L225 Difference]: With dead ends: 84 [2018-12-02 05:04:17,868 INFO L226 Difference]: Without dead ends: 84 [2018-12-02 05:04:17,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 50.1s TimeCoverageRelationStatistics Valid=338, Invalid=3289, Unknown=33, NotChecked=0, Total=3660 [2018-12-02 05:04:17,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-02 05:04:17,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-02 05:04:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-02 05:04:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-12-02 05:04:17,871 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 47 [2018-12-02 05:04:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:04:17,872 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-12-02 05:04:17,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-02 05:04:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-12-02 05:04:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 05:04:17,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:04:17,872 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:04:17,873 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:04:17,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:04:17,873 INFO L82 PathProgramCache]: Analyzing trace with hash 890147459, now seen corresponding path program 1 times [2018-12-02 05:04:17,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:04:17,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:04:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:04:17,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:04:17,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:04:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:04:18,546 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:04:18,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:04:18,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/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-02 05:04:18,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:04:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:04:18,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:04:18,579 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-02 05:04:18,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:04:18,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:04:18,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:04:18,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:04:18,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:04:18,674 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-02 05:04:18,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:04:18,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:04:18,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-12-02 05:04:18,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 13 treesize of output 10 [2018-12-02 05:04:18,705 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-02 05:04:18,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:04:18,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:04:18,713 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-02 05:04:18,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-02 05:04:18,742 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 11 treesize of output 8 [2018-12-02 05:04:18,744 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-02 05:04:18,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:04:18,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:04:18,763 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-02 05:04:18,773 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-02 05:04:18,774 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 05:04:18,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-02 05:04:18,788 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:04:18,796 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:04:18,807 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-02 05:04:18,807 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:46, output treesize:72 [2018-12-02 05:04:18,843 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 05:04:18,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:04:18,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:04:18,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:04:18,859 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-02 05:04:18,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:04:18,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:04:18,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:45 [2018-12-02 05:04:19,204 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-02 05:04:19,206 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-02 05:04:19,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:04:19,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:04:19,221 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-02 05:04:19,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:134 [2018-12-02 05:04:21,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:04:21,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:04:21,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:04:21,379 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-02 05:04:21,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:04:21,394 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 58 treesize of output 54 [2018-12-02 05:04:21,396 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 54 treesize of output 50 [2018-12-02 05:04:21,396 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:04:21,400 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:04:21,420 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 75 treesize of output 78 [2018-12-02 05:04:21,422 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 35 treesize of output 38 [2018-12-02 05:04:21,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:04:21,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-12-02 05:04:21,425 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:04:21,431 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:04:21,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:04:21,445 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 76 [2018-12-02 05:04:21,447 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 34 treesize of output 32 [2018-12-02 05:04:21,447 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:04:21,453 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:04:21,459 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-02 05:04:21,467 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-02 05:04:21,467 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:178, output treesize:110 [2018-12-02 05:04:21,647 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 111 treesize of output 95 [2018-12-02 05:04:21,649 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 95 treesize of output 76 [2018-12-02 05:04:21,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:04:21,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:04:21,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:04:21,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:123, output treesize:88 [2018-12-02 05:04:21,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:04:21,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:04:21,721 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 83 treesize of output 57 [2018-12-02 05:04:21,726 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2018-12-02 05:04:21,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:04:21,731 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 16 treesize of output 8 [2018-12-02 05:04:21,732 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:04:21,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:04:21,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-02 05:04:21,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:04:21,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:04:21,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-02 05:04:21,743 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:10 [2018-12-02 05:04:21,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:04:21,763 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-02 05:04:21,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:04:21,768 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-02 05:04:21,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-12-02 05:04:21,816 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:04:21,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:04:21,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 42 [2018-12-02 05:04:21,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-02 05:04:21,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-02 05:04:21,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1683, Unknown=1, NotChecked=0, Total=1806 [2018-12-02 05:04:21,832 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 43 states. [2018-12-02 05:05:00,188 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 75 [2018-12-02 05:05:04,504 WARN L180 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2018-12-02 05:05:08,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:05:08,089 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-12-02 05:05:08,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-02 05:05:08,090 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 48 [2018-12-02 05:05:08,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:05:08,090 INFO L225 Difference]: With dead ends: 114 [2018-12-02 05:05:08,090 INFO L226 Difference]: Without dead ends: 114 [2018-12-02 05:05:08,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1617 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=557, Invalid=5755, Unknown=8, NotChecked=0, Total=6320 [2018-12-02 05:05:08,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-02 05:05:08,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 83. [2018-12-02 05:05:08,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 05:05:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-12-02 05:05:08,093 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 48 [2018-12-02 05:05:08,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:05:08,093 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-12-02 05:05:08,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-02 05:05:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-12-02 05:05:08,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 05:05:08,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:05:08,094 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:05:08,094 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:05:08,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:05:08,094 INFO L82 PathProgramCache]: Analyzing trace with hash 733216579, now seen corresponding path program 1 times [2018-12-02 05:05:08,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:05:08,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:05:08,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:08,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:05:08,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:05:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:05:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:05:08,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:05:08,765 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/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-02 05:05:08,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:05:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:05:08,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:05:08,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02 05:05:08,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:08,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:08,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:05:08,870 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-02 05:05:08,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:08,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:08,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-02 05:05:08,902 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-02 05:05:08,904 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-02 05:05:08,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:08,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:08,912 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-02 05:05:08,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-12-02 05:05:08,953 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-02 05:05:08,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02 05:05:08,961 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 05:05:08,974 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 18 treesize of output 17 [2018-12-02 05:05:08,975 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:08,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:08,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 05:05:08,989 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-02 05:05:08,989 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:08,990 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:08,996 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-02 05:05:08,996 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2018-12-02 05:05:09,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:09,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:09,024 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-02 05:05:09,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:09,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:09,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:41 [2018-12-02 05:05:19,596 WARN L180 SmtUtils]: Spent 551.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-02 05:05:42,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:42,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:42,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:42,859 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-02 05:05:42,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:42,894 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:05:42,902 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-02 05:05:42,905 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:05:42,906 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-02 05:05:42,906 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:42,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:42,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 102 [2018-12-02 05:05:42,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:42,931 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 50 treesize of output 49 [2018-12-02 05:05:42,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:42,935 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 44 treesize of output 52 [2018-12-02 05:05:42,938 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-12-02 05:05:42,939 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-02 05:05:42,945 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:05:42,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 1 [2018-12-02 05:05:42,950 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:42,954 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-02 05:05:42,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:05:42,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, 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-02 05:05:42,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, 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-02 05:05:42,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:42,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 34 treesize of output 41 [2018-12-02 05:05:42,970 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:42,975 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:42,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:42,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:42,988 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-02 05:05:42,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02 05:05:42,990 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:42,997 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:43,004 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:43,019 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-02 05:05:43,021 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-02 05:05:43,021 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:43,027 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:43,028 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 30 treesize of output 28 [2018-12-02 05:05:43,029 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-02 05:05:43,030 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:43,039 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:43,056 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-02 05:05:43,056 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 5 variables, input treesize:149, output treesize:109 [2018-12-02 05:05:43,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:43,435 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 59 treesize of output 80 [2018-12-02 05:05:43,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 05:05:43,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:43,477 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 121 treesize of output 142 [2018-12-02 05:05:43,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 05:05:43,531 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-02 05:05:43,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:181, output treesize:381 [2018-12-02 05:05:43,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:43,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:43,658 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 146 treesize of output 103 [2018-12-02 05:05:43,664 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 45 treesize of output 74 [2018-12-02 05:05:43,664 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 05:05:43,683 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 49 treesize of output 42 [2018-12-02 05:05:43,683 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:43,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:43,702 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 46 [2018-12-02 05:05:43,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:43,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:43,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 69 treesize of output 63 [2018-12-02 05:05:43,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-02 05:05:43,756 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-02 05:05:43,764 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-02 05:05:43,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-12-02 05:05:43,801 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-02 05:05:43,802 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:43,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:43,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:43,812 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 27 treesize of output 24 [2018-12-02 05:05:43,812 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:05:43,819 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:05:43,850 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 37 [2018-12-02 05:05:43,851 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 21 treesize of output 15 [2018-12-02 05:05:43,852 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-02 05:05:43,859 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:43,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:43,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:43,890 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 134 treesize of output 97 [2018-12-02 05:05:43,896 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 39 treesize of output 36 [2018-12-02 05:05:43,896 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 05:05:43,915 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 31 treesize of output 24 [2018-12-02 05:05:43,915 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:43,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:43,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:05:43,933 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 50 [2018-12-02 05:05:43,934 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 05:05:43,950 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 05:05:44,047 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 52 treesize of output 46 [2018-12-02 05:05:44,049 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 21 treesize of output 15 [2018-12-02 05:05:44,049 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-12-02 05:05:44,058 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:44,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-02 05:05:44,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-02 05:05:44,061 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 05:05:44,067 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:05:44,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-12-02 05:05:44,095 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 16 variables, input treesize:441, output treesize:75 [2018-12-02 05:05:44,225 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:05:44,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:05:44,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2018-12-02 05:05:44,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-02 05:05:44,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-02 05:05:44,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1983, Unknown=34, NotChecked=0, Total=2162 [2018-12-02 05:05:44,241 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 47 states. [2018-12-02 05:06:56,309 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2018-12-02 05:06:59,803 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2018-12-02 05:07:05,214 WARN L180 SmtUtils]: Spent 3.48 s on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2018-12-02 05:07:21,528 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2018-12-02 05:07:24,612 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2018-12-02 05:07:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:24,853 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-12-02 05:07:24,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-02 05:07:24,853 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 50 [2018-12-02 05:07:24,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:24,854 INFO L225 Difference]: With dead ends: 115 [2018-12-02 05:07:24,854 INFO L226 Difference]: Without dead ends: 115 [2018-12-02 05:07:24,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1527 ImplicationChecksByTransitivity, 83.5s TimeCoverageRelationStatistics Valid=459, Invalid=5480, Unknown=67, NotChecked=0, Total=6006 [2018-12-02 05:07:24,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-02 05:07:24,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 87. [2018-12-02 05:07:24,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-02 05:07:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2018-12-02 05:07:24,857 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 50 [2018-12-02 05:07:24,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:24,857 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2018-12-02 05:07:24,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-02 05:07:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-12-02 05:07:24,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 05:07:24,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:24,857 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:24,858 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:07:24,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:24,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1254877546, now seen corresponding path program 1 times [2018-12-02 05:07:24,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:07:24,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:07:24,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:24,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:24,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:24,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:07:24,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/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-02 05:07:24,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:24,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:24,975 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-02 05:07:24,976 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-02 05:07:24,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:24,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:24,979 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-02 05:07:24,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-02 05:07:24,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:24,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:24,986 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-02 05:07:24,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:24,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:24,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-02 05:07:24,998 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-02 05:07:24,999 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-02 05:07:24,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:25,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:25,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:25,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-12-02 05:07:25,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:25,004 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-02 05:07:25,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:25,007 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-02 05:07:25,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-02 05:07:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:25,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:07:25,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 13 [2018-12-02 05:07:25,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 05:07:25,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 05:07:25,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:07:25,034 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 14 states. [2018-12-02 05:07:25,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:25,184 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-12-02 05:07:25,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:07:25,184 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2018-12-02 05:07:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:25,184 INFO L225 Difference]: With dead ends: 98 [2018-12-02 05:07:25,184 INFO L226 Difference]: Without dead ends: 98 [2018-12-02 05:07:25,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 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-02 05:07:25,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-02 05:07:25,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2018-12-02 05:07:25,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 05:07:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-12-02 05:07:25,186 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 51 [2018-12-02 05:07:25,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:25,186 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-12-02 05:07:25,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 05:07:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-12-02 05:07:25,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 05:07:25,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:25,187 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:25,187 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:07:25,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:25,187 INFO L82 PathProgramCache]: Analyzing trace with hash -963789100, now seen corresponding path program 1 times [2018-12-02 05:07:25,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:07:25,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:07:25,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:25,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:25,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 05:07:25,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:07:25,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/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-02 05:07:25,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:25,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:25,245 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 05:07:25,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 05:07:25,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-12-02 05:07:25,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:07:25,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:07:25,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:07:25,260 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 6 states. [2018-12-02 05:07:25,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:25,276 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-12-02 05:07:25,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:07:25,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-02 05:07:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:25,276 INFO L225 Difference]: With dead ends: 87 [2018-12-02 05:07:25,276 INFO L226 Difference]: Without dead ends: 87 [2018-12-02 05:07:25,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:07:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-02 05:07:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-02 05:07:25,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-02 05:07:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2018-12-02 05:07:25,279 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 55 [2018-12-02 05:07:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:25,279 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2018-12-02 05:07:25,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:07:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-12-02 05:07:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 05:07:25,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:25,279 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:25,280 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 05:07:25,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:25,280 INFO L82 PathProgramCache]: Analyzing trace with hash -963787848, now seen corresponding path program 1 times [2018-12-02 05:07:25,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:07:25,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:07:25,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:25,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:25,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:26,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:07:26,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/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-02 05:07:26,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:26,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:26,250 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-02 05:07:26,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:26,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:26,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:07:26,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:26,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:26,363 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-02 05:07:26,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:26,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:26,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-12-02 05:07:26,399 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-02 05:07:26,400 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-02 05:07:26,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:26,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:26,409 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-02 05:07:26,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-02 05:07:26,446 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-02 05:07:26,447 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-02 05:07:26,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:26,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:26,464 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-02 05:07:26,466 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-02 05:07:26,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:26,481 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-02 05:07:26,481 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-02 05:07:26,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:07:26,499 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-02 05:07:26,499 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:41, output treesize:71 [2018-12-02 05:07:26,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:26,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:26,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-12-02 05:07:26,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:26,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:26,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:44 [2018-12-02 05:07:39,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:39,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:39,113 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-02 05:07:39,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:39,147 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 86 treesize of output 85 [2018-12-02 05:07:39,149 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 29 treesize of output 32 [2018-12-02 05:07:39,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:39,152 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-02 05:07:39,152 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:39,156 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:39,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:39,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:39,173 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 85 treesize of output 84 [2018-12-02 05:07:39,175 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2018-12-02 05:07:39,176 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:39,185 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:39,192 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-02 05:07:39,196 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:07:39,202 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 121 treesize of output 107 [2018-12-02 05:07:39,205 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-02 05:07:39,205 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:39,220 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 86 treesize of output 77 [2018-12-02 05:07:39,222 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 20 treesize of output 12 [2018-12-02 05:07:39,222 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:07:39,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:39,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:39,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 58 treesize of output 95 [2018-12-02 05:07:39,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-02 05:07:39,443 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:07:39,443 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_17 input size 11 context size 11 output size 11 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-02 05:07:39,446 INFO L168 Benchmark]: Toolchain (without parser) took 308024.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -134.0 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-12-02 05:07:39,447 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:07:39,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -146.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-02 05:07:39,447 INFO L168 Benchmark]: Boogie Preprocessor took 30.27 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 05:07:39,447 INFO L168 Benchmark]: RCFGBuilder took 293.20 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2018-12-02 05:07:39,447 INFO L168 Benchmark]: TraceAbstraction took 307449.48 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -45.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-12-02 05:07:39,449 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 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -146.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.27 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 293.20 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 307449.48 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -45.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_17 input size 11 context size 11 output size 11 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_17 input size 11 context size 11 output size 11: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 05:07:40,723 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:07:40,725 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:07:40,731 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:07:40,731 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:07:40,732 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:07:40,732 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:07:40,733 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:07:40,734 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:07:40,734 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:07:40,735 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:07:40,735 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:07:40,735 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:07:40,736 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:07:40,737 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:07:40,737 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:07:40,737 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:07:40,738 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:07:40,739 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:07:40,740 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:07:40,740 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:07:40,741 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:07:40,742 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:07:40,742 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:07:40,742 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:07:40,743 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:07:40,743 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:07:40,744 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:07:40,744 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:07:40,745 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:07:40,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:07:40,745 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:07:40,745 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:07:40,745 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:07:40,746 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:07:40,746 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:07:40,747 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-12-02 05:07:40,754 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:07:40,754 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:07:40,754 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:07:40,755 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:07:40,755 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 05:07:40,755 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 05:07:40,755 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 05:07:40,755 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:07:40,755 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:07:40,756 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 05:07:40,756 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:07:40,756 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:07:40,756 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:07:40,756 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 05:07:40,756 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 05:07:40,756 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 05:07:40,756 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:07:40,756 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 05:07:40,757 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 05:07:40,757 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:07:40,757 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 05:07:40,757 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:07:40,757 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:07:40,757 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:07:40,757 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:07:40,757 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:07:40,758 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:07:40,758 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:07:40,758 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-02 05:07:40,758 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:07:40,758 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 05:07:40,758 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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_c8cc44f5-9360-4486-9122-4fa30632a2e4/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 -> f0eb6dcabc0b5a8d392af7836fd5c7e700568e57 [2018-12-02 05:07:40,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:07:40,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:07:40,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:07:40,790 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:07:40,791 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:07:40,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-12-02 05:07:40,834 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/data/01704a8d5/ab30172d639b44baa640c07a1ad9b72f/FLAGb1e1da4ce [2018-12-02 05:07:41,179 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:07:41,179 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/sv-benchmarks/c/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-12-02 05:07:41,185 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/data/01704a8d5/ab30172d639b44baa640c07a1ad9b72f/FLAGb1e1da4ce [2018-12-02 05:07:41,567 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/data/01704a8d5/ab30172d639b44baa640c07a1ad9b72f [2018-12-02 05:07:41,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:07:41,570 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 05:07:41,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:07:41,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:07:41,572 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:07:41,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:07:41" (1/1) ... [2018-12-02 05:07:41,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@197102f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41, skipping insertion in model container [2018-12-02 05:07:41,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:07:41" (1/1) ... [2018-12-02 05:07:41,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:07:41,603 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:07:41,756 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:07:41,762 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:07:41,786 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:07:41,839 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:07:41,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41 WrapperNode [2018-12-02 05:07:41,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:07:41,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:07:41,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:07:41,840 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:07:41,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... [2018-12-02 05:07:41,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... [2018-12-02 05:07:41,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... [2018-12-02 05:07:41,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... [2018-12-02 05:07:41,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... [2018-12-02 05:07:41,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... [2018-12-02 05:07:41,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... [2018-12-02 05:07:41,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:07:41,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:07:41,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:07:41,874 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:07:41,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/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-02 05:07:41,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 05:07:41,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:07:41,904 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-02 05:07:41,905 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 05:07:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-02 05:07:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 05:07:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 05:07:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 05:07:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 05:07:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 05:07:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 05:07:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 05:07:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 05:07:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 05:07:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 05:07:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 05:07:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 05:07:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 05:07:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 05:07:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 05:07:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 05:07:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 05:07:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 05:07:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 05:07:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 05:07:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 05:07:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 05:07:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 05:07:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 05:07:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 05:07:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 05:07:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 05:07:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 05:07:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 05:07:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 05:07:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 05:07:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 05:07:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 05:07:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 05:07:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 05:07:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 05:07:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 05:07:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 05:07:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 05:07:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 05:07:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 05:07:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 05:07:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 05:07:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 05:07:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 05:07:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 05:07:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 05:07:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 05:07:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 05:07:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 05:07:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 05:07:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 05:07:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 05:07:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 05:07:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 05:07:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 05:07:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 05:07:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 05:07:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 05:07:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 05:07:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 05:07:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 05:07:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 05:07:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 05:07:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-02 05:07:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 05:07:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 05:07:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 05:07:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 05:07:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 05:07:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 05:07:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 05:07:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 05:07:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 05:07:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 05:07:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 05:07:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 05:07:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 05:07:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 05:07:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 05:07:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 05:07:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 05:07:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 05:07:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 05:07:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 05:07:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 05:07:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 05:07:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 05:07:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 05:07:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 05:07:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 05:07:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 05:07:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 05:07:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 05:07:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 05:07:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 05:07:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 05:07:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 05:07:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 05:07:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 05:07:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 05:07:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-02 05:07:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-02 05:07:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:07:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 05:07:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 05:07:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 05:07:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 05:07:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 05:07:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 05:07:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:07:42,270 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:07:42,270 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 05:07:42,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:07:42 BoogieIcfgContainer [2018-12-02 05:07:42,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:07:42,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:07:42,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:07:42,273 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:07:42,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:07:41" (1/3) ... [2018-12-02 05:07:42,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8797ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:07:42, skipping insertion in model container [2018-12-02 05:07:42,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:41" (2/3) ... [2018-12-02 05:07:42,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8797ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:07:42, skipping insertion in model container [2018-12-02 05:07:42,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:07:42" (3/3) ... [2018-12-02 05:07:42,275 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_true-valid-memsafety_true-termination.i [2018-12-02 05:07:42,283 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:07:42,289 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-12-02 05:07:42,301 INFO L257 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2018-12-02 05:07:42,315 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 05:07:42,315 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:07:42,315 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 05:07:42,315 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:07:42,315 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:07:42,315 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:07:42,315 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:07:42,315 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:07:42,315 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:07:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-12-02 05:07:42,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 05:07:42,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:42,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:42,331 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:07:42,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:42,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2121791983, now seen corresponding path program 1 times [2018-12-02 05:07:42,337 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:07:42,337 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:07:42,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:42,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:42,424 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-02 05:07:42,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:42,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:42,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:07:42,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:42,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:42,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 05:07:42,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:42,458 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-02 05:07:42,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-02 05:07:42,472 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-02 05:07:42,472 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:07:42,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:42,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:07:42,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:07:42,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:07:42,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:42,486 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 5 states. [2018-12-02 05:07:42,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:42,750 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-12-02 05:07:42,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:07:42,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 05:07:42,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:42,756 INFO L225 Difference]: With dead ends: 85 [2018-12-02 05:07:42,757 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 05:07:42,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-02 05:07:42,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 05:07:42,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-02 05:07:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 05:07:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-12-02 05:07:42,781 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 9 [2018-12-02 05:07:42,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:42,781 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-12-02 05:07:42,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:07:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-12-02 05:07:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 05:07:42,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:42,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:42,782 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:07:42,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:42,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2121791984, now seen corresponding path program 1 times [2018-12-02 05:07:42,782 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:07:42,782 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:07:42,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:42,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:42,834 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-02 05:07:42,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:42,843 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-02 05:07:42,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:42,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:42,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 05:07:42,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:42,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:42,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02 05:07:42,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:42,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:42,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:42,889 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 13 treesize of output 4 [2018-12-02 05:07:42,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:42,900 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 1 xjuncts. [2018-12-02 05:07:42,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-12-02 05:07:42,913 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-02 05:07:42,913 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:07:42,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:42,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:07:42,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:07:42,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:07:42,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:42,916 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 5 states. [2018-12-02 05:07:43,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:43,231 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-12-02 05:07:43,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:07:43,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 05:07:43,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:43,233 INFO L225 Difference]: With dead ends: 98 [2018-12-02 05:07:43,233 INFO L226 Difference]: Without dead ends: 98 [2018-12-02 05:07:43,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-02 05:07:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-02 05:07:43,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2018-12-02 05:07:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-02 05:07:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-12-02 05:07:43,239 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 9 [2018-12-02 05:07:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:43,239 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-12-02 05:07:43,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:07:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-12-02 05:07:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 05:07:43,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:43,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:43,240 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:07:43,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:43,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1351042093, now seen corresponding path program 1 times [2018-12-02 05:07:43,240 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:07:43,240 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:07:43,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:43,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:43,291 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-02 05:07:43,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:07:43,299 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-02 05:07:43,300 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:07:43,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:43,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:07:43,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:07:43,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:07:43,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:43,301 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 3 states. [2018-12-02 05:07:43,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:43,396 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-12-02 05:07:43,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:07:43,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 05:07:43,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:43,396 INFO L225 Difference]: With dead ends: 83 [2018-12-02 05:07:43,397 INFO L226 Difference]: Without dead ends: 83 [2018-12-02 05:07:43,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:43,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-02 05:07:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-02 05:07:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 05:07:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-12-02 05:07:43,400 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 10 [2018-12-02 05:07:43,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:43,400 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-12-02 05:07:43,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:07:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-12-02 05:07:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 05:07:43,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:43,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:43,401 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:07:43,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:43,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1351042094, now seen corresponding path program 1 times [2018-12-02 05:07:43,402 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:07:43,402 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:07:43,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:43,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:43,449 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-02 05:07:43,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:07:43,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-02 05:07:43,458 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:07:43,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:43,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:07:43,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:07:43,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:07:43,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:43,460 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 3 states. [2018-12-02 05:07:43,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:43,545 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-12-02 05:07:43,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:07:43,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 05:07:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:43,546 INFO L225 Difference]: With dead ends: 79 [2018-12-02 05:07:43,546 INFO L226 Difference]: Without dead ends: 79 [2018-12-02 05:07:43,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-02 05:07:43,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-02 05:07:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-02 05:07:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 05:07:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-12-02 05:07:43,549 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 10 [2018-12-02 05:07:43,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:43,549 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-12-02 05:07:43,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:07:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-12-02 05:07:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 05:07:43,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:43,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:43,550 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:07:43,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:43,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1170422842, now seen corresponding path program 1 times [2018-12-02 05:07:43,550 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:07:43,551 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:07:43,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:43,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:43,691 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 23 treesize of output 33 [2018-12-02 05:07:43,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02 05:07:43,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,768 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 23 treesize of output 33 [2018-12-02 05:07:43,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-12-02 05:07:43,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,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 20 treesize of output 19 [2018-12-02 05:07:43,806 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,829 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-02 05:07:43,829 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-12-02 05:07:43,866 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 26 treesize of output 26 [2018-12-02 05:07:43,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-02 05:07:43,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,888 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-02 05:07:43,888 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,902 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-02 05:07:43,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,922 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 26 treesize of output 26 [2018-12-02 05:07:43,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-02 05:07:43,925 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,940 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-02 05:07:43,940 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,954 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-02 05:07:43,954 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,957 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:43,960 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2018-12-02 05:07:43,972 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-02 05:07:43,972 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:07:43,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:43,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 05:07:43,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:07:43,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:07:43,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=38, Unknown=5, NotChecked=0, Total=56 [2018-12-02 05:07:43,974 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 8 states. [2018-12-02 05:07:44,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:44,479 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-12-02 05:07:44,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:07:44,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-02 05:07:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:44,481 INFO L225 Difference]: With dead ends: 87 [2018-12-02 05:07:44,481 INFO L226 Difference]: Without dead ends: 87 [2018-12-02 05:07:44,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=95, Unknown=15, NotChecked=0, Total=156 [2018-12-02 05:07:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-02 05:07:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-12-02 05:07:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 05:07:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-12-02 05:07:44,485 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 15 [2018-12-02 05:07:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:44,486 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-12-02 05:07:44,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:07:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-12-02 05:07:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 05:07:44,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:44,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:44,486 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:07:44,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:44,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1923647858, now seen corresponding path program 1 times [2018-12-02 05:07:44,487 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:07:44,487 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:07:44,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:44,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:44,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:44,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 05:07:44,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:44,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:44,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:44,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-02 05:07:44,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:44,630 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 1 xjuncts. [2018-12-02 05:07:44,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-12-02 05:07:44,652 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-02 05:07:44,652 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:07:44,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:44,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:07:44,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:07:44,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:07:44,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:07:44,655 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 7 states. [2018-12-02 05:07:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:44,821 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-12-02 05:07:44,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:07:44,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-02 05:07:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:44,822 INFO L225 Difference]: With dead ends: 87 [2018-12-02 05:07:44,822 INFO L226 Difference]: Without dead ends: 87 [2018-12-02 05:07:44,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:07:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-02 05:07:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-02 05:07:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-02 05:07:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-12-02 05:07:44,826 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 16 [2018-12-02 05:07:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:44,826 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-12-02 05:07:44,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:07:44,826 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-12-02 05:07:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 05:07:44,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:44,826 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] [2018-12-02 05:07:44,827 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:07:44,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:44,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1399804511, now seen corresponding path program 1 times [2018-12-02 05:07:44,827 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:07:44,827 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:07:44,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:44,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:44,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 05:07:44,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:44,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:44,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-02 05:07:44,921 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-02 05:07:44,922 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-02 05:07:44,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:44,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:44,928 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-02 05:07:44,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-02 05:07:44,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 05:07:44,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-02 05:07:44,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:44,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:44,951 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-02 05:07:44,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-02 05:07:44,958 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-02 05:07:44,958 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:07:44,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:44,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:07:44,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:07:44,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:07:44,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:07:44,961 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 8 states. [2018-12-02 05:07:45,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:45,265 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-12-02 05:07:45,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:07:45,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-12-02 05:07:45,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:45,266 INFO L225 Difference]: With dead ends: 93 [2018-12-02 05:07:45,266 INFO L226 Difference]: Without dead ends: 93 [2018-12-02 05:07:45,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:07:45,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-02 05:07:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2018-12-02 05:07:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 05:07:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-12-02 05:07:45,273 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 23 [2018-12-02 05:07:45,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:45,273 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-12-02 05:07:45,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:07:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-12-02 05:07:45,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 05:07:45,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:45,274 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] [2018-12-02 05:07:45,275 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:07:45,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:45,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1399804510, now seen corresponding path program 1 times [2018-12-02 05:07:45,275 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:07:45,275 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:07:45,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:45,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:45,395 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-02 05:07:45,397 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-02 05:07:45,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:45,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:45,413 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-02 05:07:45,415 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-02 05:07:45,415 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:45,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:45,425 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-02 05:07:45,425 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-02 05:07:45,460 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-02 05:07:45,462 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-02 05:07:45,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:45,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:45,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 05:07:45,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 05:07:45,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:45,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:45,483 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-02 05:07:45,483 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-02 05:07:45,502 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-02 05:07:45,502 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:07:45,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:45,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:07:45,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:07:45,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:07:45,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:07:45,505 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 8 states. [2018-12-02 05:07:46,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:46,014 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-12-02 05:07:46,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:07:46,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-12-02 05:07:46,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:46,016 INFO L225 Difference]: With dead ends: 95 [2018-12-02 05:07:46,016 INFO L226 Difference]: Without dead ends: 95 [2018-12-02 05:07:46,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:07:46,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-02 05:07:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2018-12-02 05:07:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-02 05:07:46,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-12-02 05:07:46,018 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 23 [2018-12-02 05:07:46,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:46,019 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-12-02 05:07:46,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:07:46,019 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-12-02 05:07:46,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 05:07:46,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:46,019 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-02 05:07:46,019 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:07:46,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:46,020 INFO L82 PathProgramCache]: Analyzing trace with hash -443336737, now seen corresponding path program 1 times [2018-12-02 05:07:46,020 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:07:46,020 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:07:46,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:46,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:46,087 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-02 05:07:46,087 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:07:46,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:46,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:07:46,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:07:46,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:07:46,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:07:46,089 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 4 states. [2018-12-02 05:07:46,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:46,111 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2018-12-02 05:07:46,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:07:46,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-12-02 05:07:46,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:46,113 INFO L225 Difference]: With dead ends: 116 [2018-12-02 05:07:46,113 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 05:07:46,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:07:46,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 05:07:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2018-12-02 05:07:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 05:07:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2018-12-02 05:07:46,118 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 24 [2018-12-02 05:07:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:46,118 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2018-12-02 05:07:46,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:07:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2018-12-02 05:07:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 05:07:46,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:46,119 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-02 05:07:46,119 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:07:46,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:46,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1738714273, now seen corresponding path program 1 times [2018-12-02 05:07:46,119 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:07:46,119 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:07:46,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:46,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:46,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 05:07:46,242 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-02 05:07:46,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:46,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:46,259 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-02 05:07:46,262 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-02 05:07:46,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:46,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:46,272 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-02 05:07:46,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-02 05:07:46,351 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-02 05:07:46,353 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-02 05:07:46,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:46,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:46,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 05:07:46,367 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-02 05:07:46,367 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:46,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:46,373 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-02 05:07:46,373 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-02 05:07:46,390 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-02 05:07:46,390 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:07:46,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:46,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 05:07:46,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:07:46,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:07:46,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:07:46,393 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand 9 states. [2018-12-02 05:07:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:46,907 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2018-12-02 05:07:46,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:07:46,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-12-02 05:07:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:46,908 INFO L225 Difference]: With dead ends: 110 [2018-12-02 05:07:46,909 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 05:07:46,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:07:46,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 05:07:46,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-12-02 05:07:46,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 05:07:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2018-12-02 05:07:46,913 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 26 [2018-12-02 05:07:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:46,913 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2018-12-02 05:07:46,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:07:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2018-12-02 05:07:46,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 05:07:46,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:46,914 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-02 05:07:46,914 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:07:46,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:46,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1738714274, now seen corresponding path program 1 times [2018-12-02 05:07:46,915 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:07:46,915 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:07:46,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:47,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:47,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 05:07:47,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-02 05:07:47,033 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-02 05:07:47,034 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-02 05:07:47,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,040 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-02 05:07:47,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-02 05:07:47,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 05:07:47,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-02 05:07:47,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,062 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-02 05:07:47,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-02 05:07:47,070 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-02 05:07:47,070 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:07:47,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:47,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:07:47,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:07:47,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:07:47,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:07:47,072 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand 8 states. [2018-12-02 05:07:47,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:47,411 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2018-12-02 05:07:47,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:07:47,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-02 05:07:47,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:47,413 INFO L225 Difference]: With dead ends: 106 [2018-12-02 05:07:47,413 INFO L226 Difference]: Without dead ends: 106 [2018-12-02 05:07:47,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:07:47,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-02 05:07:47,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2018-12-02 05:07:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 05:07:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2018-12-02 05:07:47,417 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 26 [2018-12-02 05:07:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:47,417 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2018-12-02 05:07:47,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:07:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2018-12-02 05:07:47,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 05:07:47,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:47,418 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-02 05:07:47,418 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:07:47,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:47,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1934432356, now seen corresponding path program 1 times [2018-12-02 05:07:47,419 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:07:47,419 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:07:47,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:47,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:47,535 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-02 05:07:47,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:07:47,579 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-02 05:07:47,581 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-02 05:07:47,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-12-02 05:07:47,650 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-02 05:07:47,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-02 05:07:47,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,694 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-02 05:07:47,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02 05:07:47,696 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,707 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-02 05:07:47,707 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2018-12-02 05:07:47,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:47,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:47,728 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-02 05:07:47,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-12-02 05:07:47,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-12-02 05:07:47,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-02 05:07:47,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,773 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-02 05:07:47,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2018-12-02 05:07:47,798 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-02 05:07:47,800 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-02 05:07:47,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,806 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-02 05:07:47,806 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:47,812 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-02 05:07:47,812 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:3 [2018-12-02 05:07:47,827 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-02 05:07:47,827 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:07:47,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:47,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 05:07:47,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 05:07:47,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 05:07:47,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:07:47,829 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 11 states. [2018-12-02 05:07:48,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:48,450 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-12-02 05:07:48,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:07:48,451 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-12-02 05:07:48,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:48,452 INFO L225 Difference]: With dead ends: 108 [2018-12-02 05:07:48,452 INFO L226 Difference]: Without dead ends: 108 [2018-12-02 05:07:48,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:07:48,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-02 05:07:48,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2018-12-02 05:07:48,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 05:07:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2018-12-02 05:07:48,454 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 27 [2018-12-02 05:07:48,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:48,455 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2018-12-02 05:07:48,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 05:07:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2018-12-02 05:07:48,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 05:07:48,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:48,455 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-02 05:07:48,456 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:07:48,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:48,456 INFO L82 PathProgramCache]: Analyzing trace with hash -162139042, now seen corresponding path program 1 times [2018-12-02 05:07:48,456 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:07:48,456 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:07:48,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:48,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:48,561 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-02 05:07:48,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:48,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:48,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:07:48,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 05:07:48,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:48,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:48,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-12-02 05:07:48,650 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-02 05:07:48,652 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-02 05:07:48,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:48,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:48,669 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-02 05:07:48,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:35 [2018-12-02 05:07:48,700 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-02 05:07:48,702 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-02 05:07:48,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:48,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:48,744 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 23 treesize of output 35 [2018-12-02 05:07:48,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 24 treesize of output 23 [2018-12-02 05:07:48,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:48,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:48,790 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-02 05:07:48,790 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:37 [2018-12-02 05:07:48,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:48,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:48,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-02 05:07:48,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:48,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:48,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:37 [2018-12-02 05:07:48,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 15 treesize of output 11 [2018-12-02 05:07:48,865 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-02 05:07:48,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:48,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:48,876 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-02 05:07:48,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:37 [2018-12-02 05:07:48,897 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 33 treesize of output 24 [2018-12-02 05:07:48,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-02 05:07:48,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:48,904 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-02 05:07:48,904 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:48,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:48,909 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-02 05:07:48,909 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:38, output treesize:11 [2018-12-02 05:07:48,928 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-02 05:07:48,928 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:07:48,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:48,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:07:48,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:07:48,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:07:48,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:07:48,931 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand 12 states. [2018-12-02 05:07:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:49,602 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2018-12-02 05:07:49,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:07:49,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-12-02 05:07:49,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:49,603 INFO L225 Difference]: With dead ends: 130 [2018-12-02 05:07:49,603 INFO L226 Difference]: Without dead ends: 130 [2018-12-02 05:07:49,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:07:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-02 05:07:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 109. [2018-12-02 05:07:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 05:07:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2018-12-02 05:07:49,606 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 28 [2018-12-02 05:07:49,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:49,606 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2018-12-02 05:07:49,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:07:49,606 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2018-12-02 05:07:49,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 05:07:49,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:49,607 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-02 05:07:49,607 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:07:49,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:49,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2046487605, now seen corresponding path program 1 times [2018-12-02 05:07:49,607 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:07:49,607 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:07:49,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:49,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:49,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 05:07:49,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:49,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:49,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-02 05:07:49,732 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-02 05:07:49,733 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-02 05:07:49,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:49,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:49,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-02 05:07:49,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-02 05:07:49,770 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-02 05:07:49,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:49,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:49,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-12-02 05:07:49,834 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 37 [2018-12-02 05:07:49,837 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-02 05:07:49,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:49,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:49,875 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-02 05:07:49,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:26 [2018-12-02 05:07:49,909 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-02 05:07:49,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-12-02 05:07:49,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:49,929 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-02 05:07:49,929 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:49,943 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-02 05:07:49,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:49,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:49,949 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-02 05:07:49,949 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-12-02 05:07:49,966 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-02 05:07:49,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:07:50,127 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 11 treesize of output 9 [2018-12-02 05:07:50,129 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 9 treesize of output 7 [2018-12-02 05:07:50,129 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-02 05:07:50,131 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-02 05:07:50,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-02 05:07:50,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:50 [2018-12-02 05:07:50,208 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 17 treesize of output 12 [2018-12-02 05:07:50,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:50,220 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 17 treesize of output 12 [2018-12-02 05:07:50,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:50,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:07:50,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-12-02 05:07:50,232 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 10 treesize of output 3 [2018-12-02 05:07:50,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:50,233 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 10 treesize of output 3 [2018-12-02 05:07:50,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:50,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:07:50,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2018-12-02 05:07:50,239 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-02 05:07:50,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:07:50,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-12-02 05:07:50,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 05:07:50,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 05:07:50,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-02 05:07:50,242 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand 17 states. [2018-12-02 05:07:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:51,369 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2018-12-02 05:07:51,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 05:07:51,369 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-12-02 05:07:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:51,369 INFO L225 Difference]: With dead ends: 120 [2018-12-02 05:07:51,369 INFO L226 Difference]: Without dead ends: 120 [2018-12-02 05:07:51,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-12-02 05:07:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-02 05:07:51,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2018-12-02 05:07:51,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-02 05:07:51,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2018-12-02 05:07:51,373 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 29 [2018-12-02 05:07:51,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:51,373 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2018-12-02 05:07:51,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 05:07:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2018-12-02 05:07:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 05:07:51,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:51,373 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-02 05:07:51,374 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:07:51,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:51,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2046487604, now seen corresponding path program 1 times [2018-12-02 05:07:51,374 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:07:51,374 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:07:51,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:51,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:07:51,503 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-02 05:07:51,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:51,515 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-02 05:07:51,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:51,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:51,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-12-02 05:07:51,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:51,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 05:07:51,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:51,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:51,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:51,560 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-02 05:07:51,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:51,572 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 1 xjuncts. [2018-12-02 05:07:51,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-12-02 05:07:51,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02 05:07:51,622 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-02 05:07:51,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:51,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:51,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 05:07:51,646 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-02 05:07:51,646 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:51,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:51,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:07:51,660 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:41 [2018-12-02 05:07:51,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:51,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 36 [2018-12-02 05:07:51,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:51,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:51,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:07:51,769 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 17 treesize of output 8 [2018-12-02 05:07:51,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:51,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:07:51,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:46 [2018-12-02 05:07:51,890 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 35 treesize of output 43 [2018-12-02 05:07:51,893 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 36 treesize of output 35 [2018-12-02 05:07:51,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:51,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:51,987 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 23 treesize of output 33 [2018-12-02 05:07:51,990 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-02 05:07:51,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:52,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:52,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:07:52,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2018-12-02 05:07:52,103 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 26 treesize of output 26 [2018-12-02 05:07:52,107 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-02 05:07:52,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:52,136 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-02 05:07:52,136 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:52,156 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-02 05:07:52,156 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:52,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:52,192 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 38 treesize of output 36 [2018-12-02 05:07:52,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2018-12-02 05:07:52,202 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:52,220 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:52,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:07:52,226 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:68, output treesize:20 [2018-12-02 05:07:52,261 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-02 05:07:52,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:07:53,410 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-12-02 05:07:53,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-02 05:07:53,418 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 11 treesize of output 7 [2018-12-02 05:07:53,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:53,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:53,425 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 25 treesize of output 21 [2018-12-02 05:07:53,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-02 05:07:53,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:53,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-02 05:07:53,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-02 05:07:53,445 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:53,455 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:53,597 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 19 treesize of output 17 [2018-12-02 05:07:53,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-02 05:07:53,599 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:53,602 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:53,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-02 05:07:53,606 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 7 treesize of output 5 [2018-12-02 05:07:53,606 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:53,609 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:07:53,716 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-02 05:07:53,719 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 16 treesize of output 14 [2018-12-02 05:07:53,719 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:07:53,733 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:07:53,736 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 28 treesize of output 26 [2018-12-02 05:07:53,739 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 16 treesize of output 14 [2018-12-02 05:07:53,739 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-02 05:07:53,751 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-02 05:07:53,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-12-02 05:07:53,866 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 12 treesize of output 10 [2018-12-02 05:07:53,867 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-02 05:07:53,877 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-02 05:07:53,880 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 24 treesize of output 22 [2018-12-02 05:07:53,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-02 05:07:53,883 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:07:53,894 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:07:54,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 13 dim-0 vars, and 9 xjuncts. [2018-12-02 05:07:54,019 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2018-12-02 05:07:54,310 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2018-12-02 05:07:54,315 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:07:54,315 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:07:54,316 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 18 treesize of output 9 [2018-12-02 05:07:54,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:54,375 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:07:54,375 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:07:54,375 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 16 treesize of output 7 [2018-12-02 05:07:54,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:54,428 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:07:54,428 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:07:54,429 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 23 treesize of output 14 [2018-12-02 05:07:54,429 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:54,479 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:07:54,479 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:07:54,480 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 11 [2018-12-02 05:07:54,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:54,525 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:07:54,525 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:07:54,526 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 16 treesize of output 7 [2018-12-02 05:07:54,526 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:07:54,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2018-12-02 05:07:54,602 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:94, output treesize:33 [2018-12-02 05:07:54,924 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-02 05:07:54,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:07:54,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-12-02 05:07:54,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 05:07:54,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 05:07:54,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:07:54,928 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand 21 states. [2018-12-02 05:07:55,809 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2018-12-02 05:07:56,387 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 55 [2018-12-02 05:08:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:08:01,459 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2018-12-02 05:08:01,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 05:08:01,461 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2018-12-02 05:08:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:08:01,461 INFO L225 Difference]: With dead ends: 139 [2018-12-02 05:08:01,461 INFO L226 Difference]: Without dead ends: 139 [2018-12-02 05:08:01,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2018-12-02 05:08:01,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-02 05:08:01,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 112. [2018-12-02 05:08:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-02 05:08:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2018-12-02 05:08:01,464 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 29 [2018-12-02 05:08:01,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:08:01,464 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2018-12-02 05:08:01,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 05:08:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2018-12-02 05:08:01,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 05:08:01,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:08:01,465 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-02 05:08:01,465 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:08:01,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:08:01,466 INFO L82 PathProgramCache]: Analyzing trace with hash -731342937, now seen corresponding path program 1 times [2018-12-02 05:08:01,466 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:08:01,466 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:08:01,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:08:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:08:01,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:08:01,585 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-02 05:08:01,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:01,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:01,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:08:01,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:08:01,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:08:01,631 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-02 05:08:01,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:01,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:01,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-12-02 05:08:01,666 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-02 05:08:01,668 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-02 05:08:01,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:01,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:01,686 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-02 05:08:01,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-12-02 05:08:01,744 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-02 05:08:01,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 21 treesize of output 20 [2018-12-02 05:08:01,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:01,800 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-02 05:08:01,801 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 05:08:01,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:08:01,877 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-02 05:08:01,879 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-02 05:08:01,880 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:01,883 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:01,909 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-02 05:08:01,909 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:43, output treesize:71 [2018-12-02 05:08:01,958 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 05:08:01,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:01,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:08:01,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:08:01,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-02 05:08:01,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:01,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:01,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:38 [2018-12-02 05:08:02,019 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-02 05:08:02,021 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-02 05:08:02,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:02,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:02,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:02,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 [2018-12-02 05:08:02,058 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 32 treesize of output 23 [2018-12-02 05:08:02,059 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-02 05:08:02,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:02,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-02 05:08:02,064 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:02,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:02,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:02,068 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:37, output treesize:10 [2018-12-02 05:08:02,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:08:02,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02 05:08:02,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:02,090 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-02 05:08:02,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-02 05:08:02,118 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-02 05:08:02,118 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:08:02,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:08:02,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 05:08:02,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 05:08:02,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 05:08:02,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:08:02,121 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand 13 states. [2018-12-02 05:08:06,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:08:06,962 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2018-12-02 05:08:06,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 05:08:06,963 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-12-02 05:08:06,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:08:06,963 INFO L225 Difference]: With dead ends: 139 [2018-12-02 05:08:06,963 INFO L226 Difference]: Without dead ends: 139 [2018-12-02 05:08:06,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-12-02 05:08:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-02 05:08:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 113. [2018-12-02 05:08:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-02 05:08:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2018-12-02 05:08:06,966 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 29 [2018-12-02 05:08:06,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:08:06,966 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2018-12-02 05:08:06,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 05:08:06,967 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2018-12-02 05:08:06,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 05:08:06,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:08:06,967 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-02 05:08:06,968 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:08:06,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:08:06,968 INFO L82 PathProgramCache]: Analyzing trace with hash -731342936, now seen corresponding path program 1 times [2018-12-02 05:08:06,968 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:08:06,968 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:08:06,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:08:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:08:07,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:08:07,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-02 05:08:07,020 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:08:07,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:08:07,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:08:07,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:08:07,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:08:07,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:08:07,022 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand 3 states. [2018-12-02 05:08:07,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:08:07,129 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-12-02 05:08:07,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:08:07,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 05:08:07,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:08:07,130 INFO L225 Difference]: With dead ends: 109 [2018-12-02 05:08:07,130 INFO L226 Difference]: Without dead ends: 109 [2018-12-02 05:08:07,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-02 05:08:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-02 05:08:07,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2018-12-02 05:08:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 05:08:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-12-02 05:08:07,132 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 29 [2018-12-02 05:08:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:08:07,132 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-12-02 05:08:07,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:08:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-12-02 05:08:07,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 05:08:07,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:08:07,133 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-02 05:08:07,133 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:08:07,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:08:07,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1196794558, now seen corresponding path program 1 times [2018-12-02 05:08:07,134 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:08:07,134 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:08:07,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:08:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:08:07,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:08:07,227 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-02 05:08:07,228 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-02 05:08:07,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:07,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:07,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:07,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 05:08:07,244 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-02 05:08:07,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 05:08:07,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:07,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:07,247 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-02 05:08:07,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-02 05:08:07,252 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-02 05:08:07,253 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:08:07,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:08:07,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:08:07,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:08:07,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:08:07,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:08:07,255 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 7 states. [2018-12-02 05:08:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:08:07,405 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-12-02 05:08:07,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:08:07,406 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-12-02 05:08:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:08:07,406 INFO L225 Difference]: With dead ends: 116 [2018-12-02 05:08:07,406 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 05:08:07,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:08:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 05:08:07,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2018-12-02 05:08:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 05:08:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2018-12-02 05:08:07,408 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 30 [2018-12-02 05:08:07,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:08:07,408 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2018-12-02 05:08:07,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:08:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2018-12-02 05:08:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 05:08:07,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:08:07,408 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-02 05:08:07,409 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:08:07,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:08:07,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1554074439, now seen corresponding path program 1 times [2018-12-02 05:08:07,409 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:08:07,409 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:08:07,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:08:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:08:07,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:08:07,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 6 treesize of output 5 [2018-12-02 05:08:07,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:07,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:07,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-02 05:08:07,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:08:07,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:08:07,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:08:07,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-12-02 05:08:07,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:07,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:07,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2018-12-02 05:08:07,615 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 11 treesize of output 8 [2018-12-02 05:08:07,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-02 05:08:07,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:07,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:07,639 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-02 05:08:07,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-12-02 05:08:07,690 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 28 treesize of output 38 [2018-12-02 05:08:07,693 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 29 treesize of output 28 [2018-12-02 05:08:07,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:07,733 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-02 05:08:07,733 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 05:08:07,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:08:07,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:08:07,762 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:63 [2018-12-02 05:08:07,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:08:07,905 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 30 treesize of output 51 [2018-12-02 05:08:07,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 05:08:07,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:08:07,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:133 [2018-12-02 05:08:08,018 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 88 treesize of output 82 [2018-12-02 05:08:08,031 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-02 05:08:08,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:08,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:08,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:08:08,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 49 [2018-12-02 05:08:08,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-12-02 05:08:08,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:08,123 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-02 05:08:08,124 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:08,128 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:08,171 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 78 treesize of output 62 [2018-12-02 05:08:08,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 60 [2018-12-02 05:08:08,182 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 05:08:08,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-12-02 05:08:08,250 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-02 05:08:08,252 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:08,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:08:08,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:08:08,326 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 1 case distinctions, treesize of input 54 treesize of output 61 [2018-12-02 05:08:08,326 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 05:08:08,381 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-02 05:08:08,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 35 treesize of output 31 [2018-12-02 05:08:08,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, 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-02 05:08:08,450 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:08,463 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:08,465 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 39 treesize of output 35 [2018-12-02 05:08:08,467 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-02 05:08:08,467 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:08,477 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:08,479 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 39 [2018-12-02 05:08:08,481 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 22 treesize of output 13 [2018-12-02 05:08:08,481 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:08,490 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:08,492 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 29 treesize of output 27 [2018-12-02 05:08:08,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 05:08:08,494 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:08,500 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:08,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2018-12-02 05:08:08,553 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 6 variables, input treesize:167, output treesize:122 [2018-12-02 05:08:08,677 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-02 05:08:08,677 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:08:08,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:08:08,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 05:08:08,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 05:08:08,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 05:08:08,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:08:08,680 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 14 states. [2018-12-02 05:08:09,551 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2018-12-02 05:08:09,772 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2018-12-02 05:08:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:08:10,072 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2018-12-02 05:08:10,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 05:08:10,073 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-12-02 05:08:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:08:10,073 INFO L225 Difference]: With dead ends: 121 [2018-12-02 05:08:10,073 INFO L226 Difference]: Without dead ends: 121 [2018-12-02 05:08:10,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-12-02 05:08:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-02 05:08:10,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2018-12-02 05:08:10,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 05:08:10,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-12-02 05:08:10,076 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 31 [2018-12-02 05:08:10,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:08:10,076 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-12-02 05:08:10,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 05:08:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-12-02 05:08:10,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 05:08:10,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:08:10,076 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-02 05:08:10,076 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:08:10,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:08:10,077 INFO L82 PathProgramCache]: Analyzing trace with hash 931667429, now seen corresponding path program 1 times [2018-12-02 05:08:10,077 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:08:10,077 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:08:10,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:08:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:08:10,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:08:10,187 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-02 05:08:10,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:10,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:10,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:08:10,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 05:08:10,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:10,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:10,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2018-12-02 05:08:10,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-02 05:08:10,221 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-02 05:08:10,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:10,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:10,229 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-02 05:08:10,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-02 05:08:10,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:08:10,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:08:10,243 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-02 05:08:10,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:10,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:10,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-02 05:08:10,266 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-02 05:08:10,268 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-02 05:08:10,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:10,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:10,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:10,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-12-02 05:08:10,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:08:10,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-12-02 05:08:10,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:10,298 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-02 05:08:10,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-12-02 05:08:10,319 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-02 05:08:10,319 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:08:10,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:08:10,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 05:08:10,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:08:10,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:08:10,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:08:10,322 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 9 states. [2018-12-02 05:08:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:08:14,743 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-12-02 05:08:14,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:08:14,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-12-02 05:08:14,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:08:14,745 INFO L225 Difference]: With dead ends: 106 [2018-12-02 05:08:14,745 INFO L226 Difference]: Without dead ends: 106 [2018-12-02 05:08:14,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:08:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-02 05:08:14,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-12-02 05:08:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 05:08:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-12-02 05:08:14,748 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 32 [2018-12-02 05:08:14,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:08:14,748 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-12-02 05:08:14,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:08:14,748 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-12-02 05:08:14,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 05:08:14,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:08:14,748 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] [2018-12-02 05:08:14,749 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:08:14,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:08:14,749 INFO L82 PathProgramCache]: Analyzing trace with hash -657144433, now seen corresponding path program 1 times [2018-12-02 05:08:14,749 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:08:14,749 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:08:14,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:08:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:08:14,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:08:14,936 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-02 05:08:14,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:14,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:14,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:08:15,049 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 11 treesize of output 8 [2018-12-02 05:08:15,051 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-02 05:08:15,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:15,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:15,080 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-02 05:08:15,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:59 [2018-12-02 05:08:15,166 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 45 treesize of output 53 [2018-12-02 05:08:15,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-12-02 05:08:15,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:15,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:08:15,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2018-12-02 05:08:15,230 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-02 05:08:15,292 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-02 05:08:15,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 05:08:15,328 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:153 [2018-12-02 05:08:18,134 WARN L180 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2018-12-02 05:08:18,619 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 49 treesize of output 45 [2018-12-02 05:08:18,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-12-02 05:08:18,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:18,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:08:18,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:08:18,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 72 [2018-12-02 05:08:18,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2018-12-02 05:08:18,676 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 05:08:18,723 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 53 treesize of output 40 [2018-12-02 05:08:18,723 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:18,726 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 62 treesize of output 49 [2018-12-02 05:08:18,727 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:08:18,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 05:08:18,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 05:08:18,836 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:125, output treesize:118 [2018-12-02 05:08:39,862 WARN L180 SmtUtils]: Spent 20.91 s on a formula simplification that was a NOOP. DAG size: 45 [2018-12-02 05:08:43,965 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-02 05:08:59,532 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 30 [2018-12-02 05:09:29,702 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-02 05:09:29,709 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-02 05:09:29,709 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:09:29,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:09:29,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-02 05:09:29,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 05:09:29,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 05:09:29,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=273, Unknown=17, NotChecked=0, Total=342 [2018-12-02 05:09:29,712 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 19 states. [2018-12-02 05:09:42,322 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-12-02 05:11:04,814 WARN L180 SmtUtils]: Spent 44.91 s on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2018-12-02 05:11:15,201 WARN L180 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-12-02 05:11:19,355 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-12-02 05:11:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:11:28,067 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-12-02 05:11:28,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 05:11:28,068 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-12-02 05:11:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:11:28,068 INFO L225 Difference]: With dead ends: 107 [2018-12-02 05:11:28,069 INFO L226 Difference]: Without dead ends: 91 [2018-12-02 05:11:28,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 142.6s TimeCoverageRelationStatistics Valid=104, Invalid=686, Unknown=22, NotChecked=0, Total=812 [2018-12-02 05:11:28,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-02 05:11:28,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-12-02 05:11:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-02 05:11:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-12-02 05:11:28,070 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 36 [2018-12-02 05:11:28,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:11:28,071 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-12-02 05:11:28,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 05:11:28,071 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-12-02 05:11:28,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 05:11:28,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:11:28,071 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] [2018-12-02 05:11:28,071 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:11:28,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:11:28,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1779192686, now seen corresponding path program 1 times [2018-12-02 05:11:28,071 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:11:28,071 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:11:28,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:11:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:11:28,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:11:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 05:11:28,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:11:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 05:11:28,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:11:28,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-02 05:11:28,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:11:28,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:11:28,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:11:28,198 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 8 states. [2018-12-02 05:11:28,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:11:28,324 INFO L93 Difference]: Finished difference Result 248 states and 276 transitions. [2018-12-02 05:11:28,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:11:28,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-12-02 05:11:28,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:11:28,325 INFO L225 Difference]: With dead ends: 248 [2018-12-02 05:11:28,325 INFO L226 Difference]: Without dead ends: 248 [2018-12-02 05:11:28,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:11:28,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-12-02 05:11:28,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 146. [2018-12-02 05:11:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-02 05:11:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2018-12-02 05:11:28,329 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 38 [2018-12-02 05:11:28,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:11:28,330 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2018-12-02 05:11:28,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:11:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2018-12-02 05:11:28,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 05:11:28,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:11:28,330 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] [2018-12-02 05:11:28,331 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:11:28,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:11:28,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2092637813, now seen corresponding path program 1 times [2018-12-02 05:11:28,331 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:11:28,331 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:11:28,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:11:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:11:28,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:11:28,465 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-02 05:11:28,466 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-02 05:11:28,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:28,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:28,473 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-02 05:11:28,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-12-02 05:11:28,572 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-02 05:11:28,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:11:28,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-02 05:11:28,880 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 6 treesize of output 1 [2018-12-02 05:11:28,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:28,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:28,884 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 12 treesize of output 10 [2018-12-02 05:11:28,886 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 6 treesize of output 1 [2018-12-02 05:11:28,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:28,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:28,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 05:11:28,902 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2018-12-02 05:11:28,909 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-02 05:11:28,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:11:28,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2018-12-02 05:11:28,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 05:11:28,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 05:11:28,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:11:28,913 INFO L87 Difference]: Start difference. First operand 146 states and 179 transitions. Second operand 18 states. [2018-12-02 05:11:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:11:30,326 INFO L93 Difference]: Finished difference Result 122 states and 143 transitions. [2018-12-02 05:11:30,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 05:11:30,327 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-12-02 05:11:30,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:11:30,327 INFO L225 Difference]: With dead ends: 122 [2018-12-02 05:11:30,327 INFO L226 Difference]: Without dead ends: 122 [2018-12-02 05:11:30,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 05:11:30,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-02 05:11:30,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2018-12-02 05:11:30,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-02 05:11:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2018-12-02 05:11:30,329 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 41 [2018-12-02 05:11:30,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:11:30,329 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2018-12-02 05:11:30,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 05:11:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2018-12-02 05:11:30,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 05:11:30,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:11:30,330 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] [2018-12-02 05:11:30,330 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:11:30,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:11:30,330 INFO L82 PathProgramCache]: Analyzing trace with hash 113290053, now seen corresponding path program 1 times [2018-12-02 05:11:30,331 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:11:30,331 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:11:30,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:11:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:11:30,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:11:30,506 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-02 05:11:30,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:30,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:30,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:11:30,555 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-02 05:11:30,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 05:11:30,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:30,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:30,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:30,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-02 05:11:30,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 05:11:30,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 05:11:30,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:30,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:30,649 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-02 05:11:30,652 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 21 treesize of output 22 [2018-12-02 05:11:30,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:30,681 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-02 05:11:30,682 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:30,692 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:30,702 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-02 05:11:30,703 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:47, output treesize:46 [2018-12-02 05:11:30,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:30,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:30,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-02 05:11:30,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:30,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:30,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:46 [2018-12-02 05:11:31,428 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-02 05:11:31,440 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-02 05:11:31,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:31,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:31,535 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-02 05:11:31,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:135 [2018-12-02 05:11:31,976 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2018-12-02 05:11:31,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:31,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:31,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:31,994 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 26 treesize of output 29 [2018-12-02 05:11:31,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:32,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72 [2018-12-02 05:11:32,047 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 72 treesize of output 64 [2018-12-02 05:11:32,047 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-02 05:11:32,072 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:11:32,150 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 59 treesize of output 75 [2018-12-02 05:11:32,153 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 29 treesize of output 36 [2018-12-02 05:11:32,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:32,158 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:11:32,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 86 [2018-12-02 05:11:32,158 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:32,166 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:32,193 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:11:32,200 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 78 treesize of output 87 [2018-12-02 05:11:32,203 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 60 treesize of output 51 [2018-12-02 05:11:32,203 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:32,217 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:32,227 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-02 05:11:32,250 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-02 05:11:32,250 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:180, output treesize:78 [2018-12-02 05:11:32,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-12-02 05:11:32,336 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 48 treesize of output 35 [2018-12-02 05:11:32,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:32,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:32,356 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-02 05:11:32,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:60 [2018-12-02 05:11:32,439 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 54 treesize of output 48 [2018-12-02 05:11:32,442 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-02 05:11:32,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:32,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:32,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-12-02 05:11:32,454 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:32,460 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-02 05:11:32,460 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:32,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:32,468 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-02 05:11:32,468 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:3 [2018-12-02 05:11:32,513 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-02 05:11:32,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:11:33,144 WARN L180 SmtUtils]: Spent 503.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-12-02 05:11:33,302 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-02 05:11:33,630 WARN L180 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-12-02 05:11:33,920 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-02 05:11:36,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:11:36,112 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:11:36,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:11:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:11:36,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:11:36,166 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-02 05:11:36,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:36,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:36,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:11:36,232 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-02 05:11:36,235 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-02 05:11:36,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:36,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:36,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:36,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:29 [2018-12-02 05:11:36,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02 05:11:36,289 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 17 treesize of output 18 [2018-12-02 05:11:36,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:36,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-02 05:11:36,325 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:36,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:36,360 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-02 05:11:36,361 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-02 05:11:36,362 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:36,364 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:36,375 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-02 05:11:36,375 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:47, output treesize:46 [2018-12-02 05:11:36,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:36,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:36,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-02 05:11:36,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:36,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:36,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:41 [2018-12-02 05:11:36,698 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-02 05:11:36,708 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-02 05:11:36,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:36,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:36,809 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-02 05:11:36,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:135 [2018-12-02 05:11:37,004 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2018-12-02 05:11:37,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:37,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:37,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:37,017 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 26 treesize of output 29 [2018-12-02 05:11:37,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:37,089 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-02 05:11:37,092 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-02 05:11:37,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:37,096 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:11:37,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02 05:11:37,097 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:37,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:37,134 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:11:37,141 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-02 05:11:37,144 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 46 [2018-12-02 05:11:37,144 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:37,155 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:37,163 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-02 05:11:37,181 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 70 treesize of output 60 [2018-12-02 05:11:37,184 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 60 treesize of output 50 [2018-12-02 05:11:37,184 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-02 05:11:37,193 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-02 05:11:37,207 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-02 05:11:37,208 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:175, output treesize:65 [2018-12-02 05:11:37,470 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-02 05:11:37,473 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-02 05:11:37,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:37,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:37,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 05:11:37,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:56 [2018-12-02 05:11:37,613 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 59 treesize of output 53 [2018-12-02 05:11:37,616 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-02 05:11:37,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:37,631 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-02 05:11:37,631 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:37,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:37,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-12-02 05:11:37,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:37,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:37,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:37,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:71, output treesize:3 [2018-12-02 05:11:37,656 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-02 05:11:37,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:11:45,280 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2018-12-02 05:11:45,449 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-02 05:11:45,878 WARN L180 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-12-02 05:11:46,174 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-02 05:11:48,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:11:48,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 25 [2018-12-02 05:11:48,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 05:11:48,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 05:11:48,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=935, Unknown=4, NotChecked=0, Total=1056 [2018-12-02 05:11:48,378 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand 26 states. [2018-12-02 05:11:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:11:52,879 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-12-02 05:11:52,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 05:11:52,879 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2018-12-02 05:11:52,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:11:52,880 INFO L225 Difference]: With dead ends: 119 [2018-12-02 05:11:52,880 INFO L226 Difference]: Without dead ends: 119 [2018-12-02 05:11:52,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=220, Invalid=1756, Unknown=4, NotChecked=0, Total=1980 [2018-12-02 05:11:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-02 05:11:52,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2018-12-02 05:11:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-02 05:11:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2018-12-02 05:11:52,882 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 44 [2018-12-02 05:11:52,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:11:52,882 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2018-12-02 05:11:52,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 05:11:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2018-12-02 05:11:52,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 05:11:52,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:11:52,883 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-02 05:11:52,883 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:11:52,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:11:52,883 INFO L82 PathProgramCache]: Analyzing trace with hash -782975587, now seen corresponding path program 1 times [2018-12-02 05:11:52,883 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:11:52,883 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:11:52,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:11:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:11:53,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:11:53,075 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-02 05:11:53,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:53,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:53,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:11:53,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 05:11:53,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:53,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:53,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-12-02 05:11:53,166 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-02 05:11:53,169 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-02 05:11:53,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:53,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:53,201 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-02 05:11:53,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-12-02 05:11:53,237 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-02 05:11:53,240 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-02 05:11:53,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:53,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:53,292 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 23 treesize of output 35 [2018-12-02 05:11:53,295 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 24 treesize of output 23 [2018-12-02 05:11:53,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:53,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:53,344 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-02 05:11:53,344 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2018-12-02 05:11:53,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:53,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:53,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-02 05:11:53,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:53,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:53,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:46 [2018-12-02 05:11:54,118 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-02 05:11:54,128 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-02 05:11:54,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:54,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:54,241 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-02 05:11:54,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:112 [2018-12-02 05:11:58,392 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 39 [2018-12-02 05:11:58,694 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2018-12-02 05:11:58,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:58,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:58,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:58,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:58,728 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 43 treesize of output 79 [2018-12-02 05:11:58,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:58,807 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-02 05:11:58,810 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-02 05:11:58,811 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:58,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:58,918 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 89 treesize of output 88 [2018-12-02 05:11:58,923 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-02 05:11:58,930 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-02 05:11:58,930 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:58,939 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:58,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:58,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:58,980 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 92 treesize of output 89 [2018-12-02 05:11:58,984 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-02 05:11:58,984 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:59,003 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:59,017 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-02 05:11:59,048 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-02 05:11:59,049 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:157, output treesize:134 [2018-12-02 05:11:59,166 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-02 05:11:59,178 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-02 05:11:59,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:59,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:11:59,215 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-02 05:11:59,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:141, output treesize:130 [2018-12-02 05:11:59,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:59,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:11:59,303 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 126 treesize of output 80 [2018-12-02 05:11:59,327 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 40 treesize of output 47 [2018-12-02 05:11:59,328 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-12-02 05:11:59,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2018-12-02 05:11:59,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 05:11:59,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 54 [2018-12-02 05:11:59,419 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 05:11:59,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 46 treesize of output 38 [2018-12-02 05:11:59,422 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-02 05:11:59,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-12-02 05:11:59,428 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-02 05:11:59,569 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 40 treesize of output 29 [2018-12-02 05:11:59,569 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:59,572 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 53 treesize of output 44 [2018-12-02 05:11:59,573 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:59,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-12-02 05:11:59,576 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:59,578 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 49 treesize of output 40 [2018-12-02 05:11:59,579 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:59,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-12-02 05:11:59,582 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:59,584 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 36 treesize of output 25 [2018-12-02 05:11:59,584 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 05:11:59,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2018-12-02 05:11:59,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 16 dim-0 vars, and 6 xjuncts. [2018-12-02 05:11:59,822 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:131, output treesize:225 [2018-12-02 05:11:59,941 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:11:59,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:12:00,613 WARN L180 SmtUtils]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-12-02 05:12:00,835 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-02 05:12:01,235 WARN L180 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-12-02 05:12:01,533 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-12-02 05:12:08,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:12:08,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:12:08,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:12:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:12:08,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:12:08,804 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-02 05:12:08,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:08,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:08,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:12:08,863 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-02 05:12:08,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:08,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:08,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-02 05:12:08,980 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-02 05:12:08,982 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-02 05:12:08,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:08,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:09,004 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-02 05:12:09,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:33 [2018-12-02 05:12:09,114 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-02 05:12:09,116 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-02 05:12:09,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:09,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:09,160 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 23 treesize of output 35 [2018-12-02 05:12:09,163 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 24 treesize of output 23 [2018-12-02 05:12:09,163 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:09,199 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:09,211 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-02 05:12:09,211 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2018-12-02 05:12:09,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:09,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:09,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-02 05:12:09,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:09,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:09,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:43 [2018-12-02 05:12:09,536 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-02 05:12:09,548 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-02 05:12:09,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:09,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:09,674 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-02 05:12:09,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:112 [2018-12-02 05:12:09,859 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2018-12-02 05:12:09,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:09,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:09,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:09,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:09,883 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 43 treesize of output 79 [2018-12-02 05:12:09,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:09,977 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 93 treesize of output 92 [2018-12-02 05:12:09,981 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 29 treesize of output 32 [2018-12-02 05:12:09,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-02 05:12:09,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:09,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:10,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:10,039 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 96 treesize of output 84 [2018-12-02 05:12:10,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, 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 35 [2018-12-02 05:12:10,043 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:10,060 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:10,077 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-02 05:12:10,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-02 05:12:10,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2018-12-02 05:12:10,117 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:10,121 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:10,151 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-02 05:12:10,151 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:158, output treesize:139 [2018-12-02 05:12:10,494 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-02 05:12:10,497 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-02 05:12:10,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:10,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:10,532 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-02 05:12:10,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:151, output treesize:140 [2018-12-02 05:12:10,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 78 [2018-12-02 05:12:10,645 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 25 treesize of output 18 [2018-12-02 05:12:10,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:10,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 32 treesize of output 24 [2018-12-02 05:12:10,666 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-02 05:12:10,685 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 42 treesize of output 27 [2018-12-02 05:12:10,686 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-02 05:12:10,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:12:10,713 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 1 xjuncts. [2018-12-02 05:12:10,713 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:141, output treesize:43 [2018-12-02 05:12:10,784 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-02 05:12:10,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:12:18,378 WARN L180 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2018-12-02 05:12:18,565 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-02 05:12:18,901 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-12-02 05:12:19,150 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-12-02 05:12:25,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:12:25,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 28 [2018-12-02 05:12:25,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-02 05:12:25,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-02 05:12:25,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1183, Unknown=7, NotChecked=0, Total=1332 [2018-12-02 05:12:25,633 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand 29 states. [2018-12-02 05:12:48,220 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 47 [2018-12-02 05:12:48,771 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2018-12-02 05:12:49,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:12:49,463 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2018-12-02 05:12:49,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 05:12:49,464 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 45 [2018-12-02 05:12:49,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:12:49,464 INFO L225 Difference]: With dead ends: 119 [2018-12-02 05:12:49,464 INFO L226 Difference]: Without dead ends: 119 [2018-12-02 05:12:49,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=256, Invalid=2087, Unknown=9, NotChecked=0, Total=2352 [2018-12-02 05:12:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-02 05:12:49,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 107. [2018-12-02 05:12:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-02 05:12:49,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2018-12-02 05:12:49,467 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 45 [2018-12-02 05:12:49,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:12:49,467 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2018-12-02 05:12:49,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-02 05:12:49,467 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2018-12-02 05:12:49,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 05:12:49,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:12:49,467 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-02 05:12:49,467 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:12:49,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:12:49,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1497560648, now seen corresponding path program 1 times [2018-12-02 05:12:49,468 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:12:49,468 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:12:49,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:12:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:12:49,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:12:49,692 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-02 05:12:49,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:49,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:49,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:12:49,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:49,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:49,743 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-02 05:12:49,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:49,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:49,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-12-02 05:12:49,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 13 treesize of output 10 [2018-12-02 05:12:49,780 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-02 05:12:49,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:49,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:49,801 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-02 05:12:49,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-02 05:12:49,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02 05:12:49,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02 05:12:49,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:49,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02 05:12:49,916 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 05:12:49,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:12:49,972 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-02 05:12:49,974 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-02 05:12:49,974 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:49,976 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:50,000 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-02 05:12:50,000 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:48, output treesize:93 [2018-12-02 05:12:50,060 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 05:12:50,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:50,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:50,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:50,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-02 05:12:50,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:50,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:50,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:49 [2018-12-02 05:12:50,804 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-02 05:12:50,816 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-02 05:12:50,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:50,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:50,942 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-02 05:12:50,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:113 [2018-12-02 05:12:53,361 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2018-12-02 05:12:53,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:53,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:53,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:53,374 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 22 treesize of output 21 [2018-12-02 05:12:53,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:53,427 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-02 05:12:53,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-12-02 05:12:53,432 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:53,445 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:53,527 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-02 05:12:53,530 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-02 05:12:53,535 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-02 05:12:53,535 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:53,544 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:53,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:53,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:53,578 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-02 05:12:53,581 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-02 05:12:53,581 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:53,597 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:53,610 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-02 05:12:53,639 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-02 05:12:53,639 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:155, output treesize:85 [2018-12-02 05:12:53,742 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-02 05:12:53,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-02 05:12:53,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:53,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:53,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:53,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:94, output treesize:83 [2018-12-02 05:12:53,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:53,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:53,889 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-02 05:12:53,892 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-02 05:12:53,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:53,906 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 26 treesize of output 15 [2018-12-02 05:12:53,906 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:53,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-12-02 05:12:53,912 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:53,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:53,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:53,916 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:84, output treesize:10 [2018-12-02 05:12:53,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:53,963 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-02 05:12:53,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:53,968 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-02 05:12:53,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-02 05:12:54,031 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-02 05:12:54,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:12:54,860 WARN L180 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-12-02 05:12:55,099 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-02 05:12:55,514 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-12-02 05:12:55,806 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-12-02 05:12:55,809 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-12-02 05:12:55,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:55,851 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 8 treesize of output 1 [2018-12-02 05:12:55,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:55,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:12:55,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:134, output treesize:105 [2018-12-02 05:12:56,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:12:56,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:12:56,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:12:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:12:56,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:12:56,141 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-02 05:12:56,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:56,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:56,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:12:56,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:56,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:56,156 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-02 05:12:56,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:56,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:56,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-12-02 05:12:56,173 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-02 05:12:56,175 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-02 05:12:56,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:56,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:56,196 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-02 05:12:56,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2018-12-02 05:12:56,228 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-02 05:12:56,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26 [2018-12-02 05:12:56,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 05:12:56,291 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-02 05:12:56,291 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:56,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 05:12:56,347 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-02 05:12:56,349 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-02 05:12:56,349 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:56,352 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:56,377 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-02 05:12:56,377 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:48, output treesize:93 [2018-12-02 05:12:56,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:56,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:12:56,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2018-12-02 05:12:56,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:56,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:56,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:96, output treesize:46 [2018-12-02 05:12:56,728 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-02 05:12:56,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-02 05:12:56,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:12:56,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:12:56,839 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-02 05:12:56,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:106 [2018-12-02 05:13:01,048 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-02 05:13:01,252 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2018-12-02 05:13:01,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:13:01,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:13:01,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:13:01,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 20 treesize of output 21 [2018-12-02 05:13:01,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:01,316 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-02 05:13:01,320 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 34 [2018-12-02 05:13:01,321 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:01,328 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:13:01,398 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 63 treesize of output 66 [2018-12-02 05:13:01,402 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 23 treesize of output 26 [2018-12-02 05:13:01,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-12-02 05:13:01,408 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:01,417 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:13:01,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:13:01,455 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-12-02 05:13:01,458 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 30 treesize of output 24 [2018-12-02 05:13:01,459 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:01,473 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:13:01,486 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-02 05:13:01,505 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-02 05:13:01,505 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:147, output treesize:83 [2018-12-02 05:13:01,849 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-02 05:13:01,852 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-02 05:13:01,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:01,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:13:01,874 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-02 05:13:01,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:93 [2018-12-02 05:13:01,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 49 [2018-12-02 05:13:01,980 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-02 05:13:01,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:02,002 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 15 treesize of output 11 [2018-12-02 05:13:02,002 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:02,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-02 05:13:02,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:02,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:13:02,015 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-02 05:13:02,016 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:12 [2018-12-02 05:13:02,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:13:02,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02 05:13:02,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:02,063 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-02 05:13:02,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-02 05:13:02,121 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-02 05:13:02,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:13:02,470 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-12-02 05:13:02,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:02,483 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 6 treesize of output 1 [2018-12-02 05:13:02,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:02,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:13:02,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:37 [2018-12-02 05:13:05,627 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2018-12-02 05:13:05,771 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-02 05:13:06,051 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-12-02 05:13:06,376 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-02 05:13:08,397 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_append_#t~malloc1.base_43| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_append_#t~malloc1.base_43|) (_ bv0 1))) (not (= |c_main_~#list~0.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_append_#t~malloc1.base_43| (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_main_~#list~0.base|) |c_main_~#list~0.offset|))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |v_append_#t~malloc1.base_43|) (_ bv0 32) .cse2))) (store .cse1 (_ bv4 32) (select (select (store |c_#memory_$Pointer$.base| |v_append_#t~malloc1.base_43| .cse1) .cse2) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_main_~#list~0.base|) |c_main_~#list~0.offset|) (_ bv4 32))))))))) (store .cse0 |c_main_~#list~0.base| (store (select .cse0 |c_main_~#list~0.base|) |c_main_~#list~0.offset| |v_append_#t~malloc1.base_43|))) |v_append_#t~malloc1.base_43|) (_ bv4 32)))))) is different from false [2018-12-02 05:13:08,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:13:08,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 29 [2018-12-02 05:13:08,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-02 05:13:08,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-02 05:13:08,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1188, Unknown=4, NotChecked=70, Total=1406 [2018-12-02 05:13:08,420 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand 30 states. [2018-12-02 05:13:36,847 WARN L180 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-12-02 05:13:41,488 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2018-12-02 05:13:55,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:13:55,106 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2018-12-02 05:13:55,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 05:13:55,107 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 46 [2018-12-02 05:13:55,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:13:55,107 INFO L225 Difference]: With dead ends: 121 [2018-12-02 05:13:55,107 INFO L226 Difference]: Without dead ends: 121 [2018-12-02 05:13:55,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 71 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=285, Invalid=2468, Unknown=7, NotChecked=102, Total=2862 [2018-12-02 05:13:55,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-02 05:13:55,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2018-12-02 05:13:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-02 05:13:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2018-12-02 05:13:55,110 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 46 [2018-12-02 05:13:55,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:13:55,110 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2018-12-02 05:13:55,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-02 05:13:55,110 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2018-12-02 05:13:55,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 05:13:55,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:13:55,110 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] [2018-12-02 05:13:55,110 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-02 05:13:55,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:13:55,111 INFO L82 PathProgramCache]: Analyzing trace with hash 341738920, now seen corresponding path program 1 times [2018-12-02 05:13:55,111 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:13:55,111 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:13:55,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:13:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:13:55,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:13:55,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 05:13:55,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:55,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:13:55,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 05:13:55,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 05:13:55,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:55,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:13:55,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-12-02 05:13:55,457 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-02 05:13:55,459 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-02 05:13:55,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:55,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:13:55,481 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-02 05:13:55,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-12-02 05:13:55,521 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-02 05:13:55,523 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-02 05:13:55,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:55,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:13:55,578 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 23 treesize of output 35 [2018-12-02 05:13:55,590 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-02 05:13:55,591 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 05:13:55,628 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-02 05:13:55,628 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:55,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:13:55,652 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-02 05:13:55,653 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2018-12-02 05:13:55,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:13:55,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:13:55,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-02 05:13:55,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:55,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:13:55,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:48 [2018-12-02 05:13:58,409 WARN L854 $PredicateComparison]: unable to prove that (exists ((append_~item~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| append_~item~0.base)) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~item~0.base (let ((.cse2 (select (select |c_old(#memory_$Pointer$.base)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|))) (let ((.cse1 (store (select |c_old(#memory_$Pointer$.base)| append_~item~0.base) (_ bv0 32) .cse2))) (store .cse1 (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.base)| append_~item~0.base .cse1) .cse2) (bvadd (select (select |c_old(#memory_$Pointer$.offset)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|) (_ bv4 32))))))))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) |c_append_#in~plist.offset| append_~item~0.base))) |c_#memory_$Pointer$.base|) (= |c_#valid| (store |c_old(#valid)| append_~item~0.base (_ bv1 1))))) is different from true [2018-12-02 05:13:58,605 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2018-12-02 05:13:58,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:13:58,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:13:58,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:13:58,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:13:58,630 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 43 treesize of output 75 [2018-12-02 05:13:58,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:58,721 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 93 treesize of output 92 [2018-12-02 05:13:58,726 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 29 treesize of output 32 [2018-12-02 05:13:58,732 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 32 treesize of output 33 [2018-12-02 05:13:58,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:58,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:13:58,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:13:58,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:13:58,782 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 94 treesize of output 91 [2018-12-02 05:13:58,785 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-02 05:13:58,786 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:58,805 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:13:58,821 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-02 05:13:58,872 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 29 treesize of output 25 [2018-12-02 05:13:58,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-02 05:13:58,883 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:13:58,895 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:13:58,934 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-02 05:13:58,934 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:154, output treesize:128 [2018-12-02 05:13:59,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:13:59,322 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:13:59,367 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 8 case distinctions, treesize of input 72 treesize of output 216 [2018-12-02 05:13:59,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2018-12-02 05:13:59,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-02 05:13:59,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:148, output treesize:997 [2018-12-02 05:14:07,420 WARN L180 SmtUtils]: Spent 7.65 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-12-02 05:14:07,429 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 131 [2018-12-02 05:14:07,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 46 treesize of output 37 [2018-12-02 05:14:07,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:07,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:08,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:08,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:08,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:08,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 98 [2018-12-02 05:14:08,066 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 60 [2018-12-02 05:14:08,067 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 05:14:08,112 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-02 05:14:08,112 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:08,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:08,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:08,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:08,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:08,138 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-12-02 05:14:08,139 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:08,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:08,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:08,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:08,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:08,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:08,705 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 122 treesize of output 93 [2018-12-02 05:14:08,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:08,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:08,749 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 65 [2018-12-02 05:14:08,752 INFO L267 ElimStorePlain]: Start of recursive call 9: 9 dim-0 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2018-12-02 05:14:08,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 51 [2018-12-02 05:14:08,907 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-02 05:14:08,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 54 treesize of output 41 [2018-12-02 05:14:08,911 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:08,914 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 40 treesize of output 29 [2018-12-02 05:14:08,914 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:08,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2018-12-02 05:14:08,926 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-02 05:14:08,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 45 [2018-12-02 05:14:08,931 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:09,053 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 46 treesize of output 42 [2018-12-02 05:14:09,053 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-02 05:14:09,056 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 46 treesize of output 42 [2018-12-02 05:14:09,056 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:09,059 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 40 treesize of output 36 [2018-12-02 05:14:09,059 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-02 05:14:09,061 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 36 treesize of output 32 [2018-12-02 05:14:09,062 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:09,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-12-02 05:14:09,064 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:09,196 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: 10 dim-0 vars, and 5 xjuncts. [2018-12-02 05:14:09,970 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 129 treesize of output 121 [2018-12-02 05:14:09,973 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 73 treesize of output 62 [2018-12-02 05:14:09,973 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:09,996 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:10,797 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 155 treesize of output 151 [2018-12-02 05:14:10,810 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-02 05:14:10,810 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:10,846 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:11,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:11,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:11,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:11,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:11,578 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 110 treesize of output 87 [2018-12-02 05:14:11,621 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 60 [2018-12-02 05:14:11,622 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 05:14:11,643 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-02 05:14:11,643 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:11,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-02 05:14:11,653 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:11,659 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:12,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:12,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:12,329 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 144 treesize of output 91 [2018-12-02 05:14:12,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:12,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:12,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:12,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:12,386 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 79 [2018-12-02 05:14:12,388 INFO L267 ElimStorePlain]: Start of recursive call 29: 13 dim-0 vars, End of recursive call: 13 dim-0 vars, and 5 xjuncts. [2018-12-02 05:14:12,621 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 66 treesize of output 62 [2018-12-02 05:14:12,622 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:12,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-12-02 05:14:12,626 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:12,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-12-02 05:14:12,631 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:12,633 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 50 treesize of output 46 [2018-12-02 05:14:12,634 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:12,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2018-12-02 05:14:12,638 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:12,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 60 [2018-12-02 05:14:12,882 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-12-02 05:14:12,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2018-12-02 05:14:12,885 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:12,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-12-02 05:14:12,891 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:12,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 75 [2018-12-02 05:14:12,909 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-12-02 05:14:12,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 67 [2018-12-02 05:14:12,915 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:13,180 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-1 vars, End of recursive call: 14 dim-0 vars, and 5 xjuncts. [2018-12-02 05:14:14,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:14,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:14,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:14,340 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 145 treesize of output 104 [2018-12-02 05:14:14,394 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 74 [2018-12-02 05:14:14,395 INFO L267 ElimStorePlain]: Start of recursive call 41: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 05:14:14,488 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 48 treesize of output 39 [2018-12-02 05:14:14,488 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:14,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 65 [2018-12-02 05:14:14,504 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-12-02 05:14:14,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2018-12-02 05:14:14,509 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:14,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-12-02 05:14:14,585 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:14,587 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 39 treesize of output 34 [2018-12-02 05:14:14,587 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:14,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2018-12-02 05:14:14,590 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:14,651 INFO L267 ElimStorePlain]: Start of recursive call 40: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-02 05:14:15,810 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 41 treesize of output 37 [2018-12-02 05:14:15,813 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-02 05:14:15,813 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:15,820 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:15,821 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 41 treesize of output 37 [2018-12-02 05:14:15,824 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-02 05:14:15,824 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:15,831 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:15,833 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 41 treesize of output 37 [2018-12-02 05:14:15,835 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-02 05:14:15,835 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:15,842 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:16,871 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 56 treesize of output 50 [2018-12-02 05:14:16,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-12-02 05:14:16,873 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:16,886 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:17,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:17,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:17,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:17,885 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 153 treesize of output 106 [2018-12-02 05:14:17,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:17,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:17,935 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 87 [2018-12-02 05:14:17,938 INFO L267 ElimStorePlain]: Start of recursive call 57: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 5 xjuncts. [2018-12-02 05:14:18,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 75 treesize of output 62 [2018-12-02 05:14:18,150 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:18,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 63 [2018-12-02 05:14:18,163 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-12-02 05:14:18,166 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 61 treesize of output 50 [2018-12-02 05:14:18,166 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:18,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 76 [2018-12-02 05:14:18,180 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 2 xjuncts. [2018-12-02 05:14:18,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 83 treesize of output 70 [2018-12-02 05:14:18,186 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:18,375 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 65 treesize of output 61 [2018-12-02 05:14:18,376 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:18,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2018-12-02 05:14:18,379 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:18,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-12-02 05:14:18,383 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:18,386 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 71 treesize of output 67 [2018-12-02 05:14:18,386 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:18,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 53 [2018-12-02 05:14:18,389 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:18,569 INFO L267 ElimStorePlain]: Start of recursive call 56: 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2018-12-02 05:14:19,920 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 60 treesize of output 54 [2018-12-02 05:14:19,923 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 22 treesize of output 13 [2018-12-02 05:14:19,923 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:19,945 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:19,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-12-02 05:14:19,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-12-02 05:14:19,950 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:19,969 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:19,971 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 60 treesize of output 54 [2018-12-02 05:14:19,973 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 22 treesize of output 13 [2018-12-02 05:14:19,974 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:19,987 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:19,989 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-02 05:14:19,991 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 22 treesize of output 13 [2018-12-02 05:14:19,991 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:20,000 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:20,006 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 60 treesize of output 54 [2018-12-02 05:14:20,009 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 22 treesize of output 13 [2018-12-02 05:14:20,009 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:20,027 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:21,264 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 147 treesize of output 141 [2018-12-02 05:14:21,273 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 50 treesize of output 41 [2018-12-02 05:14:21,273 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:21,314 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:22,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:22,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:22,651 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 132 treesize of output 85 [2018-12-02 05:14:22,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:22,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:22,703 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 73 [2018-12-02 05:14:22,705 INFO L267 ElimStorePlain]: Start of recursive call 81: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 05:14:22,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 62 [2018-12-02 05:14:22,836 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 2 xjuncts. [2018-12-02 05:14:22,838 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 51 treesize of output 40 [2018-12-02 05:14:22,838 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:22,843 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 63 treesize of output 50 [2018-12-02 05:14:22,843 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:22,947 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 50 treesize of output 48 [2018-12-02 05:14:22,948 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:22,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 38 [2018-12-02 05:14:22,950 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:22,953 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 44 treesize of output 42 [2018-12-02 05:14:22,954 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 05:14:23,029 INFO L267 ElimStorePlain]: Start of recursive call 80: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-02 05:14:24,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 14 dim-2 vars, End of recursive call: 68 dim-0 vars, and 23 xjuncts. [2018-12-02 05:14:24,373 INFO L202 ElimStorePlain]: Needed 87 recursive calls to eliminate 21 variables, input treesize:996, output treesize:989 [2018-12-02 05:14:24,758 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-02 05:14:24,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:14:25,092 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-02 05:14:25,093 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 33 treesize of output 22 [2018-12-02 05:14:25,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:25,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:25,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:25,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2018-12-02 05:14:25,475 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-12-02 05:14:25,656 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-12-02 05:14:25,969 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-12-02 05:14:26,231 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-02 05:14:26,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:14:26,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8cc44f5-9360-4486-9122-4fa30632a2e4/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:14:26,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:14:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:14:26,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:14:26,597 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-02 05:14:26,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:26,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:26,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 05:14:26,662 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-02 05:14:26,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:26,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:26,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-02 05:14:26,783 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-02 05:14:26,786 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-02 05:14:26,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:26,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:26,809 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-02 05:14:26,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:33 [2018-12-02 05:14:26,961 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 23 treesize of output 35 [2018-12-02 05:14:26,975 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 21 treesize of output 29 [2018-12-02 05:14:26,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 05:14:27,019 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-02 05:14:27,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:27,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:27,051 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-02 05:14:27,053 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-02 05:14:27,053 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:27,056 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:27,065 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-02 05:14:27,066 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2018-12-02 05:14:27,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:27,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:27,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-02 05:14:27,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:27,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:27,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:38 [2018-12-02 05:14:30,605 WARN L854 $PredicateComparison]: unable to prove that (exists ((append_~item~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| append_~item~0.base)) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~item~0.base (let ((.cse2 (select (select |c_old(#memory_$Pointer$.base)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|))) (let ((.cse1 (store (select |c_old(#memory_$Pointer$.base)| append_~item~0.base) (_ bv0 32) .cse2))) (store .cse1 (_ bv4 32) (select (select (store |c_old(#memory_$Pointer$.base)| append_~item~0.base .cse1) .cse2) (bvadd (select (select |c_old(#memory_$Pointer$.offset)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|) (_ bv4 32))))))))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) |c_append_#in~plist.offset| append_~item~0.base))) |c_#memory_$Pointer$.base|))) is different from true [2018-12-02 05:14:30,913 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2018-12-02 05:14:30,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:30,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:30,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:30,939 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-02 05:14:30,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:31,077 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 52 treesize of output 48 [2018-12-02 05:14:31,082 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 34 [2018-12-02 05:14:31,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:31,108 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:31,111 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 87 treesize of output 81 [2018-12-02 05:14:31,114 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 78 treesize of output 64 [2018-12-02 05:14:31,114 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:31,137 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:14:31,309 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 96 treesize of output 79 [2018-12-02 05:14:31,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2018-12-02 05:14:31,319 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:31,371 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 72 treesize of output 63 [2018-12-02 05:14:31,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 77 [2018-12-02 05:14:31,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 68 treesize of output 93 [2018-12-02 05:14:31,489 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 05:14:31,489 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 05:14:32,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:32,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:14:32,298 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:14:32,299 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_prenex_130 input size 25 context size 25 output size 25 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-02 05:14:32,304 INFO L168 Benchmark]: Toolchain (without parser) took 410734.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 241.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -116.9 MB). Peak memory consumption was 124.3 MB. Max. memory is 11.5 GB. [2018-12-02 05:14:32,304 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:14:32,305 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2018-12-02 05:14:32,305 INFO L168 Benchmark]: Boogie Preprocessor took 33.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2018-12-02 05:14:32,306 INFO L168 Benchmark]: RCFGBuilder took 397.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2018-12-02 05:14:32,306 INFO L168 Benchmark]: TraceAbstraction took 410031.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.2 MB). Peak memory consumption was 120.6 MB. Max. memory is 11.5 GB. [2018-12-02 05:14:32,308 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 269.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 397.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 410031.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.2 MB). Peak memory consumption was 120.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_130 input size 25 context size 25 output size 25 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_130 input size 25 context size 25 output size 25: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...