./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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 dd0b9292151174331f3cf63e5ad3d651d29dfbcc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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 dd0b9292151174331f3cf63e5ad3d651d29dfbcc ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:21:36,914 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:21:36,915 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:21:36,923 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:21:36,923 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:21:36,924 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:21:36,924 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:21:36,926 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:21:36,927 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:21:36,927 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:21:36,928 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:21:36,928 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:21:36,929 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:21:36,930 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:21:36,930 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:21:36,931 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:21:36,932 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:21:36,933 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:21:36,934 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:21:36,935 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:21:36,936 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:21:36,937 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:21:36,939 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:21:36,939 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:21:36,939 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:21:36,940 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:21:36,941 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:21:36,941 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:21:36,942 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:21:36,943 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:21:36,943 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:21:36,944 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:21:36,944 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:21:36,944 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:21:36,944 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:21:36,945 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:21:36,945 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 13:21:36,954 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:21:36,955 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:21:36,955 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:21:36,955 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:21:36,956 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:21:36,956 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:21:36,956 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:21:36,956 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:21:36,956 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:21:36,957 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:21:36,957 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:21:36,957 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:21:36,957 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:21:36,957 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 13:21:36,957 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 13:21:36,957 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 13:21:36,957 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:21:36,958 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:21:36,958 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:21:36,958 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:21:36,958 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:21:36,958 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:21:36,958 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:21:36,958 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:21:36,959 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:21:36,959 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:21:36,959 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:21:36,959 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:21:36,959 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_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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 -> dd0b9292151174331f3cf63e5ad3d651d29dfbcc [2018-11-28 13:21:36,982 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:21:36,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:21:36,992 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:21:36,993 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:21:36,993 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:21:36,994 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-11-28 13:21:37,030 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/data/ea7010604/d339d27f7d8e43af8e1dd14d599d6f8a/FLAG4e92173f1 [2018-11-28 13:21:37,466 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:21:37,467 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-11-28 13:21:37,474 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/data/ea7010604/d339d27f7d8e43af8e1dd14d599d6f8a/FLAG4e92173f1 [2018-11-28 13:21:37,483 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/data/ea7010604/d339d27f7d8e43af8e1dd14d599d6f8a [2018-11-28 13:21:37,485 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:21:37,486 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 13:21:37,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:21:37,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:21:37,490 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:21:37,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:21:37" (1/1) ... [2018-11-28 13:21:37,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3592b053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:37, skipping insertion in model container [2018-11-28 13:21:37,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:21:37" (1/1) ... [2018-11-28 13:21:37,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:21:37,521 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:21:37,697 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:21:37,703 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:21:37,769 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:21:37,801 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:21:37,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:37 WrapperNode [2018-11-28 13:21:37,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:21:37,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:21:37,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:21:37,802 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:21:37,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:37" (1/1) ... [2018-11-28 13:21:37,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:37" (1/1) ... [2018-11-28 13:21:37,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:37" (1/1) ... [2018-11-28 13:21:37,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:37" (1/1) ... [2018-11-28 13:21:37,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:37" (1/1) ... [2018-11-28 13:21:37,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:37" (1/1) ... [2018-11-28 13:21:37,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:37" (1/1) ... [2018-11-28 13:21:37,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:21:37,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:21:37,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:21:37,848 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:21:37,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:21:37,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:21:37,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:21:37,889 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-28 13:21:37,889 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:21:37,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 13:21:37,890 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 13:21:37,890 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 13:21:37,890 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 13:21:37,890 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 13:21:37,890 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 13:21:37,890 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 13:21:37,890 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 13:21:37,890 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 13:21:37,890 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 13:21:37,890 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 13:21:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 13:21:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 13:21:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 13:21:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 13:21:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 13:21:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 13:21:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 13:21:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 13:21:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 13:21:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 13:21:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 13:21:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 13:21:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 13:21:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 13:21:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 13:21:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 13:21:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 13:21:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 13:21:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 13:21:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 13:21:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 13:21:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 13:21:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 13:21:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 13:21:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 13:21:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 13:21:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 13:21:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 13:21:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 13:21:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 13:21:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 13:21:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 13:21:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 13:21:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 13:21:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 13:21:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 13:21:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 13:21:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 13:21:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 13:21:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 13:21:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 13:21:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 13:21:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 13:21:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 13:21:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 13:21:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 13:21:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 13:21:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 13:21:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 13:21:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 13:21:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 13:21:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 13:21:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 13:21:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 13:21:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 13:21:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 13:21:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 13:21:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 13:21:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 13:21:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 13:21:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 13:21:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 13:21:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 13:21:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 13:21:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 13:21:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 13:21:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 13:21:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 13:21:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 13:21:37,898 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 13:21:37,899 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 13:21:37,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 13:21:37,899 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 13:21:37,899 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 13:21:37,899 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 13:21:37,899 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 13:21:37,899 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 13:21:37,899 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 13:21:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 13:21:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 13:21:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 13:21:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 13:21:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 13:21:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 13:21:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 13:21:37,902 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 13:21:37,902 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 13:21:37,902 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 13:21:37,902 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 13:21:37,902 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 13:21:37,902 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 13:21:37,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 13:21:37,902 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-28 13:21:37,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:21:37,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 13:21:37,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 13:21:37,903 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:21:37,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 13:21:37,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:21:37,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:21:37,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:21:38,275 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:21:38,275 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 13:21:38,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:21:38 BoogieIcfgContainer [2018-11-28 13:21:38,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:21:38,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:21:38,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:21:38,279 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:21:38,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:21:37" (1/3) ... [2018-11-28 13:21:38,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6433f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:21:38, skipping insertion in model container [2018-11-28 13:21:38,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:37" (2/3) ... [2018-11-28 13:21:38,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6433f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:21:38, skipping insertion in model container [2018-11-28 13:21:38,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:21:38" (3/3) ... [2018-11-28 13:21:38,282 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-11-28 13:21:38,291 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:21:38,298 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-11-28 13:21:38,313 INFO L257 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2018-11-28 13:21:38,333 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:21:38,334 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:21:38,334 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 13:21:38,334 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:21:38,334 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:21:38,334 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:21:38,334 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:21:38,334 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:21:38,334 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:21:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2018-11-28 13:21:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 13:21:38,354 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:38,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:38,356 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:38,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:38,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1733579010, now seen corresponding path program 1 times [2018-11-28 13:21:38,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:38,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:38,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:38,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:38,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:38,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:38,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:21:38,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:21:38,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:21:38,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:21:38,543 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 5 states. [2018-11-28 13:21:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:38,836 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-11-28 13:21:38,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:21:38,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 13:21:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:38,847 INFO L225 Difference]: With dead ends: 120 [2018-11-28 13:21:38,848 INFO L226 Difference]: Without dead ends: 117 [2018-11-28 13:21:38,849 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-11-28 13:21:38,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-28 13:21:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2018-11-28 13:21:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 13:21:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-11-28 13:21:38,879 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 9 [2018-11-28 13:21:38,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:38,879 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-11-28 13:21:38,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:21:38,880 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-11-28 13:21:38,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 13:21:38,880 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:38,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:38,880 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:38,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:38,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1733579011, now seen corresponding path program 1 times [2018-11-28 13:21:38,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:38,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:38,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:38,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:38,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:38,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:38,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:21:38,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:21:38,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:21:38,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:21:38,924 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 5 states. [2018-11-28 13:21:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:39,012 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-11-28 13:21:39,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:21:39,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 13:21:39,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:39,013 INFO L225 Difference]: With dead ends: 94 [2018-11-28 13:21:39,013 INFO L226 Difference]: Without dead ends: 94 [2018-11-28 13:21:39,014 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-11-28 13:21:39,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-28 13:21:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-11-28 13:21:39,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-28 13:21:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2018-11-28 13:21:39,018 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 9 [2018-11-28 13:21:39,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:39,019 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-11-28 13:21:39,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:21:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2018-11-28 13:21:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 13:21:39,019 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:39,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:39,020 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:39,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:39,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2093625574, now seen corresponding path program 1 times [2018-11-28 13:21:39,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:39,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:39,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:39,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:39,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:39,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:39,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:39,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:21:39,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:21:39,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:21:39,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:21:39,042 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 3 states. [2018-11-28 13:21:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:39,094 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-11-28 13:21:39,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:21:39,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 13:21:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:39,095 INFO L225 Difference]: With dead ends: 90 [2018-11-28 13:21:39,095 INFO L226 Difference]: Without dead ends: 90 [2018-11-28 13:21:39,095 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-11-28 13:21:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-28 13:21:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-28 13:21:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-28 13:21:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2018-11-28 13:21:39,099 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 10 [2018-11-28 13:21:39,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:39,100 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2018-11-28 13:21:39,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:21:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2018-11-28 13:21:39,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 13:21:39,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:39,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:39,101 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:39,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:39,101 INFO L82 PathProgramCache]: Analyzing trace with hash 2093625575, now seen corresponding path program 1 times [2018-11-28 13:21:39,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:39,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:39,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:39,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:39,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:21:39,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:21:39,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:21:39,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:21:39,144 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 3 states. [2018-11-28 13:21:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:39,182 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-11-28 13:21:39,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:21:39,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 13:21:39,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:39,183 INFO L225 Difference]: With dead ends: 86 [2018-11-28 13:21:39,183 INFO L226 Difference]: Without dead ends: 86 [2018-11-28 13:21:39,183 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-11-28 13:21:39,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-28 13:21:39,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-28 13:21:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-28 13:21:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2018-11-28 13:21:39,186 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 10 [2018-11-28 13:21:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:39,186 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2018-11-28 13:21:39,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:21:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2018-11-28 13:21:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 13:21:39,187 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:39,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:39,187 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:39,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:39,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1720338793, now seen corresponding path program 1 times [2018-11-28 13:21:39,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:39,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:39,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:39,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:39,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:39,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:39,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:21:39,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:21:39,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:21:39,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:21:39,276 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 8 states. [2018-11-28 13:21:39,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:39,418 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2018-11-28 13:21:39,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:21:39,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-28 13:21:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:39,420 INFO L225 Difference]: With dead ends: 97 [2018-11-28 13:21:39,420 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 13:21:39,421 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-11-28 13:21:39,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 13:21:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-11-28 13:21:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 13:21:39,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-11-28 13:21:39,428 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 15 [2018-11-28 13:21:39,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:39,428 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-11-28 13:21:39,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:21:39,429 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-11-28 13:21:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 13:21:39,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:39,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:39,432 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:39,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:39,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1791173131, now seen corresponding path program 1 times [2018-11-28 13:21:39,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:39,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:39,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:39,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:39,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:39,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:39,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:21:39,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:21:39,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:21:39,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:21:39,517 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 6 states. [2018-11-28 13:21:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:39,611 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-11-28 13:21:39,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:21:39,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-28 13:21:39,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:39,612 INFO L225 Difference]: With dead ends: 105 [2018-11-28 13:21:39,612 INFO L226 Difference]: Without dead ends: 105 [2018-11-28 13:21:39,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:21:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-28 13:21:39,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2018-11-28 13:21:39,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-28 13:21:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-11-28 13:21:39,616 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 16 [2018-11-28 13:21:39,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:39,616 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-11-28 13:21:39,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:21:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-28 13:21:39,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 13:21:39,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:39,617 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-11-28 13:21:39,618 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:39,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:39,618 INFO L82 PathProgramCache]: Analyzing trace with hash -863246286, now seen corresponding path program 1 times [2018-11-28 13:21:39,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:39,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:39,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:39,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:39,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:39,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:39,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:21:39,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:21:39,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:21:39,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:21:39,675 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 7 states. [2018-11-28 13:21:39,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:39,793 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-11-28 13:21:39,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:21:39,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-28 13:21:39,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:39,794 INFO L225 Difference]: With dead ends: 101 [2018-11-28 13:21:39,794 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 13:21:39,795 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-11-28 13:21:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 13:21:39,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2018-11-28 13:21:39,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-28 13:21:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-11-28 13:21:39,798 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 25 [2018-11-28 13:21:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:39,799 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-11-28 13:21:39,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:21:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-11-28 13:21:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 13:21:39,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:39,799 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-11-28 13:21:39,800 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:39,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:39,800 INFO L82 PathProgramCache]: Analyzing trace with hash -863246285, now seen corresponding path program 1 times [2018-11-28 13:21:39,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:39,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:39,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:39,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:39,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:39,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:39,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:21:39,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:21:39,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:21:39,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:21:39,922 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 7 states. [2018-11-28 13:21:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:40,029 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-11-28 13:21:40,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:21:40,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-28 13:21:40,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:40,030 INFO L225 Difference]: With dead ends: 98 [2018-11-28 13:21:40,030 INFO L226 Difference]: Without dead ends: 98 [2018-11-28 13:21:40,030 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-11-28 13:21:40,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-28 13:21:40,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2018-11-28 13:21:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 13:21:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-11-28 13:21:40,033 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 25 [2018-11-28 13:21:40,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:40,034 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-11-28 13:21:40,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:21:40,034 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-11-28 13:21:40,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 13:21:40,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:40,034 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-11-28 13:21:40,035 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:40,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:40,035 INFO L82 PathProgramCache]: Analyzing trace with hash -863258234, now seen corresponding path program 1 times [2018-11-28 13:21:40,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:40,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:40,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:40,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:40,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:40,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:40,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:21:40,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:21:40,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:21:40,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:21:40,057 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 3 states. [2018-11-28 13:21:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:40,064 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-11-28 13:21:40,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:21:40,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 13:21:40,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:40,065 INFO L225 Difference]: With dead ends: 72 [2018-11-28 13:21:40,065 INFO L226 Difference]: Without dead ends: 72 [2018-11-28 13:21:40,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:21:40,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-28 13:21:40,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-28 13:21:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 13:21:40,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-11-28 13:21:40,068 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 25 [2018-11-28 13:21:40,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:40,069 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-11-28 13:21:40,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:21:40,069 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-11-28 13:21:40,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 13:21:40,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:40,069 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-11-28 13:21:40,070 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:40,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:40,070 INFO L82 PathProgramCache]: Analyzing trace with hash -862144052, now seen corresponding path program 1 times [2018-11-28 13:21:40,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:40,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:40,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:40,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:40,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:40,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:40,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:21:40,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:21:40,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:21:40,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:21:40,096 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 3 states. [2018-11-28 13:21:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:40,104 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-28 13:21:40,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:21:40,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 13:21:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:40,105 INFO L225 Difference]: With dead ends: 69 [2018-11-28 13:21:40,105 INFO L226 Difference]: Without dead ends: 69 [2018-11-28 13:21:40,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:21:40,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-28 13:21:40,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-28 13:21:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 13:21:40,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-28 13:21:40,108 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 25 [2018-11-28 13:21:40,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:40,108 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-28 13:21:40,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:21:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-28 13:21:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 13:21:40,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:40,109 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-11-28 13:21:40,109 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:40,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:40,109 INFO L82 PathProgramCache]: Analyzing trace with hash -862145304, now seen corresponding path program 1 times [2018-11-28 13:21:40,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:40,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:40,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:40,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:40,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:40,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:40,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:21:40,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:21:40,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:21:40,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:21:40,149 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 4 states. [2018-11-28 13:21:40,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:40,164 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-28 13:21:40,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:21:40,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-28 13:21:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:40,166 INFO L225 Difference]: With dead ends: 68 [2018-11-28 13:21:40,166 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 13:21:40,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:21:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 13:21:40,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-11-28 13:21:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 13:21:40,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-11-28 13:21:40,168 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 25 [2018-11-28 13:21:40,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:40,168 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-11-28 13:21:40,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:21:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-28 13:21:40,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 13:21:40,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:40,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-11-28 13:21:40,169 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:40,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:40,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1294075165, now seen corresponding path program 1 times [2018-11-28 13:21:40,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:40,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:40,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:40,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:40,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:40,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:40,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:21:40,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:21:40,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:21:40,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:21:40,231 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 6 states. [2018-11-28 13:21:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:40,286 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-11-28 13:21:40,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:21:40,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-28 13:21:40,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:40,287 INFO L225 Difference]: With dead ends: 66 [2018-11-28 13:21:40,287 INFO L226 Difference]: Without dead ends: 66 [2018-11-28 13:21:40,288 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-11-28 13:21:40,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-28 13:21:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-28 13:21:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 13:21:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-11-28 13:21:40,290 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 28 [2018-11-28 13:21:40,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:40,290 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-11-28 13:21:40,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:21:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-11-28 13:21:40,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 13:21:40,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:40,291 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-11-28 13:21:40,293 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:40,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:40,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1461624531, now seen corresponding path program 1 times [2018-11-28 13:21:40,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:40,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:40,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:40,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:40,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:40,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:40,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:21:40,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:21:40,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:21:40,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:21:40,319 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 5 states. [2018-11-28 13:21:40,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:40,379 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-11-28 13:21:40,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:21:40,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-28 13:21:40,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:40,380 INFO L225 Difference]: With dead ends: 65 [2018-11-28 13:21:40,380 INFO L226 Difference]: Without dead ends: 65 [2018-11-28 13:21:40,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:21:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-28 13:21:40,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-28 13:21:40,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 13:21:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-11-28 13:21:40,382 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 29 [2018-11-28 13:21:40,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:40,383 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-11-28 13:21:40,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:21:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-11-28 13:21:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 13:21:40,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:40,383 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:40,384 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:40,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:40,384 INFO L82 PathProgramCache]: Analyzing trace with hash -98352470, now seen corresponding path program 1 times [2018-11-28 13:21:40,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:40,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:40,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:40,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:40,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:40,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:40,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:21:40,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:21:40,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:40,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:40,605 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-11-28 13:21:40,607 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-11-28 13:21:40,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,633 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-11-28 13:21:40,635 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-11-28 13:21:40,635 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,643 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-11-28 13:21:40,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:40,684 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-11-28 13:21:40,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:40,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:40,697 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-11-28 13:21:40,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-11-28 13:21:40,767 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-11-28 13:21:40,772 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-11-28 13:21:40,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,805 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-11-28 13:21:40,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-28 13:21:40,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,835 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-11-28 13:21:40,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-11-28 13:21:40,873 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-11-28 13:21:40,877 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-11-28 13:21:40,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,902 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-11-28 13:21:40,905 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-11-28 13:21:40,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 13:21:40,915 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 13:21:40,925 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:40,934 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-11-28 13:21:40,934 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-11-28 13:21:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:40,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:21:40,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2018-11-28 13:21:40,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 13:21:40,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 13:21:40,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2018-11-28 13:21:40,974 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 17 states. [2018-11-28 13:21:41,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:41,490 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-28 13:21:41,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:21:41,492 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-11-28 13:21:41,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:41,492 INFO L225 Difference]: With dead ends: 71 [2018-11-28 13:21:41,492 INFO L226 Difference]: Without dead ends: 71 [2018-11-28 13:21:41,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=446, Unknown=1, NotChecked=0, Total=552 [2018-11-28 13:21:41,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-28 13:21:41,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-11-28 13:21:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 13:21:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-11-28 13:21:41,496 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 30 [2018-11-28 13:21:41,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:41,496 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-11-28 13:21:41,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 13:21:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-11-28 13:21:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 13:21:41,497 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:41,497 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:41,497 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:41,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:41,498 INFO L82 PathProgramCache]: Analyzing trace with hash -98352471, now seen corresponding path program 1 times [2018-11-28 13:21:41,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:41,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:41,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:41,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:41,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:41,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:21:41,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:21:41,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:41,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:41,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 13:21:41,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-11-28 13:21:41,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:41,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:41,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:41,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-11-28 13:21:41,745 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-11-28 13:21:41,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:41,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:41,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-11-28 13:21:41,786 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-11-28 13:21:41,789 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-11-28 13:21:41,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:41,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:41,811 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-11-28 13:21:41,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-11-28 13:21:41,835 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-11-28 13:21:41,837 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-11-28 13:21:41,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:41,846 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-11-28 13:21:41,846 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:41,855 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-11-28 13:21:41,855 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:41,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:41,861 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-11-28 13:21:41,861 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-11-28 13:21:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:41,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:21:41,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2018-11-28 13:21:41,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 13:21:41,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 13:21:41,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:21:41,886 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 17 states. [2018-11-28 13:21:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:42,277 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-28 13:21:42,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:21:42,278 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-11-28 13:21:42,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:42,279 INFO L225 Difference]: With dead ends: 70 [2018-11-28 13:21:42,279 INFO L226 Difference]: Without dead ends: 70 [2018-11-28 13:21:42,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2018-11-28 13:21:42,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-28 13:21:42,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-28 13:21:42,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 13:21:42,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-11-28 13:21:42,282 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 30 [2018-11-28 13:21:42,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:42,284 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-28 13:21:42,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 13:21:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-28 13:21:42,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 13:21:42,285 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:42,285 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:42,286 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:42,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:42,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1934279712, now seen corresponding path program 1 times [2018-11-28 13:21:42,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:42,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:42,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:42,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:42,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:42,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:42,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:21:42,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:21:42,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:21:42,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:21:42,361 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 8 states. [2018-11-28 13:21:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:42,450 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-28 13:21:42,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:21:42,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-28 13:21:42,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:42,452 INFO L225 Difference]: With dead ends: 67 [2018-11-28 13:21:42,452 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 13:21:42,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:21:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 13:21:42,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-28 13:21:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 13:21:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-28 13:21:42,455 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 30 [2018-11-28 13:21:42,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:42,455 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-28 13:21:42,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:21:42,455 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-28 13:21:42,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 13:21:42,456 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:42,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:42,456 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:42,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:42,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1934279711, now seen corresponding path program 1 times [2018-11-28 13:21:42,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:42,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:42,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:42,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:42,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:42,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:42,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:42,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:21:42,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:21:42,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:21:42,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:21:42,491 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 3 states. [2018-11-28 13:21:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:42,518 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-28 13:21:42,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:21:42,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 13:21:42,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:42,519 INFO L225 Difference]: With dead ends: 63 [2018-11-28 13:21:42,519 INFO L226 Difference]: Without dead ends: 63 [2018-11-28 13:21:42,520 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-11-28 13:21:42,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-28 13:21:42,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-28 13:21:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-28 13:21:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-11-28 13:21:42,521 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 30 [2018-11-28 13:21:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:42,522 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-28 13:21:42,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:21:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-28 13:21:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 13:21:42,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:42,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:42,523 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:42,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:42,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1979694254, now seen corresponding path program 1 times [2018-11-28 13:21:42,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:42,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:42,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:42,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:42,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:42,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:42,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:21:42,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:21:42,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:21:42,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:21:42,564 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 5 states. [2018-11-28 13:21:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:42,581 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-11-28 13:21:42,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:21:42,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-28 13:21:42,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:42,583 INFO L225 Difference]: With dead ends: 79 [2018-11-28 13:21:42,583 INFO L226 Difference]: Without dead ends: 79 [2018-11-28 13:21:42,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:21:42,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-28 13:21:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-11-28 13:21:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 13:21:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-11-28 13:21:42,586 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 34 [2018-11-28 13:21:42,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:42,587 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-11-28 13:21:42,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:21:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-11-28 13:21:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 13:21:42,588 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:42,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, 1, 1, 1, 1, 1] [2018-11-28 13:21:42,588 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 13:21:42,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:42,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1979693002, now seen corresponding path program 1 times [2018-11-28 13:21:42,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:42,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:42,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:42,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:42,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:21:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:21:42,622 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:21:42,634 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-11-28 13:21:42,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:21:42 BoogieIcfgContainer [2018-11-28 13:21:42,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:21:42,649 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:21:42,649 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:21:42,650 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:21:42,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:21:38" (3/4) ... [2018-11-28 13:21:42,654 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:21:42,654 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:21:42,655 INFO L168 Benchmark]: Toolchain (without parser) took 5169.36 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.9 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -204.1 MB). Peak memory consumption was 138.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:21:42,656 INFO L168 Benchmark]: CDTParser took 0.11 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-11-28 13:21:42,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -203.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:21:42,656 INFO L168 Benchmark]: Boogie Preprocessor took 46.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:21:42,657 INFO L168 Benchmark]: RCFGBuilder took 427.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:21:42,657 INFO L168 Benchmark]: TraceAbstraction took 4373.02 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -59.1 MB). Peak memory consumption was 117.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:21:42,657 INFO L168 Benchmark]: Witness Printer took 4.89 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:21:42,659 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.11 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 314.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -203.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 427.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4373.02 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -59.1 MB). Peak memory consumption was 117.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.89 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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: 635]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 635. Possible FailurePath: [L620] int c = 0; VAL [\old(c)=12, c=0] [L637] struct item *list = ((void *)0); [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={11:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={11:0}] [L627] c++ [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={13:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L629] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={13:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L629] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={13:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L630] EXPR item->next VAL [\old(c)=0, c=1, item={13:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={10:0}, \old(c)=0, c=1, item={13:0}, item->next={0:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L630-L632] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={10:0}, \old(c)=0, c=1, item={13:0}, item->next={0:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L633] *plist = item VAL [\old(c)=0, c=1, item={13:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L640] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={11:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={11:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={11:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={11:0}] [L647] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={13:0}, c=1, length=1, list={11:0}] [L647] EXPR list->next VAL [\old(c)=0, \read(*list)={13:0}, c=1, length=1, list={11:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={13:0}, c=1, length=1, list={11:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={13:0}, c=1, length=1, list={11:0}, next={0:0}] [L648] free(list) [L649] list = next VAL [\old(c)=0, c=1, length=1, list={11:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={11:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={11:0}, next={0:0}] [L658] return 0; [L637] struct item *list = ((void *)0); [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 93 locations, 41 error locations. UNSAFE Result, 4.3s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 944 SDtfs, 732 SDslu, 2145 SDs, 0 SdLazy, 2135 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 64 SyntacticMatches, 9 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=1, 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, 18 MinimizatonAttempts, 68 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 499 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 445 ConstructedInterpolants, 11 QuantifiedInterpolants, 80133 SizeOfPredicates, 35 NumberOfNonLiveVariables, 420 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 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-0cd3be1 [2018-11-28 13:21:44,163 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:21:44,165 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:21:44,174 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:21:44,174 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:21:44,175 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:21:44,176 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:21:44,177 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:21:44,179 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:21:44,179 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:21:44,180 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:21:44,180 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:21:44,181 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:21:44,181 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:21:44,183 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:21:44,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:21:44,184 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:21:44,186 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:21:44,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:21:44,189 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:21:44,189 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:21:44,190 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:21:44,192 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:21:44,192 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:21:44,193 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:21:44,193 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:21:44,194 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:21:44,195 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:21:44,196 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:21:44,196 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:21:44,197 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:21:44,197 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:21:44,197 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:21:44,197 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:21:44,198 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:21:44,199 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:21:44,200 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-11-28 13:21:44,210 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:21:44,210 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:21:44,211 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:21:44,211 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:21:44,212 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:21:44,212 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:21:44,212 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:21:44,212 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:21:44,212 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:21:44,212 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:21:44,213 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:21:44,213 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:21:44,213 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:21:44,213 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 13:21:44,213 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 13:21:44,213 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 13:21:44,213 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:21:44,213 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-28 13:21:44,214 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-28 13:21:44,214 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:21:44,214 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:21:44,214 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:21:44,216 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:21:44,216 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:21:44,216 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:21:44,217 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:21:44,217 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:21:44,217 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:21:44,217 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-28 13:21:44,217 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:21:44,217 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-28 13:21:44,217 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_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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 -> dd0b9292151174331f3cf63e5ad3d651d29dfbcc [2018-11-28 13:21:44,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:21:44,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:21:44,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:21:44,257 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:21:44,257 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:21:44,258 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-11-28 13:21:44,303 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/data/6d97a3a33/e37c327b822b46a28c2d9bf0c02a8c4c/FLAGcbb40737d [2018-11-28 13:21:44,650 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:21:44,651 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/sv-benchmarks/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-11-28 13:21:44,660 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/data/6d97a3a33/e37c327b822b46a28c2d9bf0c02a8c4c/FLAGcbb40737d [2018-11-28 13:21:44,672 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/bin-2019/uautomizer/data/6d97a3a33/e37c327b822b46a28c2d9bf0c02a8c4c [2018-11-28 13:21:44,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:21:44,675 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 13:21:44,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:21:44,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:21:44,679 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:21:44,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:21:44" (1/1) ... [2018-11-28 13:21:44,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16f0fdcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:44, skipping insertion in model container [2018-11-28 13:21:44,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:21:44" (1/1) ... [2018-11-28 13:21:44,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:21:44,715 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:21:44,938 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:21:44,947 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:21:45,020 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:21:45,054 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:21:45,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:45 WrapperNode [2018-11-28 13:21:45,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:21:45,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:21:45,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:21:45,056 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:21:45,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:45" (1/1) ... [2018-11-28 13:21:45,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:45" (1/1) ... [2018-11-28 13:21:45,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:45" (1/1) ... [2018-11-28 13:21:45,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:45" (1/1) ... [2018-11-28 13:21:45,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:45" (1/1) ... [2018-11-28 13:21:45,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:45" (1/1) ... [2018-11-28 13:21:45,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:45" (1/1) ... [2018-11-28 13:21:45,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:21:45,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:21:45,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:21:45,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:21:45,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:21:45,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:21:45,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:21:45,134 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-28 13:21:45,134 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:21:45,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 13:21:45,134 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 13:21:45,135 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 13:21:45,135 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 13:21:45,135 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 13:21:45,135 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 13:21:45,135 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 13:21:45,135 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 13:21:45,135 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 13:21:45,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 13:21:45,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 13:21:45,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 13:21:45,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 13:21:45,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 13:21:45,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 13:21:45,136 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 13:21:45,136 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 13:21:45,137 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 13:21:45,137 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 13:21:45,137 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 13:21:45,137 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 13:21:45,137 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 13:21:45,137 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 13:21:45,137 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 13:21:45,137 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 13:21:45,138 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 13:21:45,138 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 13:21:45,138 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 13:21:45,138 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 13:21:45,138 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 13:21:45,138 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 13:21:45,138 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 13:21:45,139 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 13:21:45,139 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 13:21:45,139 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 13:21:45,139 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 13:21:45,139 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 13:21:45,139 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 13:21:45,139 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 13:21:45,139 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 13:21:45,140 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 13:21:45,140 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 13:21:45,140 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 13:21:45,140 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 13:21:45,140 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 13:21:45,140 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 13:21:45,140 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 13:21:45,141 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 13:21:45,141 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 13:21:45,141 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 13:21:45,141 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 13:21:45,141 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 13:21:45,141 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 13:21:45,141 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 13:21:45,141 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 13:21:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 13:21:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 13:21:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 13:21:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 13:21:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 13:21:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 13:21:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 13:21:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 13:21:45,143 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 13:21:45,143 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 13:21:45,143 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 13:21:45,143 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 13:21:45,143 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 13:21:45,143 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 13:21:45,143 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 13:21:45,143 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 13:21:45,143 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 13:21:45,143 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 13:21:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 13:21:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 13:21:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 13:21:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 13:21:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 13:21:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 13:21:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 13:21:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 13:21:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 13:21:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 13:21:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 13:21:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 13:21:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 13:21:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 13:21:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 13:21:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 13:21:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 13:21:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 13:21:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 13:21:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 13:21:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 13:21:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 13:21:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 13:21:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 13:21:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 13:21:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 13:21:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 13:21:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 13:21:45,146 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 13:21:45,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 13:21:45,146 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-28 13:21:45,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:21:45,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 13:21:45,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 13:21:45,146 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:21:45,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 13:21:45,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:21:45,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:21:45,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:21:45,578 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:21:45,578 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 13:21:45,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:21:45 BoogieIcfgContainer [2018-11-28 13:21:45,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:21:45,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:21:45,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:21:45,582 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:21:45,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:21:44" (1/3) ... [2018-11-28 13:21:45,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737e7aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:21:45, skipping insertion in model container [2018-11-28 13:21:45,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:21:45" (2/3) ... [2018-11-28 13:21:45,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737e7aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:21:45, skipping insertion in model container [2018-11-28 13:21:45,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:21:45" (3/3) ... [2018-11-28 13:21:45,584 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-11-28 13:21:45,594 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:21:45,600 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-11-28 13:21:45,613 INFO L257 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2018-11-28 13:21:45,628 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:21:45,628 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:21:45,628 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 13:21:45,629 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:21:45,629 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:21:45,629 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:21:45,629 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:21:45,629 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:21:45,629 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:21:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-11-28 13:21:45,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 13:21:45,647 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:45,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:45,649 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-11-28 13:21:45,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:45,653 INFO L82 PathProgramCache]: Analyzing trace with hash 44321787, now seen corresponding path program 1 times [2018-11-28 13:21:45,656 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:21:45,657 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:21:45,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:45,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:45,778 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-11-28 13:21:45,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:45,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:45,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 13:21:45,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:45,803 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:45,804 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-11-28 13:21:45,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:45,818 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-11-28 13:21:45,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-11-28 13:21:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:45,853 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:21:45,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:45,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:21:45,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:21:45,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:21:45,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:21:45,870 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 5 states. [2018-11-28 13:21:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:46,163 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-28 13:21:46,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:21:46,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 13:21:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:46,172 INFO L225 Difference]: With dead ends: 88 [2018-11-28 13:21:46,172 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 13:21:46,173 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-11-28 13:21:46,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 13:21:46,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-28 13:21:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-28 13:21:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-11-28 13:21:46,203 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 9 [2018-11-28 13:21:46,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:46,203 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-11-28 13:21:46,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:21:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-11-28 13:21:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 13:21:46,204 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:46,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:46,204 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-11-28 13:21:46,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:46,205 INFO L82 PathProgramCache]: Analyzing trace with hash 44321788, now seen corresponding path program 1 times [2018-11-28 13:21:46,205 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:21:46,205 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:21:46,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:46,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:46,265 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-11-28 13:21:46,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:46,273 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-11-28 13:21:46,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:46,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:46,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 13:21:46,324 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:46,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:46,326 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-11-28 13:21:46,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:46,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:46,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:46,346 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-11-28 13:21:46,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:46,354 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-11-28 13:21:46,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-11-28 13:21:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:46,369 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:21:46,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:46,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:21:46,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:21:46,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:21:46,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:21:46,372 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 5 states. [2018-11-28 13:21:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:46,759 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-11-28 13:21:46,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:21:46,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 13:21:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:46,761 INFO L225 Difference]: With dead ends: 110 [2018-11-28 13:21:46,761 INFO L226 Difference]: Without dead ends: 110 [2018-11-28 13:21:46,762 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-11-28 13:21:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-28 13:21:46,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2018-11-28 13:21:46,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 13:21:46,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2018-11-28 13:21:46,769 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 9 [2018-11-28 13:21:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:46,769 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2018-11-28 13:21:46,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:21:46,770 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2018-11-28 13:21:46,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 13:21:46,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:46,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:46,771 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-11-28 13:21:46,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:46,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1373975463, now seen corresponding path program 1 times [2018-11-28 13:21:46,771 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:21:46,771 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:21:46,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:46,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:46,849 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-11-28 13:21:46,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:46,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:46,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 13:21:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:46,876 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:21:46,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:46,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:21:46,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:21:46,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:21:46,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:21:46,878 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 3 states. [2018-11-28 13:21:46,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:46,984 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-11-28 13:21:46,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:21:46,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 13:21:46,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:46,985 INFO L225 Difference]: With dead ends: 89 [2018-11-28 13:21:46,985 INFO L226 Difference]: Without dead ends: 89 [2018-11-28 13:21:46,985 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-11-28 13:21:46,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-28 13:21:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-11-28 13:21:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-28 13:21:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-11-28 13:21:46,989 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 10 [2018-11-28 13:21:46,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:46,989 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-11-28 13:21:46,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:21:46,990 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-28 13:21:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 13:21:46,990 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:46,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:46,990 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-11-28 13:21:46,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:46,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1373975464, now seen corresponding path program 1 times [2018-11-28 13:21:46,991 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:21:46,991 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:21:47,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:47,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:47,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:21:47,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:47,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:47,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 13:21:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:47,058 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:21:47,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:47,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:21:47,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:21:47,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:21:47,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:21:47,060 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 3 states. [2018-11-28 13:21:47,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:47,151 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-11-28 13:21:47,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:21:47,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 13:21:47,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:47,152 INFO L225 Difference]: With dead ends: 85 [2018-11-28 13:21:47,153 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 13:21:47,153 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-11-28 13:21:47,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 13:21:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-11-28 13:21:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 13:21:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-11-28 13:21:47,158 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 10 [2018-11-28 13:21:47,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:47,158 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-11-28 13:21:47,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:21:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-11-28 13:21:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 13:21:47,159 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:47,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:47,159 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-11-28 13:21:47,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:47,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1028212614, now seen corresponding path program 1 times [2018-11-28 13:21:47,160 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:21:47,160 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:21:47,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:47,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:47,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 13:21:47,321 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-11-28 13:21:47,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:47,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:47,390 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-11-28 13:21:47,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 13:21:47,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:47,420 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-11-28 13:21:47,420 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:47,431 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:47,440 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-11-28 13:21:47,440 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-11-28 13:21:47,482 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-11-28 13:21:47,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-28 13:21:47,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:47,505 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-11-28 13:21:47,505 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:47,520 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-11-28 13:21:47,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:47,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:47,544 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-11-28 13:21:47,547 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-11-28 13:21:47,547 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:47,562 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-11-28 13:21:47,563 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:47,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 13:21:47,576 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:47,579 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:47,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:47,582 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2018-11-28 13:21:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:47,596 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:21:47,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:47,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:21:47,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:21:47,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:21:47,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=38, Unknown=5, NotChecked=0, Total=56 [2018-11-28 13:21:47,598 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 8 states. [2018-11-28 13:21:48,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:48,101 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-11-28 13:21:48,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 13:21:48,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-28 13:21:48,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:48,102 INFO L225 Difference]: With dead ends: 93 [2018-11-28 13:21:48,102 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 13:21:48,102 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-11-28 13:21:48,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 13:21:48,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-28 13:21:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-28 13:21:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-11-28 13:21:48,107 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 15 [2018-11-28 13:21:48,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:48,107 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-11-28 13:21:48,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:21:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-11-28 13:21:48,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 13:21:48,108 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:48,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:21:48,108 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-11-28 13:21:48,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:48,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1810098092, now seen corresponding path program 1 times [2018-11-28 13:21:48,109 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:21:48,109 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:21:48,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:48,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:48,224 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:48,226 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-11-28 13:21:48,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:48,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:48,244 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:48,246 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-11-28 13:21:48,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:48,266 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-11-28 13:21:48,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-11-28 13:21:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:48,297 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:21:48,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:48,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:21:48,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:21:48,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:21:48,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:21:48,304 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 7 states. [2018-11-28 13:21:48,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:48,621 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-11-28 13:21:48,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:21:48,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-28 13:21:48,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:48,623 INFO L225 Difference]: With dead ends: 93 [2018-11-28 13:21:48,623 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 13:21:48,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:21:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 13:21:48,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-28 13:21:48,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 13:21:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-11-28 13:21:48,629 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 16 [2018-11-28 13:21:48,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:48,629 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-11-28 13:21:48,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:21:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-11-28 13:21:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 13:21:48,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:48,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] [2018-11-28 13:21:48,632 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-11-28 13:21:48,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:48,632 INFO L82 PathProgramCache]: Analyzing trace with hash -659541597, now seen corresponding path program 1 times [2018-11-28 13:21:48,632 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:21:48,632 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:21:48,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:48,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:48,736 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-11-28 13:21:48,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:48,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:48,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-11-28 13:21:48,754 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-11-28 13:21:48,756 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-11-28 13:21:48,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:48,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:48,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:48,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-28 13:21:48,782 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-11-28 13:21:48,783 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-11-28 13:21:48,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:48,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:48,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:48,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-11-28 13:21:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:48,794 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:21:48,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:48,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:21:48,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:21:48,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:21:48,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:21:48,800 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 8 states. [2018-11-28 13:21:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:49,130 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-11-28 13:21:49,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:21:49,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-28 13:21:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:49,131 INFO L225 Difference]: With dead ends: 105 [2018-11-28 13:21:49,131 INFO L226 Difference]: Without dead ends: 105 [2018-11-28 13:21:49,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:21:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-28 13:21:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2018-11-28 13:21:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 13:21:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-11-28 13:21:49,134 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 24 [2018-11-28 13:21:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:49,134 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-11-28 13:21:49,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:21:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-11-28 13:21:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 13:21:49,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:49,135 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-11-28 13:21:49,135 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-11-28 13:21:49,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:49,136 INFO L82 PathProgramCache]: Analyzing trace with hash -659541596, now seen corresponding path program 1 times [2018-11-28 13:21:49,136 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:21:49,136 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:21:49,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:49,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:49,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 13:21:49,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:21:49,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:49,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:49,278 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-11-28 13:21:49,280 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-11-28 13:21:49,280 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:49,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:49,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:49,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-11-28 13:21:49,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 13:21:49,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, 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-11-28 13:21:49,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:49,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:49,334 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-11-28 13:21:49,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 13:21:49,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:49,338 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:49,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:49,342 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-11-28 13:21:49,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:49,358 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:21:49,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:49,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:21:49,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:21:49,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:21:49,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:21:49,360 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 8 states. [2018-11-28 13:21:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:49,711 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-11-28 13:21:49,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:21:49,711 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-28 13:21:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:49,712 INFO L225 Difference]: With dead ends: 102 [2018-11-28 13:21:49,712 INFO L226 Difference]: Without dead ends: 102 [2018-11-28 13:21:49,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 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-11-28 13:21:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-28 13:21:49,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2018-11-28 13:21:49,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-28 13:21:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-11-28 13:21:49,716 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 24 [2018-11-28 13:21:49,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:49,716 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2018-11-28 13:21:49,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:21:49,716 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-11-28 13:21:49,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 13:21:49,717 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:49,717 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-11-28 13:21:49,717 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-11-28 13:21:49,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:49,718 INFO L82 PathProgramCache]: Analyzing trace with hash -659553545, now seen corresponding path program 1 times [2018-11-28 13:21:49,718 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:21:49,718 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:21:49,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:49,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:49,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:49,796 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:21:49,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:49,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:21:49,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:21:49,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:21:49,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:21:49,799 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 4 states. [2018-11-28 13:21:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:49,827 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2018-11-28 13:21:49,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:21:49,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-28 13:21:49,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:49,828 INFO L225 Difference]: With dead ends: 114 [2018-11-28 13:21:49,829 INFO L226 Difference]: Without dead ends: 114 [2018-11-28 13:21:49,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:21:49,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-28 13:21:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2018-11-28 13:21:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-28 13:21:49,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2018-11-28 13:21:49,833 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 24 [2018-11-28 13:21:49,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:49,833 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2018-11-28 13:21:49,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:21:49,833 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2018-11-28 13:21:49,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 13:21:49,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:49,834 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-11-28 13:21:49,834 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-11-28 13:21:49,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:49,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1071674923, now seen corresponding path program 1 times [2018-11-28 13:21:49,835 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:21:49,835 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:21:49,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:49,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:49,932 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-11-28 13:21:49,933 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-11-28 13:21:49,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:49,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:49,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:49,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-28 13:21:49,953 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-11-28 13:21:49,954 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-11-28 13:21:49,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:49,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:49,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:49,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-28 13:21:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:49,964 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:21:49,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:49,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:21:49,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:21:49,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:21:49,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:21:49,967 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 7 states. [2018-11-28 13:21:50,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:50,188 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2018-11-28 13:21:50,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:21:50,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-28 13:21:50,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:50,190 INFO L225 Difference]: With dead ends: 114 [2018-11-28 13:21:50,190 INFO L226 Difference]: Without dead ends: 114 [2018-11-28 13:21:50,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 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-11-28 13:21:50,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-28 13:21:50,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2018-11-28 13:21:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 13:21:50,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-11-28 13:21:50,194 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 27 [2018-11-28 13:21:50,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:50,194 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-11-28 13:21:50,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:21:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-11-28 13:21:50,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 13:21:50,195 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:50,195 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-11-28 13:21:50,196 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-11-28 13:21:50,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:50,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1137815676, now seen corresponding path program 1 times [2018-11-28 13:21:50,196 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:21:50,196 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:21:50,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:50,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:50,305 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-11-28 13:21:50,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:50,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:50,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-11-28 13:21:50,322 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-11-28 13:21:50,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:21:50,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:50,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:50,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:50,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-28 13:21:50,355 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-11-28 13:21:50,356 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-11-28 13:21:50,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:50,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:50,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:50,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-11-28 13:21:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:50,366 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:21:50,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:50,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:21:50,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:21:50,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:21:50,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:21:50,369 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 8 states. [2018-11-28 13:21:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:50,672 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-11-28 13:21:50,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:21:50,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-28 13:21:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:50,673 INFO L225 Difference]: With dead ends: 113 [2018-11-28 13:21:50,673 INFO L226 Difference]: Without dead ends: 113 [2018-11-28 13:21:50,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 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-11-28 13:21:50,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-28 13:21:50,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2018-11-28 13:21:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-28 13:21:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2018-11-28 13:21:50,676 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 28 [2018-11-28 13:21:50,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:50,677 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2018-11-28 13:21:50,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:21:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2018-11-28 13:21:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 13:21:50,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:50,677 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-11-28 13:21:50,678 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-11-28 13:21:50,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:50,678 INFO L82 PathProgramCache]: Analyzing trace with hash 923379735, now seen corresponding path program 1 times [2018-11-28 13:21:50,678 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:21:50,678 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:21:50,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:50,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:50,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:21:50,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:50,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:50,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-11-28 13:21:50,819 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-11-28 13:21:50,821 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-11-28 13:21:50,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:50,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:50,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:50,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-28 13:21:50,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 13:21:50,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:50,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:50,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2018-11-28 13:21:50,926 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-11-28 13:21:50,929 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-11-28 13:21:50,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:50,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:50,964 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-11-28 13:21:50,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2018-11-28 13:21:51,004 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-11-28 13:21:51,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 13:21:51,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:51,030 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-11-28 13:21:51,030 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:51,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:51,038 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-11-28 13:21:51,038 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2018-11-28 13:21:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:51,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:21:51,239 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-11-28 13:21:51,241 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-11-28 13:21:51,241 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:21:51,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:21:51,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-28 13:21:51,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:50 [2018-11-28 13:21:51,329 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 15 treesize of output 10 [2018-11-28 13:21:51,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:51,342 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 15 treesize of output 10 [2018-11-28 13:21:51,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:51,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:21:51,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2018-11-28 13:21:51,356 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-11-28 13:21:51,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:51,359 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-11-28 13:21:51,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:51,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:21:51,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2018-11-28 13:21:51,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:51,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:21:51,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-11-28 13:21:51,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 13:21:51,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 13:21:51,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:21:51,372 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 17 states. [2018-11-28 13:21:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:52,503 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-11-28 13:21:52,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:21:52,504 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-11-28 13:21:52,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:52,505 INFO L225 Difference]: With dead ends: 117 [2018-11-28 13:21:52,505 INFO L226 Difference]: Without dead ends: 117 [2018-11-28 13:21:52,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 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-11-28 13:21:52,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-28 13:21:52,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2018-11-28 13:21:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-28 13:21:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-11-28 13:21:52,508 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 29 [2018-11-28 13:21:52,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:52,508 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-11-28 13:21:52,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 13:21:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-11-28 13:21:52,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 13:21:52,509 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:52,509 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-11-28 13:21:52,509 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-11-28 13:21:52,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:52,510 INFO L82 PathProgramCache]: Analyzing trace with hash 923379736, now seen corresponding path program 1 times [2018-11-28 13:21:52,510 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:21:52,510 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:21:52,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:52,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:21:52,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-11-28 13:21:52,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:52,714 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-11-28 13:21:52,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:52,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:52,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-11-28 13:21:52,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:52,743 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-11-28 13:21:52,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:52,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:52,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:52,763 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-11-28 13:21:52,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:52,777 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-11-28 13:21:52,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-11-28 13:21:52,832 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-11-28 13:21:52,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:21:52,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:52,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:52,874 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-11-28 13:21:52,878 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-11-28 13:21:52,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:52,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:52,907 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-11-28 13:21:52,908 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:41 [2018-11-28 13:21:53,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:53,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 36 [2018-11-28 13:21:53,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:53,053 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:53,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:21:53,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 13:21:53,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:53,069 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-11-28 13:21:53,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:46 [2018-11-28 13:21:53,182 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-11-28 13:21:53,190 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-11-28 13:21:53,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:53,258 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-11-28 13:21:53,258 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:53,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:53,351 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 33 treesize of output 41 [2018-11-28 13:21:53,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-28 13:21:53,357 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:53,413 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:53,425 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-11-28 13:21:53,425 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2018-11-28 13:21:53,473 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-11-28 13:21:53,476 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-11-28 13:21:53,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:53,498 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-11-28 13:21:53,498 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:53,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:53,535 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 36 treesize of output 34 [2018-11-28 13:21:53,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-28 13:21:53,538 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:53,560 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-11-28 13:21:53,561 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:53,581 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-11-28 13:21:53,581 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:53,589 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:53,595 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-11-28 13:21:53,595 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:68, output treesize:20 [2018-11-28 13:21:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:53,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:21:54,846 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-11-28 13:21:54,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-28 13:21:54,853 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-11-28 13:21:54,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:54,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:54,861 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-11-28 13:21:54,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 13:21:54,867 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:54,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:54,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 13:21:54,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 13:21:54,880 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:54,888 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:55,034 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-11-28 13:21:55,037 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-11-28 13:21:55,038 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:55,041 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:55,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-11-28 13:21:55,045 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-11-28 13:21:55,047 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:55,050 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:21:55,160 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-11-28 13:21:55,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, 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-11-28 13:21:55,163 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:21:55,175 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:21:55,178 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-11-28 13:21:55,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-28 13:21:55,181 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:21:55,194 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:21:55,315 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-11-28 13:21:55,318 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-11-28 13:21:55,319 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:21:55,330 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:21:55,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 13:21:55,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-28 13:21:55,337 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:21:55,354 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:21:55,509 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-11-28 13:21:55,509 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2018-11-28 13:21:55,898 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2018-11-28 13:21:55,907 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:21:55,910 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:21:55,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-11-28 13:21:55,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:55,993 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:21:55,993 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:21:55,994 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-11-28 13:21:55,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:56,077 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:21:56,078 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:21:56,078 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-11-28 13:21:56,079 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:56,149 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:21:56,150 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:21:56,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-28 13:21:56,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:56,219 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:21:56,219 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:21:56,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-28 13:21:56,220 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:21:56,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 5 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-28 13:21:56,283 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 12 variables, input treesize:104, output treesize:47 [2018-11-28 13:21:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:56,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:21:56,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-11-28 13:21:56,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 13:21:56,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 13:21:56,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-11-28 13:21:56,751 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 21 states. [2018-11-28 13:21:57,788 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2018-11-28 13:21:58,437 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 50 [2018-11-28 13:22:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:03,993 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-11-28 13:22:03,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:22:03,994 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2018-11-28 13:22:03,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:03,995 INFO L225 Difference]: With dead ends: 119 [2018-11-28 13:22:03,995 INFO L226 Difference]: Without dead ends: 119 [2018-11-28 13:22:03,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2018-11-28 13:22:03,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-28 13:22:03,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 104. [2018-11-28 13:22:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 13:22:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-11-28 13:22:03,998 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 29 [2018-11-28 13:22:03,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:03,998 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-11-28 13:22:03,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 13:22:03,998 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-11-28 13:22:03,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 13:22:03,998 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:03,998 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-11-28 13:22:03,999 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-11-28 13:22:03,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:03,999 INFO L82 PathProgramCache]: Analyzing trace with hash -912547506, now seen corresponding path program 1 times [2018-11-28 13:22:03,999 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:22:03,999 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:22:04,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:04,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:22:04,105 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-11-28 13:22:04,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:04,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:22:04,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 13:22:04,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:22:04,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:04,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:22:04,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2018-11-28 13:22:04,140 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-11-28 13:22:04,142 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-11-28 13:22:04,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:04,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:22:04,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:22:04,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-28 13:22:04,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:22:04,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:22:04,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-28 13:22:04,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:04,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:22:04,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2018-11-28 13:22:04,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-28 13:22:04,183 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-11-28 13:22:04,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:04,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:22:04,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:22:04,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-11-28 13:22:04,201 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:22:04,202 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-11-28 13:22:04,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:04,207 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-11-28 13:22:04,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-11-28 13:22:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:22:04,221 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:22:04,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:04,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:22:04,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:22:04,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:22:04,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:22:04,225 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 9 states. [2018-11-28 13:22:08,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:08,725 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-11-28 13:22:08,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:22:08,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-28 13:22:08,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:08,725 INFO L225 Difference]: With dead ends: 128 [2018-11-28 13:22:08,725 INFO L226 Difference]: Without dead ends: 128 [2018-11-28 13:22:08,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 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-11-28 13:22:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-28 13:22:08,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 105. [2018-11-28 13:22:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-28 13:22:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-11-28 13:22:08,728 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 29 [2018-11-28 13:22:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:08,729 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-11-28 13:22:08,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:22:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-11-28 13:22:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 13:22:08,729 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:08,729 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-11-28 13:22:08,729 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-11-28 13:22:08,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:08,730 INFO L82 PathProgramCache]: Analyzing trace with hash -912547505, now seen corresponding path program 1 times [2018-11-28 13:22:08,730 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:22:08,730 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:22:08,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:08,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:22:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:22:08,785 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:22:08,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:08,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:22:08,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:22:08,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:22:08,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:22:08,787 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 3 states. [2018-11-28 13:22:08,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:08,899 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2018-11-28 13:22:08,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:22:08,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 13:22:08,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:08,900 INFO L225 Difference]: With dead ends: 100 [2018-11-28 13:22:08,900 INFO L226 Difference]: Without dead ends: 100 [2018-11-28 13:22:08,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:22:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-28 13:22:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2018-11-28 13:22:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-28 13:22:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-11-28 13:22:08,903 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 29 [2018-11-28 13:22:08,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:08,903 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-11-28 13:22:08,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:22:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-11-28 13:22:08,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 13:22:08,904 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:08,904 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-11-28 13:22:08,904 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2018-11-28 13:22:08,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:08,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1698250232, now seen corresponding path program 1 times [2018-11-28 13:22:08,905 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:22:08,905 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4b868003-7fa0-45e7-8de3-c3680abbcc0a/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-11-28 13:22:08,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:22:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:22:09,234 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:22:09,247 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-11-28 13:22:09,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:22:09 BoogieIcfgContainer [2018-11-28 13:22:09,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:22:09,263 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:22:09,263 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:22:09,263 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:22:09,264 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:21:45" (3/4) ... [2018-11-28 13:22:09,269 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:22:09,269 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:22:09,270 INFO L168 Benchmark]: Toolchain (without parser) took 24595.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.9 MB). Free memory was 943.4 MB in the beginning and 1.0 GB in the end (delta: -100.3 MB). Peak memory consumption was 210.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:22:09,270 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:22:09,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -173.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:22:09,271 INFO L168 Benchmark]: Boogie Preprocessor took 38.38 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-11-28 13:22:09,271 INFO L168 Benchmark]: RCFGBuilder took 484.28 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: 65.8 MB). Peak memory consumption was 65.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:22:09,271 INFO L168 Benchmark]: TraceAbstraction took 23683.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.5 MB). Peak memory consumption was 182.1 MB. Max. memory is 11.5 GB. [2018-11-28 13:22:09,271 INFO L168 Benchmark]: Witness Printer took 6.46 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:22:09,272 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -173.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 484.28 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: 65.8 MB). Peak memory consumption was 65.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23683.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.5 MB). Peak memory consumption was 182.1 MB. Max. memory is 11.5 GB. * Witness Printer took 6.46 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 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: 635]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 635. Possible FailurePath: [L620] int c = 0; VAL [\old(c)=0, c=0] [L637] struct item *list = ((void *)0); [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={-2139090935:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={-2139090935:0}] [L627] c++ [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={-2139090936:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L629] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-2139090936:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L629] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-2139090936:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L630] EXPR item->next VAL [\old(c)=0, c=1, item={-2139090936:0}, item->next={0:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2147479544:0}, \old(c)=0, c=1, item={-2139090936:0}, item->next={0:0}, malloc(sizeof *item)={-2139090936:0}, malloc(sizeof *item)={-2147479544:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L630-L632] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2147479544:0}, \old(c)=0, c=1, item={-2139090936:0}, item->next={0:0}, malloc(sizeof *item)={-2139090936:0}, malloc(sizeof *item)={-2147479544:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L633] *plist = item VAL [\old(c)=0, c=1, item={-2139090936:0}, malloc(sizeof *item)={-2139090936:0}, malloc(sizeof *item)={-2147479544:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L640] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={-2139090935:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={-2139090935:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={-2139090935:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={-2139090935:0}] [L647] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-2139090936:0}, c=1, length=1, list={-2139090935:0}] [L647] EXPR list->next VAL [\old(c)=0, \read(*list)={-2139090936:0}, c=1, length=1, list={-2139090935:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-2139090936:0}, c=1, length=1, list={-2139090935:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={-2139090936:0}, c=1, length=1, list={-2139090935:0}, next={0:0}] [L648] free(list) [L649] list = next VAL [\old(c)=0, c=1, length=1, list={-2139090935:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={-2139090935:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={-2139090935:0}, next={0:0}] [L658] return 0; [L637] struct item *list = ((void *)0); [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 41 error locations. UNSAFE Result, 23.6s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 15.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 790 SDtfs, 1101 SDslu, 2333 SDs, 0 SdLazy, 2878 SolverSat, 148 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 265 SyntacticMatches, 4 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=11, 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, 15 MinimizatonAttempts, 123 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 353 ConstructedInterpolants, 46 QuantifiedInterpolants, 110905 SizeOfPredicates, 119 NumberOfNonLiveVariables, 1581 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 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...