./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.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_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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 e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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 e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 14:35:26,027 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 14:35:26,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 14:35:26,033 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 14:35:26,033 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 14:35:26,034 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 14:35:26,034 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 14:35:26,035 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 14:35:26,036 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 14:35:26,036 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 14:35:26,037 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 14:35:26,037 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 14:35:26,037 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 14:35:26,038 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 14:35:26,038 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 14:35:26,038 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 14:35:26,039 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 14:35:26,040 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 14:35:26,040 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 14:35:26,041 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 14:35:26,042 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 14:35:26,042 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 14:35:26,043 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 14:35:26,043 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 14:35:26,043 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 14:35:26,044 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 14:35:26,044 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 14:35:26,045 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 14:35:26,045 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 14:35:26,045 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 14:35:26,046 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 14:35:26,046 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 14:35:26,046 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 14:35:26,046 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 14:35:26,047 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 14:35:26,047 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 14:35:26,047 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-09 14:35:26,054 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 14:35:26,054 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 14:35:26,054 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 14:35:26,054 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 14:35:26,055 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 14:35:26,055 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 14:35:26,055 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 14:35:26,055 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 14:35:26,055 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 14:35:26,055 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 14:35:26,055 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 14:35:26,055 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 14:35:26,056 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 14:35:26,056 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 14:35:26,056 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 14:35:26,056 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 14:35:26,056 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 14:35:26,056 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 14:35:26,056 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 14:35:26,056 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 14:35:26,056 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 14:35:26,056 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 14:35:26,056 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 14:35:26,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 14:35:26,057 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 14:35:26,057 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 14:35:26,057 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 14:35:26,057 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 14:35:26,057 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_f87a4745-7c33-4af2-9eac-5995e4345669/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 -> e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 [2018-12-09 14:35:26,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 14:35:26,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 14:35:26,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 14:35:26,087 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 14:35:26,087 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 14:35:26,088 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-12-09 14:35:26,130 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/data/2698bebef/fd84e797375f41c6928db7d0ae7144bb/FLAG60ca417c5 [2018-12-09 14:35:26,564 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 14:35:26,565 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-12-09 14:35:26,572 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/data/2698bebef/fd84e797375f41c6928db7d0ae7144bb/FLAG60ca417c5 [2018-12-09 14:35:26,581 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/data/2698bebef/fd84e797375f41c6928db7d0ae7144bb [2018-12-09 14:35:26,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 14:35:26,583 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 14:35:26,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 14:35:26,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 14:35:26,586 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 14:35:26,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:35:26" (1/1) ... [2018-12-09 14:35:26,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198b87e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:26, skipping insertion in model container [2018-12-09 14:35:26,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:35:26" (1/1) ... [2018-12-09 14:35:26,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 14:35:26,611 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 14:35:26,752 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 14:35:26,757 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 14:35:26,815 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 14:35:26,835 INFO L195 MainTranslator]: Completed translation [2018-12-09 14:35:26,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:26 WrapperNode [2018-12-09 14:35:26,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 14:35:26,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 14:35:26,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 14:35:26,836 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 14:35:26,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:26" (1/1) ... [2018-12-09 14:35:26,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:26" (1/1) ... [2018-12-09 14:35:26,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:26" (1/1) ... [2018-12-09 14:35:26,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:26" (1/1) ... [2018-12-09 14:35:26,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:26" (1/1) ... [2018-12-09 14:35:26,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:26" (1/1) ... [2018-12-09 14:35:26,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:26" (1/1) ... [2018-12-09 14:35:26,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 14:35:26,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 14:35:26,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 14:35:26,865 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 14:35:26,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:26,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 14:35:26,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 14:35:26,895 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-09 14:35:26,895 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 14:35:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-09 14:35:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 14:35:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 14:35:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 14:35:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 14:35:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 14:35:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 14:35:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 14:35:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 14:35:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 14:35:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 14:35:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 14:35:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 14:35:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 14:35:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 14:35:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 14:35:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 14:35:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 14:35:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 14:35:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 14:35:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 14:35:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 14:35:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 14:35:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 14:35:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 14:35:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 14:35:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 14:35:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 14:35:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 14:35:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 14:35:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 14:35:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 14:35:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 14:35:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 14:35:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 14:35:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 14:35:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 14:35:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 14:35:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 14:35:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 14:35:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 14:35:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 14:35:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 14:35:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 14:35:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 14:35:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 14:35:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 14:35:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 14:35:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 14:35:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 14:35:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 14:35:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 14:35:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 14:35:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 14:35:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 14:35:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 14:35:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 14:35:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 14:35:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 14:35:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 14:35:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 14:35:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 14:35:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 14:35:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 14:35:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 14:35:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-09 14:35:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 14:35:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 14:35:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 14:35:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 14:35:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 14:35:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 14:35:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 14:35:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 14:35:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 14:35:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 14:35:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 14:35:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 14:35:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 14:35:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 14:35:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 14:35:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 14:35:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 14:35:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 14:35:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 14:35:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 14:35:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 14:35:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 14:35:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 14:35:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 14:35:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 14:35:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 14:35:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 14:35:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 14:35:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 14:35:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 14:35:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 14:35:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 14:35:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 14:35:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 14:35:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 14:35:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 14:35:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-09 14:35:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-09 14:35:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 14:35:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 14:35:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 14:35:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 14:35:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 14:35:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 14:35:26,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 14:35:26,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 14:35:27,151 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 14:35:27,152 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 14:35:27,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:35:27 BoogieIcfgContainer [2018-12-09 14:35:27,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 14:35:27,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 14:35:27,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 14:35:27,155 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 14:35:27,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:35:26" (1/3) ... [2018-12-09 14:35:27,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a20671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:35:27, skipping insertion in model container [2018-12-09 14:35:27,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:26" (2/3) ... [2018-12-09 14:35:27,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a20671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:35:27, skipping insertion in model container [2018-12-09 14:35:27,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:35:27" (3/3) ... [2018-12-09 14:35:27,158 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-12-09 14:35:27,166 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 14:35:27,172 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-12-09 14:35:27,184 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-12-09 14:35:27,197 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 14:35:27,198 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 14:35:27,198 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 14:35:27,198 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 14:35:27,198 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 14:35:27,198 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 14:35:27,198 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 14:35:27,198 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 14:35:27,198 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 14:35:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-12-09 14:35:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 14:35:27,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:27,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:35:27,215 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 14:35:27,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:27,218 INFO L82 PathProgramCache]: Analyzing trace with hash -557279662, now seen corresponding path program 1 times [2018-12-09 14:35:27,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:35:27,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:35:27,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:27,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:27,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:27,289 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-09 14:35:27,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:27,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 14:35:27,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 14:35:27,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 14:35:27,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 14:35:27,302 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2018-12-09 14:35:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:27,314 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-12-09 14:35:27,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 14:35:27,314 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-12-09 14:35:27,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:27,320 INFO L225 Difference]: With dead ends: 85 [2018-12-09 14:35:27,320 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 14:35:27,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 14:35:27,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 14:35:27,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-09 14:35:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 14:35:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-12-09 14:35:27,343 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 8 [2018-12-09 14:35:27,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:27,343 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-12-09 14:35:27,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 14:35:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-12-09 14:35:27,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 14:35:27,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:27,343 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:35:27,344 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 14:35:27,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:27,344 INFO L82 PathProgramCache]: Analyzing trace with hash -95705117, now seen corresponding path program 1 times [2018-12-09 14:35:27,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:35:27,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:35:27,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:27,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:27,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:27,408 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-09 14:35:27,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:27,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 14:35:27,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 14:35:27,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 14:35:27,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:35:27,409 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 5 states. [2018-12-09 14:35:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:27,508 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-12-09 14:35:27,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 14:35:27,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-09 14:35:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:27,509 INFO L225 Difference]: With dead ends: 74 [2018-12-09 14:35:27,509 INFO L226 Difference]: Without dead ends: 74 [2018-12-09 14:35:27,510 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-09 14:35:27,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-09 14:35:27,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-09 14:35:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 14:35:27,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-12-09 14:35:27,515 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 9 [2018-12-09 14:35:27,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:27,516 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-12-09 14:35:27,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 14:35:27,516 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-12-09 14:35:27,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 14:35:27,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:27,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:35:27,516 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 14:35:27,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:27,517 INFO L82 PathProgramCache]: Analyzing trace with hash -95705116, now seen corresponding path program 1 times [2018-12-09 14:35:27,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:35:27,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:35:27,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:27,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:27,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:27,574 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-09 14:35:27,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:27,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 14:35:27,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 14:35:27,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 14:35:27,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:35:27,575 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-12-09 14:35:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:27,694 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-12-09 14:35:27,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 14:35:27,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-09 14:35:27,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:27,696 INFO L225 Difference]: With dead ends: 90 [2018-12-09 14:35:27,696 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 14:35:27,697 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-09 14:35:27,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 14:35:27,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2018-12-09 14:35:27,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-09 14:35:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-12-09 14:35:27,702 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 9 [2018-12-09 14:35:27,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:27,702 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-12-09 14:35:27,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 14:35:27,702 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-12-09 14:35:27,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 14:35:27,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:27,703 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:35:27,703 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 14:35:27,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:27,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1328108723, now seen corresponding path program 1 times [2018-12-09 14:35:27,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:35:27,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:35:27,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:27,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:27,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:27,722 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-09 14:35:27,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:27,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 14:35:27,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:35:27,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:35:27,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:35:27,723 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 3 states. [2018-12-09 14:35:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:27,753 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-12-09 14:35:27,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:35:27,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 14:35:27,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:27,754 INFO L225 Difference]: With dead ends: 75 [2018-12-09 14:35:27,754 INFO L226 Difference]: Without dead ends: 75 [2018-12-09 14:35:27,755 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-09 14:35:27,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-09 14:35:27,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-09 14:35:27,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 14:35:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-12-09 14:35:27,758 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 10 [2018-12-09 14:35:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:27,758 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-12-09 14:35:27,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:35:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-12-09 14:35:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 14:35:27,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:27,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:35:27,759 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 14:35:27,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:27,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1328108724, now seen corresponding path program 1 times [2018-12-09 14:35:27,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:35:27,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:35:27,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:27,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:27,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:27,779 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-09 14:35:27,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:27,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 14:35:27,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:35:27,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:35:27,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:35:27,780 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 3 states. [2018-12-09 14:35:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:27,808 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-12-09 14:35:27,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:35:27,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 14:35:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:27,809 INFO L225 Difference]: With dead ends: 71 [2018-12-09 14:35:27,809 INFO L226 Difference]: Without dead ends: 71 [2018-12-09 14:35:27,810 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-09 14:35:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-09 14:35:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-09 14:35:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-09 14:35:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-12-09 14:35:27,812 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 10 [2018-12-09 14:35:27,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:27,812 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-12-09 14:35:27,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:35:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-12-09 14:35:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 14:35:27,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:27,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:35:27,813 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 14:35:27,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:27,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1312633070, now seen corresponding path program 1 times [2018-12-09 14:35:27,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:35:27,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:35:27,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:27,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:27,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:27,883 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-09 14:35:27,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:27,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 14:35:27,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 14:35:27,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 14:35:27,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 14:35:27,884 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 8 states. [2018-12-09 14:35:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:28,029 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-12-09 14:35:28,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 14:35:28,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-09 14:35:28,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:28,030 INFO L225 Difference]: With dead ends: 82 [2018-12-09 14:35:28,030 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 14:35:28,030 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-09 14:35:28,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 14:35:28,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-12-09 14:35:28,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 14:35:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-12-09 14:35:28,035 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 15 [2018-12-09 14:35:28,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:28,035 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-12-09 14:35:28,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 14:35:28,035 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-12-09 14:35:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 14:35:28,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:28,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:35:28,036 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 14:35:28,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:28,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2037197624, now seen corresponding path program 1 times [2018-12-09 14:35:28,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:35:28,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:35:28,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:28,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:28,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:28,096 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-09 14:35:28,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:28,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:35:28,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 14:35:28,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 14:35:28,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 14:35:28,097 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 7 states. [2018-12-09 14:35:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:28,165 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-12-09 14:35:28,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 14:35:28,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-09 14:35:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:28,166 INFO L225 Difference]: With dead ends: 77 [2018-12-09 14:35:28,166 INFO L226 Difference]: Without dead ends: 77 [2018-12-09 14:35:28,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-09 14:35:28,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-09 14:35:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2018-12-09 14:35:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 14:35:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-12-09 14:35:28,169 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 16 [2018-12-09 14:35:28,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:28,170 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-12-09 14:35:28,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 14:35:28,170 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-12-09 14:35:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 14:35:28,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:28,170 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-09 14:35:28,170 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 14:35:28,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:28,171 INFO L82 PathProgramCache]: Analyzing trace with hash -200406812, now seen corresponding path program 1 times [2018-12-09 14:35:28,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:35:28,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:35:28,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:28,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:28,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:28,225 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-09 14:35:28,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:28,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:35:28,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 14:35:28,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 14:35:28,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 14:35:28,226 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 7 states. [2018-12-09 14:35:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:28,320 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-12-09 14:35:28,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 14:35:28,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-09 14:35:28,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:28,321 INFO L225 Difference]: With dead ends: 80 [2018-12-09 14:35:28,321 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 14:35:28,321 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-09 14:35:28,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 14:35:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2018-12-09 14:35:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 14:35:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-12-09 14:35:28,324 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 24 [2018-12-09 14:35:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:28,325 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-12-09 14:35:28,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 14:35:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-12-09 14:35:28,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 14:35:28,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:28,325 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-09 14:35:28,325 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 14:35:28,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:28,326 INFO L82 PathProgramCache]: Analyzing trace with hash -200406811, now seen corresponding path program 1 times [2018-12-09 14:35:28,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:35:28,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:35:28,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:28,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:28,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:28,407 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-09 14:35:28,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:28,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:35:28,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 14:35:28,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 14:35:28,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 14:35:28,408 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 7 states. [2018-12-09 14:35:28,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:28,503 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-12-09 14:35:28,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 14:35:28,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-09 14:35:28,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:28,504 INFO L225 Difference]: With dead ends: 82 [2018-12-09 14:35:28,504 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 14:35:28,504 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-09 14:35:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 14:35:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-12-09 14:35:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 14:35:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-12-09 14:35:28,507 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 24 [2018-12-09 14:35:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:28,507 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-12-09 14:35:28,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 14:35:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-12-09 14:35:28,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 14:35:28,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:28,508 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-09 14:35:28,508 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 14:35:28,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:28,508 INFO L82 PathProgramCache]: Analyzing trace with hash 700839514, now seen corresponding path program 1 times [2018-12-09 14:35:28,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:35:28,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:35:28,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:28,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:28,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:28,564 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-09 14:35:28,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:28,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:35:28,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 14:35:28,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 14:35:28,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 14:35:28,565 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-12-09 14:35:28,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:28,626 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-12-09 14:35:28,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 14:35:28,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-09 14:35:28,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:28,627 INFO L225 Difference]: With dead ends: 66 [2018-12-09 14:35:28,627 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 14:35:28,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 14:35:28,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 14:35:28,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-09 14:35:28,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 14:35:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-12-09 14:35:28,630 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2018-12-09 14:35:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:28,630 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-12-09 14:35:28,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 14:35:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-12-09 14:35:28,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 14:35:28,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:28,631 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-09 14:35:28,631 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 14:35:28,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:28,631 INFO L82 PathProgramCache]: Analyzing trace with hash -314795811, now seen corresponding path program 1 times [2018-12-09 14:35:28,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:35:28,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:35:28,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:28,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:28,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:28,666 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-09 14:35:28,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:28,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 14:35:28,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 14:35:28,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 14:35:28,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 14:35:28,666 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 6 states. [2018-12-09 14:35:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:28,720 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-12-09 14:35:28,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 14:35:28,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-09 14:35:28,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:28,721 INFO L225 Difference]: With dead ends: 65 [2018-12-09 14:35:28,721 INFO L226 Difference]: Without dead ends: 65 [2018-12-09 14:35:28,721 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-09 14:35:28,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-09 14:35:28,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-09 14:35:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 14:35:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-12-09 14:35:28,724 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 27 [2018-12-09 14:35:28,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:28,724 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-12-09 14:35:28,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 14:35:28,724 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-12-09 14:35:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 14:35:28,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:28,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:35:28,725 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 14:35:28,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:28,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1168735483, now seen corresponding path program 1 times [2018-12-09 14:35:28,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:35:28,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:35:28,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:28,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:28,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:28,759 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-09 14:35:28,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:28,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:35:28,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 14:35:28,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 14:35:28,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 14:35:28,760 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 7 states. [2018-12-09 14:35:28,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:28,838 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-12-09 14:35:28,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 14:35:28,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-09 14:35:28,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:28,839 INFO L225 Difference]: With dead ends: 64 [2018-12-09 14:35:28,839 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 14:35:28,839 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-09 14:35:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 14:35:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-09 14:35:28,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 14:35:28,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-12-09 14:35:28,841 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 28 [2018-12-09 14:35:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:28,841 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-12-09 14:35:28,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 14:35:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-12-09 14:35:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 14:35:28,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:28,842 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-09 14:35:28,842 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 14:35:28,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:28,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1776628288, now seen corresponding path program 1 times [2018-12-09 14:35:28,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:35:28,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:35:28,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:28,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:28,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:28,934 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-09 14:35:28,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 14:35:28,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:28,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:28,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:29,017 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-09 14:35:29,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 8 treesize of output 7 [2018-12-09 14:35:29,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,024 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-09 14:35:29,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-09 14:35:29,049 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-09 14:35:29,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-12-09 14:35:29,103 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-09 14:35:29,106 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-09 14:35:29,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,123 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-09 14:35:29,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-09 14:35:29,151 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-09 14:35:29,154 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-09 14:35:29,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,163 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-09 14:35:29,163 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,172 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-09 14:35:29,172 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,178 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-09 14:35:29,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-12-09 14:35:29,186 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-09 14:35:29,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 14:35:29,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 15 [2018-12-09 14:35:29,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 14:35:29,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 14:35:29,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-12-09 14:35:29,202 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 16 states. [2018-12-09 14:35:29,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:29,534 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-12-09 14:35:29,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 14:35:29,534 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-12-09 14:35:29,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:29,535 INFO L225 Difference]: With dead ends: 70 [2018-12-09 14:35:29,535 INFO L226 Difference]: Without dead ends: 70 [2018-12-09 14:35:29,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-12-09 14:35:29,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-09 14:35:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-12-09 14:35:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 14:35:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-12-09 14:35:29,538 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 29 [2018-12-09 14:35:29,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:29,538 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-12-09 14:35:29,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 14:35:29,538 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-12-09 14:35:29,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 14:35:29,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:29,539 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-09 14:35:29,539 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 14:35:29,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:29,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1776628289, now seen corresponding path program 1 times [2018-12-09 14:35:29,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:35:29,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:35:29,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:29,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:29,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:29,655 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-09 14:35:29,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 14:35:29,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:29,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:29,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:29,696 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-09 14:35:29,698 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-09 14:35:29,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,706 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-09 14:35:29,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-09 14:35:29,708 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,713 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-09 14:35:29,713 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-12-09 14:35:29,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:29,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:29,750 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-09 14:35:29,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,757 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-09 14:35:29,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-12-09 14:35:29,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-09 14:35:29,812 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-09 14:35:29,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-12-09 14:35:29,849 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-09 14:35:29,850 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,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, 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-09 14:35:29,863 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,876 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-09 14:35:29,877 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-12-09 14:35:29,901 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-09 14:35:29,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-12-09 14:35:29,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,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, 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-09 14:35:29,914 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,923 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-09 14:35:29,924 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,938 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-09 14:35:29,940 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-09 14:35:29,940 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,944 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:29,947 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-09 14:35:29,948 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-12-09 14:35:29,968 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-09 14:35:29,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 14:35:29,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2018-12-09 14:35:29,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 14:35:29,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 14:35:29,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-09 14:35:29,984 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 17 states. [2018-12-09 14:35:30,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:30,412 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-12-09 14:35:30,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 14:35:30,413 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-12-09 14:35:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:30,413 INFO L225 Difference]: With dead ends: 69 [2018-12-09 14:35:30,414 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 14:35:30,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-12-09 14:35:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 14:35:30,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-09 14:35:30,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 14:35:30,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-12-09 14:35:30,416 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 29 [2018-12-09 14:35:30,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:30,416 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-12-09 14:35:30,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 14:35:30,416 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-12-09 14:35:30,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 14:35:30,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:30,417 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-09 14:35:30,417 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 14:35:30,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:30,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1871061536, now seen corresponding path program 1 times [2018-12-09 14:35:30,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:35:30,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:35:30,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:30,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:30,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:30,475 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-09 14:35:30,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:30,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 14:35:30,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 14:35:30,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 14:35:30,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 14:35:30,477 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 8 states. [2018-12-09 14:35:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:30,586 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-12-09 14:35:30,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 14:35:30,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-12-09 14:35:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:30,586 INFO L225 Difference]: With dead ends: 66 [2018-12-09 14:35:30,586 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 14:35:30,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-09 14:35:30,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 14:35:30,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-09 14:35:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 14:35:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-09 14:35:30,588 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 29 [2018-12-09 14:35:30,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:30,588 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-09 14:35:30,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 14:35:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-09 14:35:30,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 14:35:30,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:30,588 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-09 14:35:30,589 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 14:35:30,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:30,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1871061535, now seen corresponding path program 1 times [2018-12-09 14:35:30,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:35:30,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:35:30,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:30,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:30,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:30,604 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-09 14:35:30,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:30,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 14:35:30,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:35:30,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:35:30,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:35:30,605 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 3 states. [2018-12-09 14:35:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:30,630 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-12-09 14:35:30,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:35:30,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 14:35:30,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:30,630 INFO L225 Difference]: With dead ends: 61 [2018-12-09 14:35:30,631 INFO L226 Difference]: Without dead ends: 61 [2018-12-09 14:35:30,631 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-09 14:35:30,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-09 14:35:30,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-09 14:35:30,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 14:35:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-12-09 14:35:30,633 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 29 [2018-12-09 14:35:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:30,633 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-12-09 14:35:30,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:35:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-12-09 14:35:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 14:35:30,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:30,634 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-09 14:35:30,634 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-12-09 14:35:30,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:30,634 INFO L82 PathProgramCache]: Analyzing trace with hash -492861402, now seen corresponding path program 1 times [2018-12-09 14:35:30,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:35:30,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:35:30,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:30,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:30,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:35:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 14:35:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 14:35:30,667 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 14:35:30,678 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 14:35:30,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:35:30 BoogieIcfgContainer [2018-12-09 14:35:30,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 14:35:30,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 14:35:30,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 14:35:30,688 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 14:35:30,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:35:27" (3/4) ... [2018-12-09 14:35:30,692 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 14:35:30,692 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 14:35:30,692 INFO L168 Benchmark]: Toolchain (without parser) took 4109.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -181.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 14:35:30,693 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 14:35:30,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-09 14:35:30,694 INFO L168 Benchmark]: Boogie Preprocessor took 28.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 14:35:30,694 INFO L168 Benchmark]: RCFGBuilder took 287.37 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: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. [2018-12-09 14:35:30,694 INFO L168 Benchmark]: TraceAbstraction took 3535.22 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -78.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 14:35:30,695 INFO L168 Benchmark]: Witness Printer took 3.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 14:35:30,696 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 251.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 287.37 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: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3535.22 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -78.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 633]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 633. Possible FailurePath: [L635] struct item *list = ((void *)0); VAL [list={10:0}] [L637] CALL append(&list) VAL [plist={10:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L627] item->next = *plist VAL [\read(**plist)={0:0}, item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L628] EXPR item->next VAL [item={13:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, item={13:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, item={13:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L631] *plist = item VAL [item={13:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L637] RET append(&list) VAL [list={10:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] \read(*list) VAL [\read(*list)={13:0}, list={10:0}] [L639] COND TRUE \read(*list) [L640] EXPR \read(*list) VAL [\read(*list)={13:0}, list={10:0}] [L640] EXPR list->next VAL [\read(*list)={13:0}, list={10:0}, list->next={0:0}] [L640] struct item *next = list->next; [L641] EXPR \read(*list) VAL [\read(*list)={13:0}, list={10:0}, next={0:0}] [L641] free(list) VAL [\read(*list)={13:0}, list={10:0}, next={0:0}] [L641] free(list) [L642] list = next VAL [list={10:0}, next={0:0}] [L644] \read(*list) VAL [\read(*list)={0:0}, list={10:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) [L649] return 0; [L635] struct item *list = ((void *)0); [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 85 locations, 39 error locations. UNSAFE Result, 3.4s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 729 SDtfs, 693 SDslu, 1688 SDs, 0 SdLazy, 2061 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 39 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 362 ConstructedInterpolants, 11 QuantifiedInterpolants, 77138 SizeOfPredicates, 35 NumberOfNonLiveVariables, 366 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 14:35:31,949 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 14:35:31,950 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 14:35:31,956 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 14:35:31,956 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 14:35:31,957 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 14:35:31,958 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 14:35:31,958 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 14:35:31,959 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 14:35:31,959 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 14:35:31,960 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 14:35:31,960 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 14:35:31,961 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 14:35:31,961 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 14:35:31,962 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 14:35:31,962 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 14:35:31,962 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 14:35:31,963 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 14:35:31,964 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 14:35:31,965 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 14:35:31,966 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 14:35:31,966 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 14:35:31,967 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 14:35:31,967 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 14:35:31,968 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 14:35:31,968 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 14:35:31,969 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 14:35:31,969 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 14:35:31,969 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 14:35:31,970 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 14:35:31,970 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 14:35:31,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 14:35:31,971 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 14:35:31,971 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 14:35:31,971 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 14:35:31,972 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 14:35:31,972 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-12-09 14:35:31,979 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 14:35:31,979 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 14:35:31,980 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 14:35:31,980 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 14:35:31,980 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 14:35:31,980 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 14:35:31,981 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 14:35:31,981 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 14:35:31,981 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 14:35:31,981 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 14:35:31,981 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 14:35:31,981 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 14:35:31,981 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 14:35:31,981 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 14:35:31,981 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 14:35:31,981 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 14:35:31,981 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 14:35:31,982 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 14:35:31,982 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 14:35:31,982 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 14:35:31,982 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 14:35:31,982 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 14:35:31,982 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 14:35:31,982 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 14:35:31,982 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 14:35:31,982 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 14:35:31,982 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 14:35:31,983 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 14:35:31,983 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-09 14:35:31,983 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 14:35:31,983 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 14:35:31,983 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_f87a4745-7c33-4af2-9eac-5995e4345669/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 -> e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 [2018-12-09 14:35:32,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 14:35:32,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 14:35:32,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 14:35:32,015 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 14:35:32,016 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 14:35:32,016 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-12-09 14:35:32,059 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/data/b7bf65478/bc8e28399a694a32a193f6177285f9e0/FLAG46c6b23a3 [2018-12-09 14:35:32,392 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 14:35:32,393 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-12-09 14:35:32,399 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/data/b7bf65478/bc8e28399a694a32a193f6177285f9e0/FLAG46c6b23a3 [2018-12-09 14:35:32,407 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/bin-2019/uautomizer/data/b7bf65478/bc8e28399a694a32a193f6177285f9e0 [2018-12-09 14:35:32,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 14:35:32,410 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 14:35:32,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 14:35:32,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 14:35:32,413 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 14:35:32,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:35:32" (1/1) ... [2018-12-09 14:35:32,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7834880b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:32, skipping insertion in model container [2018-12-09 14:35:32,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:35:32" (1/1) ... [2018-12-09 14:35:32,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 14:35:32,437 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 14:35:32,587 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 14:35:32,593 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 14:35:32,619 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 14:35:32,674 INFO L195 MainTranslator]: Completed translation [2018-12-09 14:35:32,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:32 WrapperNode [2018-12-09 14:35:32,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 14:35:32,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 14:35:32,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 14:35:32,675 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 14:35:32,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:32" (1/1) ... [2018-12-09 14:35:32,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:32" (1/1) ... [2018-12-09 14:35:32,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:32" (1/1) ... [2018-12-09 14:35:32,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:32" (1/1) ... [2018-12-09 14:35:32,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:32" (1/1) ... [2018-12-09 14:35:32,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:32" (1/1) ... [2018-12-09 14:35:32,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:32" (1/1) ... [2018-12-09 14:35:32,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 14:35:32,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 14:35:32,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 14:35:32,708 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 14:35:32,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:32,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 14:35:32,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 14:35:32,738 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-09 14:35:32,739 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 14:35:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-09 14:35:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 14:35:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 14:35:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 14:35:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 14:35:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 14:35:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 14:35:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 14:35:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 14:35:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 14:35:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 14:35:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 14:35:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 14:35:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 14:35:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 14:35:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 14:35:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 14:35:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 14:35:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 14:35:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 14:35:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 14:35:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 14:35:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 14:35:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 14:35:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 14:35:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 14:35:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 14:35:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 14:35:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 14:35:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 14:35:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 14:35:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 14:35:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 14:35:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 14:35:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 14:35:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 14:35:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 14:35:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 14:35:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 14:35:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 14:35:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 14:35:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 14:35:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 14:35:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 14:35:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 14:35:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 14:35:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 14:35:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 14:35:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 14:35:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 14:35:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 14:35:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 14:35:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 14:35:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 14:35:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 14:35:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 14:35:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 14:35:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 14:35:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 14:35:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 14:35:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 14:35:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 14:35:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 14:35:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 14:35:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 14:35:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-09 14:35:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 14:35:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 14:35:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 14:35:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 14:35:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 14:35:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 14:35:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 14:35:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 14:35:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 14:35:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 14:35:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 14:35:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 14:35:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 14:35:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 14:35:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 14:35:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 14:35:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 14:35:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 14:35:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 14:35:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 14:35:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 14:35:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 14:35:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 14:35:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 14:35:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 14:35:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 14:35:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 14:35:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 14:35:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 14:35:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 14:35:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 14:35:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 14:35:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 14:35:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 14:35:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 14:35:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 14:35:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-09 14:35:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-09 14:35:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 14:35:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 14:35:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 14:35:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 14:35:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 14:35:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 14:35:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 14:35:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 14:35:33,063 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 14:35:33,063 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 14:35:33,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:35:33 BoogieIcfgContainer [2018-12-09 14:35:33,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 14:35:33,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 14:35:33,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 14:35:33,066 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 14:35:33,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:35:32" (1/3) ... [2018-12-09 14:35:33,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791d746d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:35:33, skipping insertion in model container [2018-12-09 14:35:33,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:35:32" (2/3) ... [2018-12-09 14:35:33,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791d746d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:35:33, skipping insertion in model container [2018-12-09 14:35:33,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:35:33" (3/3) ... [2018-12-09 14:35:33,068 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-12-09 14:35:33,074 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 14:35:33,078 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-12-09 14:35:33,087 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-12-09 14:35:33,102 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 14:35:33,102 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 14:35:33,102 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 14:35:33,102 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 14:35:33,103 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 14:35:33,103 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 14:35:33,103 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 14:35:33,103 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 14:35:33,103 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 14:35:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-12-09 14:35:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 14:35:33,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:33,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:35:33,122 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-09 14:35:33,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:33,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1993923955, now seen corresponding path program 1 times [2018-12-09 14:35:33,128 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 14:35:33,128 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:33,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:33,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:33,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-09 14:35:33,181 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 14:35:33,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:33,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 14:35:33,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 14:35:33,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 14:35:33,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 14:35:33,196 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-12-09 14:35:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:33,210 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-12-09 14:35:33,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 14:35:33,210 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-12-09 14:35:33,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:33,217 INFO L225 Difference]: With dead ends: 84 [2018-12-09 14:35:33,217 INFO L226 Difference]: Without dead ends: 81 [2018-12-09 14:35:33,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 14:35:33,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-09 14:35:33,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-09 14:35:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-09 14:35:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2018-12-09 14:35:33,244 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 8 [2018-12-09 14:35:33,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:33,244 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2018-12-09 14:35:33,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 14:35:33,244 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-12-09 14:35:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 14:35:33,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:33,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:35:33,245 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-09 14:35:33,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:33,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1682195681, now seen corresponding path program 1 times [2018-12-09 14:35:33,245 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 14:35:33,245 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:33,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:33,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:33,301 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-09 14:35:33,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:33,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:33,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 14:35:33,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:33,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:33,327 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-09 14:35:33,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:33,335 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-09 14:35:33,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-09 14:35:33,349 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-09 14:35:33,349 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 14:35:33,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:33,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 14:35:33,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 14:35:33,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 14:35:33,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:35:33,352 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 5 states. [2018-12-09 14:35:33,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:33,584 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-09 14:35:33,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 14:35:33,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-09 14:35:33,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:33,585 INFO L225 Difference]: With dead ends: 73 [2018-12-09 14:35:33,585 INFO L226 Difference]: Without dead ends: 73 [2018-12-09 14:35:33,586 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-09 14:35:33,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-09 14:35:33,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-09 14:35:33,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 14:35:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-12-09 14:35:33,590 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 9 [2018-12-09 14:35:33,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:33,590 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-12-09 14:35:33,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 14:35:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-12-09 14:35:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 14:35:33,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:33,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:35:33,591 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-09 14:35:33,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:33,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1682195682, now seen corresponding path program 1 times [2018-12-09 14:35:33,591 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 14:35:33,591 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:33,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:33,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:33,645 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-09 14:35:33,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:33,653 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-09 14:35:33,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:33,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:33,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 14:35:33,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:33,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:33,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 14:35:33,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:33,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:33,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:33,709 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-09 14:35:33,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:33,722 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-09 14:35:33,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-12-09 14:35:33,737 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-09 14:35:33,737 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 14:35:33,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:33,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 14:35:33,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 14:35:33,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 14:35:33,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 14:35:33,739 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 5 states. [2018-12-09 14:35:34,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:34,028 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-12-09 14:35:34,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 14:35:34,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-09 14:35:34,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:34,030 INFO L225 Difference]: With dead ends: 89 [2018-12-09 14:35:34,030 INFO L226 Difference]: Without dead ends: 89 [2018-12-09 14:35:34,031 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-09 14:35:34,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-09 14:35:34,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-12-09 14:35:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 14:35:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-12-09 14:35:34,037 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 9 [2018-12-09 14:35:34,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:34,037 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-12-09 14:35:34,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 14:35:34,037 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-12-09 14:35:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 14:35:34,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:34,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:35:34,038 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-09 14:35:34,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:34,039 INFO L82 PathProgramCache]: Analyzing trace with hash 608458612, now seen corresponding path program 1 times [2018-12-09 14:35:34,039 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 14:35:34,039 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:34,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:34,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:34,079 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-09 14:35:34,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:34,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:34,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 14:35:34,089 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-09 14:35:34,089 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 14:35:34,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:34,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 14:35:34,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:35:34,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:35:34,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:35:34,091 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 3 states. [2018-12-09 14:35:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:34,184 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-12-09 14:35:34,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:35:34,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 14:35:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:34,185 INFO L225 Difference]: With dead ends: 74 [2018-12-09 14:35:34,185 INFO L226 Difference]: Without dead ends: 74 [2018-12-09 14:35:34,186 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-09 14:35:34,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-09 14:35:34,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-09 14:35:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 14:35:34,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-12-09 14:35:34,190 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 10 [2018-12-09 14:35:34,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:34,190 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-12-09 14:35:34,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:35:34,191 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-12-09 14:35:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 14:35:34,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:34,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:35:34,191 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-09 14:35:34,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:34,192 INFO L82 PathProgramCache]: Analyzing trace with hash 608458613, now seen corresponding path program 1 times [2018-12-09 14:35:34,192 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 14:35:34,192 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:34,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:34,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:34,237 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-09 14:35:34,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:34,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:34,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 14:35:34,246 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-09 14:35:34,246 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 14:35:34,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:34,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 14:35:34,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:35:34,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:35:34,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:35:34,248 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 3 states. [2018-12-09 14:35:34,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:34,327 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-12-09 14:35:34,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:35:34,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 14:35:34,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:34,329 INFO L225 Difference]: With dead ends: 70 [2018-12-09 14:35:34,329 INFO L226 Difference]: Without dead ends: 70 [2018-12-09 14:35:34,329 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-09 14:35:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-09 14:35:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-09 14:35:34,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 14:35:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-12-09 14:35:34,333 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 10 [2018-12-09 14:35:34,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:34,333 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-12-09 14:35:34,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:35:34,333 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-12-09 14:35:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 14:35:34,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:34,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:35:34,334 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-09 14:35:34,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:34,334 INFO L82 PathProgramCache]: Analyzing trace with hash 620506892, now seen corresponding path program 1 times [2018-12-09 14:35:34,334 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 14:35:34,334 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:34,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:34,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:34,469 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-09 14:35:34,473 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-09 14:35:34,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:34,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:34,547 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-09 14:35:34,554 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-09 14:35:34,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:34,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, 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-09 14:35:34,590 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:34,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:34,613 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-09 14:35:34,614 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-12-09 14:35:34,643 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-09 14:35:34,647 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-09 14:35:34,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:34,663 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-09 14:35:34,663 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:34,676 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-09 14:35:34,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:34,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:34,698 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-09 14:35:34,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-09 14:35:34,701 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:34,720 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-09 14:35:34,720 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:34,734 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-09 14:35:34,734 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:34,737 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:34,740 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-09 14:35:34,740 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2018-12-09 14:35:34,755 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-09 14:35:34,755 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 14:35:34,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:34,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 14:35:34,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 14:35:34,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 14:35:34,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=38, Unknown=5, NotChecked=0, Total=56 [2018-12-09 14:35:34,757 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 8 states. [2018-12-09 14:35:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:35,247 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-12-09 14:35:35,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 14:35:35,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-09 14:35:35,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:35,248 INFO L225 Difference]: With dead ends: 78 [2018-12-09 14:35:35,248 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 14:35:35,248 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=97, Unknown=13, NotChecked=0, Total=156 [2018-12-09 14:35:35,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 14:35:35,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-12-09 14:35:35,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 14:35:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-12-09 14:35:35,253 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 15 [2018-12-09 14:35:35,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:35,253 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-12-09 14:35:35,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 14:35:35,253 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-12-09 14:35:35,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 14:35:35,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:35,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:35:35,254 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-09 14:35:35,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:35,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2056122585, now seen corresponding path program 1 times [2018-12-09 14:35:35,254 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 14:35:35,254 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:35,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:35,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:35,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:35,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 14:35:35,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:35,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:35,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:35,379 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-09 14:35:35,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:35,389 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-09 14:35:35,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-12-09 14:35:35,409 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-09 14:35:35,409 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 14:35:35,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:35,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:35:35,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 14:35:35,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 14:35:35,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 14:35:35,412 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 7 states. [2018-12-09 14:35:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:35,719 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-12-09 14:35:35,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 14:35:35,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-09 14:35:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:35,720 INFO L225 Difference]: With dead ends: 78 [2018-12-09 14:35:35,720 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 14:35:35,720 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-09 14:35:35,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 14:35:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-09 14:35:35,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 14:35:35,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-12-09 14:35:35,726 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 16 [2018-12-09 14:35:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:35,726 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-12-09 14:35:35,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 14:35:35,726 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-12-09 14:35:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 14:35:35,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:35,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] [2018-12-09 14:35:35,727 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-09 14:35:35,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:35,727 INFO L82 PathProgramCache]: Analyzing trace with hash -811500198, now seen corresponding path program 1 times [2018-12-09 14:35:35,728 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 14:35:35,728 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:35,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:35,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:35,807 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-09 14:35:35,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:35,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:35,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-09 14:35:35,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 14:35:35,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 14:35:35,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:35,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:35,831 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-09 14:35:35,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-09 14:35:35,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 19 treesize of output 15 [2018-12-09 14:35:35,850 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-09 14:35:35,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:35,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:35,852 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-09 14:35:35,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-09 14:35:35,860 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-09 14:35:35,860 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 14:35:35,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:35,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 14:35:35,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 14:35:35,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 14:35:35,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 14:35:35,863 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 8 states. [2018-12-09 14:35:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:36,132 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-12-09 14:35:36,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 14:35:36,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-12-09 14:35:36,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:36,133 INFO L225 Difference]: With dead ends: 84 [2018-12-09 14:35:36,133 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 14:35:36,133 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-09 14:35:36,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 14:35:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2018-12-09 14:35:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 14:35:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-12-09 14:35:36,136 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 23 [2018-12-09 14:35:36,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:36,137 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-12-09 14:35:36,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 14:35:36,137 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-12-09 14:35:36,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 14:35:36,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:36,137 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-09 14:35:36,137 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-09 14:35:36,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:36,137 INFO L82 PathProgramCache]: Analyzing trace with hash -811500197, now seen corresponding path program 1 times [2018-12-09 14:35:36,138 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 14:35:36,138 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:36,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:36,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:36,240 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-09 14:35:36,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 14:35:36,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:36,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:36,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 14:35:36,263 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-09 14:35:36,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:36,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:36,273 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-09 14:35:36,273 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-09 14:35:36,305 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-09 14:35:36,307 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-09 14:35:36,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:36,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:36,317 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-09 14:35:36,319 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-09 14:35:36,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:36,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:36,326 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-09 14:35:36,326 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-09 14:35:36,341 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-09 14:35:36,341 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 14:35:36,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:36,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 14:35:36,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 14:35:36,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 14:35:36,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 14:35:36,344 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 8 states. [2018-12-09 14:35:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:36,754 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-12-09 14:35:36,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 14:35:36,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-12-09 14:35:36,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:36,756 INFO L225 Difference]: With dead ends: 86 [2018-12-09 14:35:36,756 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 14:35:36,756 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-09 14:35:36,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 14:35:36,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2018-12-09 14:35:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 14:35:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-12-09 14:35:36,759 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 23 [2018-12-09 14:35:36,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:36,759 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-12-09 14:35:36,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 14:35:36,759 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-12-09 14:35:36,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 14:35:36,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:36,760 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-09 14:35:36,760 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-09 14:35:36,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:36,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1850615088, now seen corresponding path program 1 times [2018-12-09 14:35:36,761 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 14:35:36,761 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:36,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:36,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:36,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 14:35:36,842 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-09 14:35:36,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:36,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:36,848 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-09 14:35:36,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-12-09 14:35:36,862 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-09 14:35:36,863 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-09 14:35:36,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:36,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:36,865 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-09 14:35:36,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-12-09 14:35:36,873 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-09 14:35:36,873 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 14:35:36,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:36,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 14:35:36,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 14:35:36,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 14:35:36,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 14:35:36,875 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 7 states. [2018-12-09 14:35:37,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:37,086 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-09 14:35:37,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 14:35:37,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-12-09 14:35:37,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:37,088 INFO L225 Difference]: With dead ends: 70 [2018-12-09 14:35:37,088 INFO L226 Difference]: Without dead ends: 70 [2018-12-09 14:35:37,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 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-09 14:35:37,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-09 14:35:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-09 14:35:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 14:35:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-12-09 14:35:37,091 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 25 [2018-12-09 14:35:37,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:37,092 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-12-09 14:35:37,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 14:35:37,092 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-12-09 14:35:37,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 14:35:37,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:37,092 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-09 14:35:37,093 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-09 14:35:37,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:37,093 INFO L82 PathProgramCache]: Analyzing trace with hash 968508614, now seen corresponding path program 1 times [2018-12-09 14:35:37,093 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 14:35:37,093 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:37,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:37,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:37,183 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-09 14:35:37,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 14:35:37,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:37,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:37,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:37,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 14:35:37,204 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-09 14:35:37,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 14:35:37,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:37,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:37,208 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-09 14:35:37,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 14:35:37,217 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-09 14:35:37,218 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 14:35:37,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:37,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 14:35:37,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 14:35:37,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 14:35:37,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 14:35:37,220 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 7 states. [2018-12-09 14:35:37,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:37,382 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-12-09 14:35:37,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 14:35:37,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-09 14:35:37,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:37,383 INFO L225 Difference]: With dead ends: 69 [2018-12-09 14:35:37,383 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 14:35:37,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 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-09 14:35:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 14:35:37,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-09 14:35:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 14:35:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2018-12-09 14:35:37,385 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 26 [2018-12-09 14:35:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:37,385 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2018-12-09 14:35:37,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 14:35:37,386 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-12-09 14:35:37,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 14:35:37,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:37,386 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-09 14:35:37,386 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-09 14:35:37,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:37,387 INFO L82 PathProgramCache]: Analyzing trace with hash -41003973, now seen corresponding path program 1 times [2018-12-09 14:35:37,387 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 14:35:37,387 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:37,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:37,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:37,469 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-09 14:35:37,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:37,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:37,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-09 14:35:37,491 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-09 14:35:37,492 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-09 14:35:37,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:37,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:37,497 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-09 14:35:37,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-09 14:35:37,514 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-09 14:35:37,516 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-09 14:35:37,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:37,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:37,518 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-09 14:35:37,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-09 14:35:37,526 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-09 14:35:37,526 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 14:35:37,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:37,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 14:35:37,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 14:35:37,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 14:35:37,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 14:35:37,529 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 8 states. [2018-12-09 14:35:37,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:37,790 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-12-09 14:35:37,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 14:35:37,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-09 14:35:37,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:37,791 INFO L225 Difference]: With dead ends: 68 [2018-12-09 14:35:37,791 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 14:35:37,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 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-09 14:35:37,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 14:35:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-09 14:35:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 14:35:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-12-09 14:35:37,793 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 27 [2018-12-09 14:35:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:37,793 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-12-09 14:35:37,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 14:35:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-12-09 14:35:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 14:35:37,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:37,794 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] [2018-12-09 14:35:37,794 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-09 14:35:37,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:37,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1918400567, now seen corresponding path program 1 times [2018-12-09 14:35:37,794 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 14:35:37,794 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:37,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:37,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:37,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 14:35:37,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:37,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:37,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-09 14:35:37,913 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-09 14:35:37,915 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-09 14:35:37,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:37,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:37,920 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-09 14:35:37,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-09 14:35:37,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-09 14:35:37,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:37,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:37,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2018-12-09 14:35:38,010 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-09 14:35:38,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-09 14:35:38,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:38,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:38,044 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-09 14:35:38,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2018-12-09 14:35:38,084 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 30 treesize of output 30 [2018-12-09 14:35:38,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-12-09 14:35:38,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:38,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-12-09 14:35:38,106 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:38,130 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 22 treesize of output 7 [2018-12-09 14:35:38,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:38,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:38,141 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-09 14:35:38,142 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2018-12-09 14:35:38,160 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-09 14:35:38,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 14:35:38,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 11 treesize of output 9 [2018-12-09 14:35:38,354 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-09 14:35:38,354 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-09 14:35:38,358 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-09 14:35:38,381 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-09 14:35:38,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:50 [2018-12-09 14:35:38,463 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-09 14:35:38,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:38,475 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-09 14:35:38,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:38,486 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-09 14:35:38,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-12-09 14:35:38,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 14:35:38,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:38,490 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-09 14:35:38,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:38,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 14:35:38,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2018-12-09 14:35:38,498 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-09 14:35:38,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 14:35:38,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-12-09 14:35:38,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 14:35:38,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 14:35:38,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-09 14:35:38,501 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 17 states. [2018-12-09 14:35:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:39,579 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-12-09 14:35:39,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 14:35:39,579 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-12-09 14:35:39,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:39,580 INFO L225 Difference]: With dead ends: 72 [2018-12-09 14:35:39,580 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 14:35:39,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-12-09 14:35:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 14:35:39,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2018-12-09 14:35:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 14:35:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-12-09 14:35:39,582 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 28 [2018-12-09 14:35:39,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:39,582 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-12-09 14:35:39,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 14:35:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-12-09 14:35:39,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 14:35:39,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:39,583 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] [2018-12-09 14:35:39,584 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-09 14:35:39,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:39,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1918400566, now seen corresponding path program 1 times [2018-12-09 14:35:39,584 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 14:35:39,584 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:39,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:39,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:39,699 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-09 14:35:39,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:39,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 14:35:39,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:39,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:39,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-12-09 14:35:39,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:39,738 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-09 14:35:39,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:39,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:39,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:39,757 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-09 14:35:39,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:39,769 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-09 14:35:39,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-12-09 14:35:39,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 14:35:39,842 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-09 14:35:39,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:39,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:39,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 14:35:39,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 14:35:39,867 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:39,869 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:39,881 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-09 14:35:39,881 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:43 [2018-12-09 14:35:39,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:39,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2018-12-09 14:35:39,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:39,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:39,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:39,982 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-09 14:35:39,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:39,995 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-09 14:35:39,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:46 [2018-12-09 14:35:40,091 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-09 14:35:40,095 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-09 14:35:40,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:40,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:40,191 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-09 14:35:40,195 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 29 treesize of output 29 [2018-12-09 14:35:40,196 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:40,234 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 32 treesize of output 31 [2018-12-09 14:35:40,234 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:40,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:40,265 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-09 14:35:40,265 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2018-12-09 14:35:40,314 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-09 14:35:40,317 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-09 14:35:40,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:40,338 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-09 14:35:40,338 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:40,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:40,369 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-09 14:35:40,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-09 14:35:40,373 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:40,398 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 16 [2018-12-09 14:35:40,398 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:40,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, 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-09 14:35:40,419 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:40,426 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:40,431 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-09 14:35:40,432 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:68, output treesize:18 [2018-12-09 14:35:40,460 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-09 14:35:40,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 14:35:41,596 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-12-09 14:35:41,599 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-09 14:35:41,602 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-09 14:35:41,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:41,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:41,612 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-09 14:35:41,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 14:35:41,619 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:41,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:41,628 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-09 14:35:41,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, 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-09 14:35:41,632 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:41,635 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:41,792 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-09 14:35:41,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-09 14:35:41,796 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:41,799 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:41,801 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-09 14:35:41,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-09 14:35:41,803 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:41,806 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:41,929 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-09 14:35:41,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-09 14:35:41,932 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-09 14:35:41,943 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-09 14:35:41,946 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-09 14:35:41,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-09 14:35:41,950 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-09 14:35:41,962 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-09 14:35:42,088 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-09 14:35:42,091 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-09 14:35:42,091 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-09 14:35:42,103 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-09 14:35:42,106 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-09 14:35:42,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-09 14:35:42,110 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-09 14:35:42,121 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-09 14:35:42,246 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-09 14:35:42,246 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2018-12-09 14:35:42,572 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2018-12-09 14:35:42,579 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 14:35:42,579 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 14:35:42,580 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-09 14:35:42,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:42,638 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 14:35:42,638 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 14:35:42,639 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-09 14:35:42,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:42,690 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 14:35:42,691 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 14:35:42,691 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-09 14:35:42,691 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:42,742 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 14:35:42,743 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 14:35:42,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 16 treesize of output 7 [2018-12-09 14:35:42,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:42,792 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 14:35:42,793 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 14:35:42,793 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-09 14:35:42,793 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:42,840 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-09 14:35:42,841 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:94, output treesize:33 [2018-12-09 14:35:43,190 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-09 14:35:43,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 14:35:43,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-12-09 14:35:43,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 14:35:43,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 14:35:43,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-12-09 14:35:43,193 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 21 states. [2018-12-09 14:35:44,238 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2018-12-09 14:35:44,408 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 50 [2018-12-09 14:35:44,937 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 56 [2018-12-09 14:35:48,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:48,164 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-12-09 14:35:48,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 14:35:48,165 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-12-09 14:35:48,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:48,165 INFO L225 Difference]: With dead ends: 68 [2018-12-09 14:35:48,165 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 14:35:48,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2018-12-09 14:35:48,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 14:35:48,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-12-09 14:35:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 14:35:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-09 14:35:48,168 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 28 [2018-12-09 14:35:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:48,168 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-09 14:35:48,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 14:35:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-09 14:35:48,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 14:35:48,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:48,169 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-09 14:35:48,169 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-09 14:35:48,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:48,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1271123095, now seen corresponding path program 1 times [2018-12-09 14:35:48,170 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 14:35:48,170 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:48,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:48,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:48,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 14:35:48,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:48,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:48,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 14:35:48,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 5 treesize of output 1 [2018-12-09 14:35:48,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:48,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:48,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2018-12-09 14:35:48,285 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-09 14:35:48,287 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-09 14:35:48,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:48,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:48,294 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-09 14:35:48,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-09 14:35:48,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:48,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:48,305 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-09 14:35:48,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:48,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:48,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-12-09 14:35:48,322 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-09 14:35:48,324 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-09 14:35:48,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:48,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:48,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 14:35:48,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-12-09 14:35:48,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 14:35:48,339 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-09 14:35:48,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 14:35:48,343 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-09 14:35:48,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-09 14:35:48,355 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-09 14:35:48,356 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 14:35:48,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:48,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 14:35:48,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 14:35:48,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 14:35:48,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 14:35:48,358 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 9 states. [2018-12-09 14:35:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:50,734 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-12-09 14:35:50,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 14:35:50,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-12-09 14:35:50,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:50,735 INFO L225 Difference]: With dead ends: 81 [2018-12-09 14:35:50,735 INFO L226 Difference]: Without dead ends: 81 [2018-12-09 14:35:50,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-09 14:35:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-09 14:35:50,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2018-12-09 14:35:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 14:35:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-12-09 14:35:50,738 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 28 [2018-12-09 14:35:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:50,738 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-12-09 14:35:50,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 14:35:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-12-09 14:35:50,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 14:35:50,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:50,739 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-09 14:35:50,739 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-09 14:35:50,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:50,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1271123094, now seen corresponding path program 1 times [2018-12-09 14:35:50,739 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 14:35:50,740 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:50,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:35:50,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:35:50,794 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-09 14:35:50,794 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 14:35:50,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:35:50,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 14:35:50,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:35:50,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:35:50,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:35:50,796 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 3 states. [2018-12-09 14:35:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:35:50,882 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-09 14:35:50,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:35:50,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 14:35:50,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:35:50,882 INFO L225 Difference]: With dead ends: 60 [2018-12-09 14:35:50,883 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 14:35:50,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-09 14:35:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 14:35:50,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-09 14:35:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 14:35:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-12-09 14:35:50,884 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 28 [2018-12-09 14:35:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:35:50,884 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-12-09 14:35:50,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:35:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-12-09 14:35:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 14:35:50,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:35:50,885 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-09 14:35:50,885 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-09 14:35:50,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:35:50,885 INFO L82 PathProgramCache]: Analyzing trace with hash 179927279, now seen corresponding path program 1 times [2018-12-09 14:35:50,885 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 14:35:50,885 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f87a4745-7c33-4af2-9eac-5995e4345669/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-09 14:35:50,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:35:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 14:35:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 14:35:51,161 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 14:35:51,170 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 14:35:51,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:35:51 BoogieIcfgContainer [2018-12-09 14:35:51,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 14:35:51,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 14:35:51,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 14:35:51,180 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 14:35:51,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:35:33" (3/4) ... [2018-12-09 14:35:51,183 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 14:35:51,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 14:35:51,184 INFO L168 Benchmark]: Toolchain (without parser) took 18774.30 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.1 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 140.8 MB. Max. memory is 11.5 GB. [2018-12-09 14:35:51,184 INFO L168 Benchmark]: CDTParser took 0.18 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-09 14:35:51,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -200.6 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2018-12-09 14:35:51,184 INFO L168 Benchmark]: Boogie Preprocessor took 32.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-09 14:35:51,184 INFO L168 Benchmark]: RCFGBuilder took 355.93 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: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2018-12-09 14:35:51,184 INFO L168 Benchmark]: TraceAbstraction took 18115.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.3 MB). Peak memory consumption was 137.2 MB. Max. memory is 11.5 GB. [2018-12-09 14:35:51,185 INFO L168 Benchmark]: Witness Printer took 3.09 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 14:35:51,185 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.18 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 264.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -200.6 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 355.93 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: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18115.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.3 MB). Peak memory consumption was 137.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.09 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 633]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 633. Possible FailurePath: [L635] struct item *list = ((void *)0); VAL [list={-2146959039:0}] [L637] CALL append(&list) VAL [plist={-2146959039:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={-2146959040:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={-2146959040:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L627] item->next = *plist VAL [\read(**plist)={0:0}, item={-2146959040:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L628] EXPR item->next VAL [item={-2146959040:0}, item->next={0:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2147483648:0}, item={-2146959040:0}, item->next={0:0}, malloc(sizeof *item)={-2147483648:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2147483648:0}, item={-2146959040:0}, item->next={0:0}, malloc(sizeof *item)={-2147483648:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L631] *plist = item VAL [item={-2146959040:0}, malloc(sizeof *item)={-2147483648:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L637] RET append(&list) VAL [list={-2146959039:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] \read(*list) VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}] [L639] COND TRUE \read(*list) [L640] EXPR \read(*list) VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}] [L640] EXPR list->next VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}, list->next={0:0}] [L640] struct item *next = list->next; [L641] EXPR \read(*list) VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}, next={0:0}] [L641] free(list) VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}, next={0:0}] [L641] free(list) [L642] list = next VAL [list={-2146959039:0}, next={0:0}] [L644] \read(*list) VAL [\read(*list)={0:0}, list={-2146959039:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) [L649] return 0; [L635] struct item *list = ((void *)0); [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 84 locations, 39 error locations. UNSAFE Result, 18.0s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 11.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 677 SDtfs, 891 SDslu, 1763 SDs, 0 SdLazy, 2509 SolverSat, 133 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 261 SyntacticMatches, 3 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 52 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 351 ConstructedInterpolants, 44 QuantifiedInterpolants, 102672 SizeOfPredicates, 125 NumberOfNonLiveVariables, 1501 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...