./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 08:23:06,352 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:23:06,353 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:23:06,359 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:23:06,359 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:23:06,360 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:23:06,360 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:23:06,361 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:23:06,362 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:23:06,362 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:23:06,363 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:23:06,363 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:23:06,363 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:23:06,364 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:23:06,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:23:06,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:23:06,365 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:23:06,366 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:23:06,367 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:23:06,368 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:23:06,368 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:23:06,369 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:23:06,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:23:06,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:23:06,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:23:06,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:23:06,371 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:23:06,372 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:23:06,372 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:23:06,373 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:23:06,373 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:23:06,373 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:23:06,373 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:23:06,373 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:23:06,374 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:23:06,374 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:23:06,374 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 08:23:06,381 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:23:06,381 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:23:06,382 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 08:23:06,382 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 08:23:06,382 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 08:23:06,383 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 08:23:06,383 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 08:23:06,383 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:23:06,383 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 08:23:06,383 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 08:23:06,383 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 08:23:06,383 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 08:23:06,383 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:23:06,384 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 08:23:06,384 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 08:23:06,384 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 08:23:06,384 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 08:23:06,384 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 08:23:06,384 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 08:23:06,384 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:23:06,384 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 08:23:06,385 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 08:23:06,385 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 08:23:06,385 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:23:06,385 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:23:06,385 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 08:23:06,385 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 08:23:06,385 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 08:23:06,385 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_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 [2018-12-02 08:23:06,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:23:06,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:23:06,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:23:06,417 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:23:06,417 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:23:06,418 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-12-02 08:23:06,452 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/data/15d593502/e73f00f56ce846b09416799aa396edb8/FLAGd2934ed04 [2018-12-02 08:23:06,900 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:23:06,901 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-12-02 08:23:06,906 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/data/15d593502/e73f00f56ce846b09416799aa396edb8/FLAGd2934ed04 [2018-12-02 08:23:06,914 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/data/15d593502/e73f00f56ce846b09416799aa396edb8 [2018-12-02 08:23:06,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:23:06,917 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 08:23:06,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:23:06,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:23:06,919 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:23:06,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:23:06" (1/1) ... [2018-12-02 08:23:06,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115e7fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:06, skipping insertion in model container [2018-12-02 08:23:06,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:23:06" (1/1) ... [2018-12-02 08:23:06,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:23:06,943 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:23:07,083 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:23:07,088 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:23:07,150 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:23:07,169 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:23:07,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:07 WrapperNode [2018-12-02 08:23:07,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:23:07,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:23:07,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:23:07,171 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:23:07,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:07" (1/1) ... [2018-12-02 08:23:07,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:07" (1/1) ... [2018-12-02 08:23:07,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:07" (1/1) ... [2018-12-02 08:23:07,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:07" (1/1) ... [2018-12-02 08:23:07,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:07" (1/1) ... [2018-12-02 08:23:07,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:07" (1/1) ... [2018-12-02 08:23:07,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:07" (1/1) ... [2018-12-02 08:23:07,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:23:07,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:23:07,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:23:07,200 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:23:07,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:23:07,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 08:23:07,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:23:07,232 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-02 08:23:07,232 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 08:23:07,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-02 08:23:07,232 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 08:23:07,232 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 08:23:07,232 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 08:23:07,232 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 08:23:07,232 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 08:23:07,232 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 08:23:07,232 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 08:23:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 08:23:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 08:23:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 08:23:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 08:23:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 08:23:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 08:23:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 08:23:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 08:23:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 08:23:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 08:23:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 08:23:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 08:23:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 08:23:07,233 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 08:23:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 08:23:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 08:23:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 08:23:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 08:23:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 08:23:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 08:23:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 08:23:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 08:23:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 08:23:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 08:23:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 08:23:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 08:23:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 08:23:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 08:23:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 08:23:07,234 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 08:23:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 08:23:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 08:23:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 08:23:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 08:23:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 08:23:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 08:23:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 08:23:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 08:23:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 08:23:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 08:23:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 08:23:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 08:23:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 08:23:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 08:23:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 08:23:07,235 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 08:23:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 08:23:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 08:23:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 08:23:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 08:23:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 08:23:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 08:23:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 08:23:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 08:23:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 08:23:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 08:23:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 08:23:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-02 08:23:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 08:23:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 08:23:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 08:23:07,236 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 08:23:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 08:23:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 08:23:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 08:23:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 08:23:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 08:23:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 08:23:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 08:23:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 08:23:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 08:23:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 08:23:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 08:23:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 08:23:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 08:23:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 08:23:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 08:23:07,237 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 08:23:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 08:23:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 08:23:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 08:23:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 08:23:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 08:23:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 08:23:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 08:23:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 08:23:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 08:23:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 08:23:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 08:23:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 08:23:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 08:23:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 08:23:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 08:23:07,238 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 08:23:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-02 08:23:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-02 08:23:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 08:23:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 08:23:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 08:23:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 08:23:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 08:23:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 08:23:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 08:23:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:23:07,500 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:23:07,500 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 08:23:07,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:23:07 BoogieIcfgContainer [2018-12-02 08:23:07,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:23:07,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 08:23:07,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 08:23:07,503 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 08:23:07,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:23:06" (1/3) ... [2018-12-02 08:23:07,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7421a12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:23:07, skipping insertion in model container [2018-12-02 08:23:07,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:07" (2/3) ... [2018-12-02 08:23:07,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7421a12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:23:07, skipping insertion in model container [2018-12-02 08:23:07,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:23:07" (3/3) ... [2018-12-02 08:23:07,505 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-12-02 08:23:07,511 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 08:23:07,518 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-12-02 08:23:07,528 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-12-02 08:23:07,544 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 08:23:07,545 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 08:23:07,545 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 08:23:07,545 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 08:23:07,545 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 08:23:07,545 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 08:23:07,545 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 08:23:07,545 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 08:23:07,546 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 08:23:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-12-02 08:23:07,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-02 08:23:07,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:07,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:07,566 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr14REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 08:23:07,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:07,570 INFO L82 PathProgramCache]: Analyzing trace with hash -557279662, now seen corresponding path program 1 times [2018-12-02 08:23:07,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:23:07,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:23:07,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:07,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:07,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:07,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:07,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 08:23:07,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 08:23:07,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 08:23:07,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 08:23:07,659 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2018-12-02 08:23:07,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:07,671 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-12-02 08:23:07,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 08:23:07,672 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-12-02 08:23:07,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:07,678 INFO L225 Difference]: With dead ends: 85 [2018-12-02 08:23:07,678 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 08:23:07,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 08:23:07,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 08:23:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-02 08:23:07,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 08:23:07,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-12-02 08:23:07,704 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 8 [2018-12-02 08:23:07,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:07,704 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-12-02 08:23:07,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 08:23:07,704 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-12-02 08:23:07,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 08:23:07,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:07,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:07,705 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr14REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 08:23:07,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:07,705 INFO L82 PathProgramCache]: Analyzing trace with hash -95705117, now seen corresponding path program 1 times [2018-12-02 08:23:07,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:23:07,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:23:07,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:07,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:07,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:07,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:07,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:23:07,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:23:07,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:23:07,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:23:07,773 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 5 states. [2018-12-02 08:23:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:07,881 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-12-02 08:23:07,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:23:07,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 08:23:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:07,882 INFO L225 Difference]: With dead ends: 74 [2018-12-02 08:23:07,882 INFO L226 Difference]: Without dead ends: 74 [2018-12-02 08:23:07,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:23:07,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-02 08:23:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-02 08:23:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-02 08:23:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-12-02 08:23:07,887 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 9 [2018-12-02 08:23:07,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:07,887 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-12-02 08:23:07,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:23:07,887 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-12-02 08:23:07,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 08:23:07,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:07,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:07,888 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr14REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 08:23:07,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:07,888 INFO L82 PathProgramCache]: Analyzing trace with hash -95705116, now seen corresponding path program 1 times [2018-12-02 08:23:07,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:23:07,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:23:07,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:07,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:07,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:07,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:07,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:23:07,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:23:07,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:23:07,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:23:07,939 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-12-02 08:23:08,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:08,067 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-12-02 08:23:08,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:23:08,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 08:23:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:08,069 INFO L225 Difference]: With dead ends: 90 [2018-12-02 08:23:08,070 INFO L226 Difference]: Without dead ends: 90 [2018-12-02 08:23:08,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:23:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-02 08:23:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2018-12-02 08:23:08,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-02 08:23:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-12-02 08:23:08,074 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 9 [2018-12-02 08:23:08,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:08,074 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-12-02 08:23:08,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:23:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-12-02 08:23:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 08:23:08,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:08,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:08,075 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr14REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 08:23:08,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:08,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1328108723, now seen corresponding path program 1 times [2018-12-02 08:23:08,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:23:08,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:23:08,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:08,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:08,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:08,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:08,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 08:23:08,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:23:08,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:23:08,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:23:08,091 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 3 states. [2018-12-02 08:23:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:08,125 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-12-02 08:23:08,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:23:08,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 08:23:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:08,126 INFO L225 Difference]: With dead ends: 75 [2018-12-02 08:23:08,126 INFO L226 Difference]: Without dead ends: 75 [2018-12-02 08:23:08,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:23:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-02 08:23:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-02 08:23:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 08:23:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-12-02 08:23:08,131 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 10 [2018-12-02 08:23:08,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:08,131 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-12-02 08:23:08,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:23:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-12-02 08:23:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 08:23:08,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:08,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:08,132 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr14REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 08:23:08,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:08,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1328108724, now seen corresponding path program 1 times [2018-12-02 08:23:08,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:23:08,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:23:08,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:08,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:08,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:08,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:08,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:08,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 08:23:08,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:23:08,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:23:08,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:23:08,157 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 3 states. [2018-12-02 08:23:08,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:08,187 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-12-02 08:23:08,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:23:08,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 08:23:08,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:08,188 INFO L225 Difference]: With dead ends: 71 [2018-12-02 08:23:08,188 INFO L226 Difference]: Without dead ends: 71 [2018-12-02 08:23:08,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:23:08,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-02 08:23:08,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-02 08:23:08,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-02 08:23:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-12-02 08:23:08,191 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 10 [2018-12-02 08:23:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:08,191 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-12-02 08:23:08,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:23:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-12-02 08:23:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 08:23:08,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:08,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:08,192 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr14REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 08:23:08,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:08,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1312633070, now seen corresponding path program 1 times [2018-12-02 08:23:08,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:23:08,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:23:08,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:08,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:08,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:08,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:08,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:08,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 08:23:08,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 08:23:08,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 08:23:08,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:23:08,277 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 8 states. [2018-12-02 08:23:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:08,426 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-12-02 08:23:08,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 08:23:08,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-02 08:23:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:08,427 INFO L225 Difference]: With dead ends: 82 [2018-12-02 08:23:08,427 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 08:23:08,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-12-02 08:23:08,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 08:23:08,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-12-02 08:23:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-02 08:23:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-12-02 08:23:08,435 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 15 [2018-12-02 08:23:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:08,435 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-12-02 08:23:08,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 08:23:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-12-02 08:23:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 08:23:08,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:08,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:08,436 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr14REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 08:23:08,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:08,436 INFO L82 PathProgramCache]: Analyzing trace with hash 2037197624, now seen corresponding path program 1 times [2018-12-02 08:23:08,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:23:08,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:23:08,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:08,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:08,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:08,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:08,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:23:08,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:23:08,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:23:08,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:23:08,494 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 7 states. [2018-12-02 08:23:08,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:08,556 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-12-02 08:23:08,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 08:23:08,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-02 08:23:08,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:08,557 INFO L225 Difference]: With dead ends: 77 [2018-12-02 08:23:08,557 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 08:23:08,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:23:08,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 08:23:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2018-12-02 08:23:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-02 08:23:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-12-02 08:23:08,562 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 16 [2018-12-02 08:23:08,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:08,562 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-12-02 08:23:08,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:23:08,563 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-12-02 08:23:08,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 08:23:08,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:08,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:08,564 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr14REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 08:23:08,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:08,564 INFO L82 PathProgramCache]: Analyzing trace with hash -200406812, now seen corresponding path program 1 times [2018-12-02 08:23:08,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:23:08,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:23:08,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:08,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:08,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:08,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:08,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:23:08,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:23:08,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:23:08,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:23:08,622 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 7 states. [2018-12-02 08:23:08,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:08,714 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-12-02 08:23:08,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:23:08,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-02 08:23:08,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:08,715 INFO L225 Difference]: With dead ends: 80 [2018-12-02 08:23:08,715 INFO L226 Difference]: Without dead ends: 80 [2018-12-02 08:23:08,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:23:08,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-02 08:23:08,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2018-12-02 08:23:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 08:23:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-12-02 08:23:08,718 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 24 [2018-12-02 08:23:08,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:08,719 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-12-02 08:23:08,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:23:08,719 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-12-02 08:23:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 08:23:08,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:08,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:08,720 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr14REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 08:23:08,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash -200406811, now seen corresponding path program 1 times [2018-12-02 08:23:08,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:23:08,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:23:08,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:08,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:08,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:08,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:08,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:23:08,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:23:08,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:23:08,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:23:08,796 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 7 states. [2018-12-02 08:23:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:08,904 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-12-02 08:23:08,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:23:08,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-02 08:23:08,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:08,904 INFO L225 Difference]: With dead ends: 82 [2018-12-02 08:23:08,905 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 08:23:08,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:23:08,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 08:23:08,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-12-02 08:23:08,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 08:23:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-12-02 08:23:08,908 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 24 [2018-12-02 08:23:08,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:08,908 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-12-02 08:23:08,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:23:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-12-02 08:23:08,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 08:23:08,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:08,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:08,909 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr14REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 08:23:08,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:08,910 INFO L82 PathProgramCache]: Analyzing trace with hash 700839514, now seen corresponding path program 1 times [2018-12-02 08:23:08,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:23:08,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:23:08,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:08,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:08,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:08,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:08,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:23:08,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:23:08,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:23:08,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:23:08,951 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-12-02 08:23:09,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:09,011 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-12-02 08:23:09,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:23:09,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-02 08:23:09,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:09,012 INFO L225 Difference]: With dead ends: 66 [2018-12-02 08:23:09,012 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 08:23:09,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:23:09,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 08:23:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-02 08:23:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 08:23:09,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-12-02 08:23:09,014 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2018-12-02 08:23:09,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:09,014 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-12-02 08:23:09,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:23:09,014 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-12-02 08:23:09,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 08:23:09,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:09,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:09,015 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr14REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 08:23:09,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:09,015 INFO L82 PathProgramCache]: Analyzing trace with hash -314795811, now seen corresponding path program 1 times [2018-12-02 08:23:09,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:23:09,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:23:09,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:09,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:09,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:09,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:09,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:23:09,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:23:09,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:23:09,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:23:09,050 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 6 states. [2018-12-02 08:23:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:09,101 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-12-02 08:23:09,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:23:09,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-02 08:23:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:09,102 INFO L225 Difference]: With dead ends: 65 [2018-12-02 08:23:09,102 INFO L226 Difference]: Without dead ends: 65 [2018-12-02 08:23:09,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:23:09,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-02 08:23:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-02 08:23:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 08:23:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-12-02 08:23:09,104 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 27 [2018-12-02 08:23:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:09,104 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-12-02 08:23:09,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:23:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-12-02 08:23:09,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 08:23:09,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:09,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:09,105 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr14REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 08:23:09,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:09,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1168735483, now seen corresponding path program 1 times [2018-12-02 08:23:09,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:23:09,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:23:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:09,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:09,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:09,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:23:09,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:23:09,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:23:09,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:23:09,153 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 7 states. [2018-12-02 08:23:09,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:09,230 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-12-02 08:23:09,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:23:09,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-02 08:23:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:09,231 INFO L225 Difference]: With dead ends: 64 [2018-12-02 08:23:09,231 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 08:23:09,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:23:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 08:23:09,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-02 08:23:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-02 08:23:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-12-02 08:23:09,233 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 28 [2018-12-02 08:23:09,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:09,233 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-12-02 08:23:09,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:23:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-12-02 08:23:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 08:23:09,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:09,234 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:09,234 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr14REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 08:23:09,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:09,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1776628288, now seen corresponding path program 1 times [2018-12-02 08:23:09,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:23:09,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:23:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:09,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:09,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:23:09,303 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:23:09,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:09,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:09,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:23:09,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 08:23:09,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:09,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:09,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:09,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-02 08:23:09,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-02 08:23:09,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:09,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:09,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-12-02 08:23:09,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 08:23:09,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-02 08:23:09,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:09,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:09,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:09,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-02 08:23:09,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-12-02 08:23:09,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-12-02 08:23:09,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:09,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-12-02 08:23:09,549 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:09,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-02 08:23:09,558 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:09,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:09,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:09,563 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-12-02 08:23:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:09,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 08:23:09,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 15 [2018-12-02 08:23:09,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 08:23:09,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 08:23:09,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-12-02 08:23:09,594 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 16 states. [2018-12-02 08:23:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:09,902 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-12-02 08:23:09,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 08:23:09,902 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-12-02 08:23:09,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:09,903 INFO L225 Difference]: With dead ends: 70 [2018-12-02 08:23:09,903 INFO L226 Difference]: Without dead ends: 70 [2018-12-02 08:23:09,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-12-02 08:23:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-02 08:23:09,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-12-02 08:23:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 08:23:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-12-02 08:23:09,906 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 29 [2018-12-02 08:23:09,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:09,906 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-12-02 08:23:09,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 08:23:09,907 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-12-02 08:23:09,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 08:23:09,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:09,907 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:09,908 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr14REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 08:23:09,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:09,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1776628289, now seen corresponding path program 1 times [2018-12-02 08:23:09,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:23:09,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:23:09,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:09,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:09,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:10,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:23:10,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:23:10,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:10,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:10,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:23:10,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 08:23:10,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:23:10,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 08:23:10,081 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,092 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-12-02 08:23:10,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:10,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:10,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 08:23:10,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 08:23:10,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-12-02 08:23:10,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 08:23:10,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-12-02 08:23:10,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-12-02 08:23:10,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2018-12-02 08:23:10,227 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-12-02 08:23:10,241 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,247 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:10,253 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-12-02 08:23:10,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-12-02 08:23:10,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-12-02 08:23:10,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-12-02 08:23:10,296 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-12-02 08:23:10,306 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-12-02 08:23:10,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-02 08:23:10,323 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,332 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:10,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:10,336 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-12-02 08:23:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:10,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 08:23:10,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2018-12-02 08:23:10,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 08:23:10,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 08:23:10,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-02 08:23:10,367 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 17 states. [2018-12-02 08:23:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:10,829 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-12-02 08:23:10,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 08:23:10,830 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-12-02 08:23:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:10,831 INFO L225 Difference]: With dead ends: 69 [2018-12-02 08:23:10,831 INFO L226 Difference]: Without dead ends: 69 [2018-12-02 08:23:10,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-12-02 08:23:10,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-02 08:23:10,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-02 08:23:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 08:23:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-12-02 08:23:10,833 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 29 [2018-12-02 08:23:10,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:10,833 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-12-02 08:23:10,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 08:23:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-12-02 08:23:10,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 08:23:10,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:10,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, 1, 1] [2018-12-02 08:23:10,834 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr14REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 08:23:10,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:10,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1871061536, now seen corresponding path program 1 times [2018-12-02 08:23:10,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:23:10,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:23:10,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:10,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:10,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:10,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:10,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:23:10,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 08:23:10,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 08:23:10,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:23:10,900 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 8 states. [2018-12-02 08:23:10,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:10,999 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-12-02 08:23:10,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:23:10,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-12-02 08:23:10,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:11,000 INFO L225 Difference]: With dead ends: 66 [2018-12-02 08:23:11,000 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 08:23:11,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-02 08:23:11,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 08:23:11,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-02 08:23:11,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 08:23:11,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-02 08:23:11,002 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 29 [2018-12-02 08:23:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:11,002 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-02 08:23:11,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 08:23:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-02 08:23:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 08:23:11,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:11,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:11,003 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr14REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 08:23:11,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:11,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1871061535, now seen corresponding path program 1 times [2018-12-02 08:23:11,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:23:11,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:23:11,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:11,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:11,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:11,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:11,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:11,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 08:23:11,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:23:11,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:23:11,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:23:11,020 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 3 states. [2018-12-02 08:23:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:11,043 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-12-02 08:23:11,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:23:11,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 08:23:11,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:11,044 INFO L225 Difference]: With dead ends: 61 [2018-12-02 08:23:11,044 INFO L226 Difference]: Without dead ends: 61 [2018-12-02 08:23:11,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:23:11,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-02 08:23:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-02 08:23:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-02 08:23:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-12-02 08:23:11,046 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 29 [2018-12-02 08:23:11,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:11,046 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-12-02 08:23:11,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:23:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-12-02 08:23:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 08:23:11,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:11,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:11,047 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr14REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-12-02 08:23:11,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:11,047 INFO L82 PathProgramCache]: Analyzing trace with hash -492861402, now seen corresponding path program 1 times [2018-12-02 08:23:11,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:23:11,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:23:11,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:11,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:11,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:23:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:23:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:23:11,073 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 08:23:11,083 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 08:23:11,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:23:11 BoogieIcfgContainer [2018-12-02 08:23:11,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 08:23:11,094 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 08:23:11,094 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 08:23:11,094 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 08:23:11,094 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:23:07" (3/4) ... [2018-12-02 08:23:11,097 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 08:23:11,097 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 08:23:11,098 INFO L168 Benchmark]: Toolchain (without parser) took 4181.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:23:11,099 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:23:11,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -143.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-12-02 08:23:11,099 INFO L168 Benchmark]: Boogie Preprocessor took 29.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:23:11,100 INFO L168 Benchmark]: RCFGBuilder took 300.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2018-12-02 08:23:11,100 INFO L168 Benchmark]: TraceAbstraction took 3592.64 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -80.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:23:11,100 INFO L168 Benchmark]: Witness Printer took 3.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:23:11,102 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 253.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -143.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 300.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3592.64 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 49.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -80.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 633]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 633. Possible FailurePath: [L635] struct item *list = ((void *)0); VAL [list={10:0}] [L637] CALL append(&list) VAL [plist={10:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L627] item->next = *plist VAL [\read(**plist)={0:0}, item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L628] EXPR item->next VAL [item={13:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, item={13:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, item={13:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L631] *plist = item VAL [item={13:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L637] RET append(&list) VAL [list={10:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] \read(*list) VAL [\read(*list)={13:0}, list={10:0}] [L639] COND TRUE \read(*list) [L640] EXPR \read(*list) VAL [\read(*list)={13:0}, list={10:0}] [L640] EXPR list->next VAL [\read(*list)={13:0}, list={10:0}, list->next={0:0}] [L640] struct item *next = list->next; [L641] EXPR \read(*list) VAL [\read(*list)={13:0}, list={10:0}, next={0:0}] [L641] free(list) VAL [\read(*list)={13:0}, list={10:0}, next={0:0}] [L641] free(list) [L642] list = next VAL [list={10:0}, next={0:0}] [L644] \read(*list) VAL [\read(*list)={0:0}, list={10:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) [L649] return 0; [L635] struct item *list = ((void *)0); [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 85 locations, 39 error locations. UNSAFE Result, 3.5s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 729 SDtfs, 693 SDslu, 1688 SDs, 0 SdLazy, 2061 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 39 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 362 ConstructedInterpolants, 11 QuantifiedInterpolants, 77138 SizeOfPredicates, 35 NumberOfNonLiveVariables, 366 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 08:23:12,361 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:23:12,362 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:23:12,369 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:23:12,369 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:23:12,369 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:23:12,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:23:12,371 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:23:12,372 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:23:12,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:23:12,372 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:23:12,373 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:23:12,373 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:23:12,374 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:23:12,374 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:23:12,375 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:23:12,375 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:23:12,376 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:23:12,377 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:23:12,378 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:23:12,378 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:23:12,379 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:23:12,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:23:12,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:23:12,380 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:23:12,381 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:23:12,381 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:23:12,382 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:23:12,382 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:23:12,383 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:23:12,383 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:23:12,383 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:23:12,383 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:23:12,384 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:23:12,384 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:23:12,384 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:23:12,385 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-12-02 08:23:12,392 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:23:12,392 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:23:12,392 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 08:23:12,392 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 08:23:12,393 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 08:23:12,393 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 08:23:12,393 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 08:23:12,393 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:23:12,393 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 08:23:12,393 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 08:23:12,394 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 08:23:12,394 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 08:23:12,394 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:23:12,394 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 08:23:12,394 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 08:23:12,394 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 08:23:12,394 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 08:23:12,394 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 08:23:12,395 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 08:23:12,395 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 08:23:12,395 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 08:23:12,395 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:23:12,395 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 08:23:12,395 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 08:23:12,395 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 08:23:12,395 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:23:12,396 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:23:12,396 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 08:23:12,396 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-02 08:23:12,396 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 08:23:12,396 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 08:23:12,396 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_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 [2018-12-02 08:23:12,415 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:23:12,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:23:12,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:23:12,428 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:23:12,428 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:23:12,429 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-12-02 08:23:12,471 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/data/99fbcc0bd/fef050df20be48e59ad8c33f98872dbd/FLAGb7dec2731 [2018-12-02 08:23:12,882 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:23:12,882 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-12-02 08:23:12,889 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/data/99fbcc0bd/fef050df20be48e59ad8c33f98872dbd/FLAGb7dec2731 [2018-12-02 08:23:12,897 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/data/99fbcc0bd/fef050df20be48e59ad8c33f98872dbd [2018-12-02 08:23:12,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:23:12,900 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 08:23:12,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:23:12,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:23:12,904 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:23:12,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:23:12" (1/1) ... [2018-12-02 08:23:12,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7834880b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:12, skipping insertion in model container [2018-12-02 08:23:12,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:23:12" (1/1) ... [2018-12-02 08:23:12,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:23:12,939 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:23:13,100 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:23:13,106 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:23:13,163 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:23:13,196 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:23:13,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:13 WrapperNode [2018-12-02 08:23:13,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:23:13,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:23:13,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:23:13,197 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:23:13,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:13" (1/1) ... [2018-12-02 08:23:13,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:13" (1/1) ... [2018-12-02 08:23:13,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:13" (1/1) ... [2018-12-02 08:23:13,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:13" (1/1) ... [2018-12-02 08:23:13,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:13" (1/1) ... [2018-12-02 08:23:13,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:13" (1/1) ... [2018-12-02 08:23:13,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:13" (1/1) ... [2018-12-02 08:23:13,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:23:13,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:23:13,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:23:13,230 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:23:13,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:23:13,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 08:23:13,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:23:13,265 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-02 08:23:13,265 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 08:23:13,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-02 08:23:13,265 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 08:23:13,265 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 08:23:13,265 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 08:23:13,265 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 08:23:13,265 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 08:23:13,265 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 08:23:13,265 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 08:23:13,265 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 08:23:13,265 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 08:23:13,265 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 08:23:13,265 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 08:23:13,266 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 08:23:13,266 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 08:23:13,266 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 08:23:13,266 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 08:23:13,266 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 08:23:13,266 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 08:23:13,266 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 08:23:13,266 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 08:23:13,267 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 08:23:13,267 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 08:23:13,267 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 08:23:13,267 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 08:23:13,267 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 08:23:13,267 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 08:23:13,267 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 08:23:13,267 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 08:23:13,267 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 08:23:13,268 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 08:23:13,268 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 08:23:13,268 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 08:23:13,268 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 08:23:13,268 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 08:23:13,268 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 08:23:13,268 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 08:23:13,268 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 08:23:13,268 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 08:23:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 08:23:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 08:23:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 08:23:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 08:23:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 08:23:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 08:23:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 08:23:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 08:23:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 08:23:13,270 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 08:23:13,270 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 08:23:13,270 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 08:23:13,270 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 08:23:13,270 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 08:23:13,270 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 08:23:13,270 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 08:23:13,270 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 08:23:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 08:23:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 08:23:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 08:23:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 08:23:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 08:23:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 08:23:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 08:23:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 08:23:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 08:23:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 08:23:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-12-02 08:23:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 08:23:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 08:23:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 08:23:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 08:23:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 08:23:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 08:23:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 08:23:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 08:23:13,273 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 08:23:13,273 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 08:23:13,273 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 08:23:13,273 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 08:23:13,273 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 08:23:13,273 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 08:23:13,273 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 08:23:13,273 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 08:23:13,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 08:23:13,274 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 08:23:13,274 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 08:23:13,274 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 08:23:13,274 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 08:23:13,274 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 08:23:13,274 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 08:23:13,274 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 08:23:13,274 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 08:23:13,274 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 08:23:13,274 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 08:23:13,275 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 08:23:13,275 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 08:23:13,275 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 08:23:13,275 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 08:23:13,275 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 08:23:13,275 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 08:23:13,275 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 08:23:13,275 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 08:23:13,275 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 08:23:13,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-02 08:23:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-02 08:23:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 08:23:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 08:23:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 08:23:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 08:23:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 08:23:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 08:23:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 08:23:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:23:13,588 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:23:13,589 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 08:23:13,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:23:13 BoogieIcfgContainer [2018-12-02 08:23:13,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:23:13,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 08:23:13,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 08:23:13,591 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 08:23:13,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:23:12" (1/3) ... [2018-12-02 08:23:13,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791d746d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:23:13, skipping insertion in model container [2018-12-02 08:23:13,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:13" (2/3) ... [2018-12-02 08:23:13,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791d746d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:23:13, skipping insertion in model container [2018-12-02 08:23:13,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:23:13" (3/3) ... [2018-12-02 08:23:13,593 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-12-02 08:23:13,601 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 08:23:13,607 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-12-02 08:23:13,618 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-12-02 08:23:13,632 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 08:23:13,633 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 08:23:13,633 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 08:23:13,633 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 08:23:13,633 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 08:23:13,633 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 08:23:13,633 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 08:23:13,633 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 08:23:13,633 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 08:23:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-12-02 08:23:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-02 08:23:13,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:13,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:13,650 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-02 08:23:13,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:13,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1993923955, now seen corresponding path program 1 times [2018-12-02 08:23:13,657 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:23:13,657 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:23:13,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:13,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:13,709 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:23:13,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:13,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 08:23:13,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 08:23:13,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 08:23:13,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 08:23:13,724 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-12-02 08:23:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:13,737 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-12-02 08:23:13,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 08:23:13,738 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-12-02 08:23:13,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:13,744 INFO L225 Difference]: With dead ends: 84 [2018-12-02 08:23:13,744 INFO L226 Difference]: Without dead ends: 81 [2018-12-02 08:23:13,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 08:23:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-02 08:23:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-02 08:23:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-02 08:23:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2018-12-02 08:23:13,771 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 8 [2018-12-02 08:23:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:13,771 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2018-12-02 08:23:13,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 08:23:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-12-02 08:23:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 08:23:13,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:13,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:13,772 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-02 08:23:13,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:13,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1682195681, now seen corresponding path program 1 times [2018-12-02 08:23:13,772 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:23:13,772 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:23:13,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:13,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:13,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 08:23:13,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:13,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:13,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 08:23:13,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:13,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:13,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 08:23:13,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:13,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:13,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-02 08:23:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:13,882 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:23:13,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:13,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:23:13,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:23:13,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:23:13,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:23:13,884 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 5 states. [2018-12-02 08:23:14,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:14,134 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-02 08:23:14,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:23:14,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 08:23:14,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:14,135 INFO L225 Difference]: With dead ends: 73 [2018-12-02 08:23:14,136 INFO L226 Difference]: Without dead ends: 73 [2018-12-02 08:23:14,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:23:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-02 08:23:14,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-02 08:23:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 08:23:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-12-02 08:23:14,142 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 9 [2018-12-02 08:23:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:14,142 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-12-02 08:23:14,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:23:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-12-02 08:23:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 08:23:14,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:14,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:14,143 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-02 08:23:14,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1682195682, now seen corresponding path program 1 times [2018-12-02 08:23:14,144 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:23:14,144 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:23:14,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:14,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:14,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 08:23:14,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:14,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 08:23:14,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:14,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:14,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 08:23:14,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:14,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:14,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-02 08:23:14,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:14,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:14,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:14,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 08:23:14,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:14,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:14,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-12-02 08:23:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:14,269 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:23:14,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:14,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:23:14,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:23:14,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:23:14,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:23:14,271 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 5 states. [2018-12-02 08:23:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:14,547 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-12-02 08:23:14,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:23:14,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-02 08:23:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:14,549 INFO L225 Difference]: With dead ends: 89 [2018-12-02 08:23:14,549 INFO L226 Difference]: Without dead ends: 89 [2018-12-02 08:23:14,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:23:14,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-02 08:23:14,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-12-02 08:23:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-02 08:23:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-12-02 08:23:14,554 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 9 [2018-12-02 08:23:14,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:14,554 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-12-02 08:23:14,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:23:14,554 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-12-02 08:23:14,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 08:23:14,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:14,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:14,555 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-02 08:23:14,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:14,555 INFO L82 PathProgramCache]: Analyzing trace with hash 608458612, now seen corresponding path program 1 times [2018-12-02 08:23:14,555 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:23:14,555 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:23:14,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:14,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:14,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 08:23:14,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:14,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:14,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 08:23:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:14,603 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:23:14,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:14,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 08:23:14,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:23:14,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:23:14,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:23:14,605 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 3 states. [2018-12-02 08:23:14,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:14,686 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-12-02 08:23:14,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:23:14,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 08:23:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:14,687 INFO L225 Difference]: With dead ends: 74 [2018-12-02 08:23:14,687 INFO L226 Difference]: Without dead ends: 74 [2018-12-02 08:23:14,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:23:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-02 08:23:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-02 08:23:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-02 08:23:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-12-02 08:23:14,690 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 10 [2018-12-02 08:23:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:14,691 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-12-02 08:23:14,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:23:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-12-02 08:23:14,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 08:23:14,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:14,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:14,691 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-02 08:23:14,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:14,692 INFO L82 PathProgramCache]: Analyzing trace with hash 608458613, now seen corresponding path program 1 times [2018-12-02 08:23:14,692 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:23:14,692 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:23:14,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:14,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:14,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 08:23:14,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:14,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:14,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 08:23:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:14,746 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:23:14,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:14,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 08:23:14,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:23:14,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:23:14,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:23:14,748 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 3 states. [2018-12-02 08:23:14,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:14,824 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-12-02 08:23:14,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:23:14,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 08:23:14,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:14,825 INFO L225 Difference]: With dead ends: 70 [2018-12-02 08:23:14,825 INFO L226 Difference]: Without dead ends: 70 [2018-12-02 08:23:14,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:23:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-02 08:23:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-02 08:23:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-02 08:23:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-12-02 08:23:14,828 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 10 [2018-12-02 08:23:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:14,828 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-12-02 08:23:14,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:23:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-12-02 08:23:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 08:23:14,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:14,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:14,829 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-02 08:23:14,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:14,829 INFO L82 PathProgramCache]: Analyzing trace with hash 620506892, now seen corresponding path program 1 times [2018-12-02 08:23:14,829 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:23:14,829 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:23:14,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:14,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:14,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 08:23:14,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-12-02 08:23:14,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:15,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:15,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 08:23:15,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-12-02 08:23:15,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:15,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-02 08:23:15,085 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:15,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:15,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:15,103 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-12-02 08:23:15,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-12-02 08:23:15,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-02 08:23:15,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:15,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 08:23:15,152 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:15,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-02 08:23:15,166 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:15,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:15,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-12-02 08:23:15,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-02 08:23:15,190 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:15,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 08:23:15,208 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:15,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-02 08:23:15,222 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:15,225 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:15,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:15,228 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2018-12-02 08:23:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:15,240 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:23:15,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:15,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 08:23:15,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 08:23:15,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 08:23:15,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=38, Unknown=5, NotChecked=0, Total=56 [2018-12-02 08:23:15,242 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 8 states. [2018-12-02 08:23:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:15,712 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-12-02 08:23:15,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 08:23:15,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-02 08:23:15,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:15,713 INFO L225 Difference]: With dead ends: 78 [2018-12-02 08:23:15,713 INFO L226 Difference]: Without dead ends: 78 [2018-12-02 08:23:15,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=97, Unknown=13, NotChecked=0, Total=156 [2018-12-02 08:23:15,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-02 08:23:15,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-12-02 08:23:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 08:23:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-12-02 08:23:15,719 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 15 [2018-12-02 08:23:15,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:15,719 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-12-02 08:23:15,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 08:23:15,720 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-12-02 08:23:15,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 08:23:15,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:15,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:15,721 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-02 08:23:15,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:15,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2056122585, now seen corresponding path program 1 times [2018-12-02 08:23:15,721 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:23:15,721 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:23:15,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:15,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:15,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:15,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 08:23:15,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:15,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:15,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:15,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 08:23:15,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:15,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:15,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-12-02 08:23:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:15,867 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:23:15,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:15,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:23:15,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:23:15,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:23:15,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:23:15,870 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 7 states. [2018-12-02 08:23:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:16,192 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-12-02 08:23:16,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:23:16,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-02 08:23:16,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:16,193 INFO L225 Difference]: With dead ends: 78 [2018-12-02 08:23:16,193 INFO L226 Difference]: Without dead ends: 78 [2018-12-02 08:23:16,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-02 08:23:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-02 08:23:16,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-02 08:23:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-02 08:23:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-12-02 08:23:16,197 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 16 [2018-12-02 08:23:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:16,197 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-12-02 08:23:16,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:23:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-12-02 08:23:16,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 08:23:16,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:16,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:16,198 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-02 08:23:16,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:16,198 INFO L82 PathProgramCache]: Analyzing trace with hash -811500198, now seen corresponding path program 1 times [2018-12-02 08:23:16,198 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:23:16,198 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:23:16,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:16,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:16,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 08:23:16,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-02 08:23:16,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:23:16,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 08:23:16,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-02 08:23:16,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 08:23:16,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-02 08:23:16,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-02 08:23:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:16,322 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:23:16,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:16,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:23:16,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 08:23:16,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 08:23:16,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:23:16,324 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 8 states. [2018-12-02 08:23:16,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:16,605 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-12-02 08:23:16,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:23:16,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-12-02 08:23:16,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:16,606 INFO L225 Difference]: With dead ends: 84 [2018-12-02 08:23:16,606 INFO L226 Difference]: Without dead ends: 84 [2018-12-02 08:23:16,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 08:23:16,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-02 08:23:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2018-12-02 08:23:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 08:23:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-12-02 08:23:16,609 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 23 [2018-12-02 08:23:16,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:16,609 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-12-02 08:23:16,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 08:23:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-12-02 08:23:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 08:23:16,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:16,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:16,610 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-02 08:23:16,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:16,610 INFO L82 PathProgramCache]: Analyzing trace with hash -811500197, now seen corresponding path program 1 times [2018-12-02 08:23:16,611 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:23:16,611 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:23:16,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:16,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:16,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:23:16,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 08:23:16,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:23:16,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 08:23:16,738 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,748 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-02 08:23:16,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 08:23:16,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 08:23:16,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 08:23:16,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 08:23:16,801 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:16,806 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-02 08:23:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:16,821 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:23:16,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:16,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:23:16,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 08:23:16,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 08:23:16,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:23:16,823 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 8 states. [2018-12-02 08:23:17,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:17,201 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-12-02 08:23:17,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:23:17,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-12-02 08:23:17,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:17,203 INFO L225 Difference]: With dead ends: 86 [2018-12-02 08:23:17,203 INFO L226 Difference]: Without dead ends: 86 [2018-12-02 08:23:17,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 08:23:17,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-02 08:23:17,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2018-12-02 08:23:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-02 08:23:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-12-02 08:23:17,206 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 23 [2018-12-02 08:23:17,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:17,206 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-12-02 08:23:17,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 08:23:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-12-02 08:23:17,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 08:23:17,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:17,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:17,207 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-02 08:23:17,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:17,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1850615088, now seen corresponding path program 1 times [2018-12-02 08:23:17,208 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:23:17,208 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:23:17,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:17,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:17,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:23:17,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 08:23:17,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-12-02 08:23:17,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-02 08:23:17,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-02 08:23:17,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-12-02 08:23:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:17,318 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:23:17,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:17,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:23:17,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:23:17,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:23:17,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:23:17,321 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 7 states. [2018-12-02 08:23:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:17,522 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-02 08:23:17,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:23:17,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-12-02 08:23:17,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:17,523 INFO L225 Difference]: With dead ends: 70 [2018-12-02 08:23:17,523 INFO L226 Difference]: Without dead ends: 70 [2018-12-02 08:23:17,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:23:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-02 08:23:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-02 08:23:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-02 08:23:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-12-02 08:23:17,526 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 25 [2018-12-02 08:23:17,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:17,526 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-12-02 08:23:17,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:23:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-12-02 08:23:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 08:23:17,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:17,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:17,527 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-02 08:23:17,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:17,527 INFO L82 PathProgramCache]: Analyzing trace with hash 968508614, now seen corresponding path program 1 times [2018-12-02 08:23:17,528 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:23:17,528 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:23:17,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:17,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:17,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:23:17,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 08:23:17,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 08:23:17,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 08:23:17,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 08:23:17,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-02 08:23:17,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:17,647 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:23:17,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:17,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:23:17,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:23:17,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:23:17,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:23:17,649 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 7 states. [2018-12-02 08:23:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:17,817 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-12-02 08:23:17,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:23:17,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-02 08:23:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:17,818 INFO L225 Difference]: With dead ends: 69 [2018-12-02 08:23:17,818 INFO L226 Difference]: Without dead ends: 69 [2018-12-02 08:23:17,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:23:17,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-02 08:23:17,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-02 08:23:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-02 08:23:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2018-12-02 08:23:17,821 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 26 [2018-12-02 08:23:17,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:17,821 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2018-12-02 08:23:17,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:23:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-12-02 08:23:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 08:23:17,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:17,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:17,822 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-02 08:23:17,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:17,822 INFO L82 PathProgramCache]: Analyzing trace with hash -41003973, now seen corresponding path program 1 times [2018-12-02 08:23:17,822 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:23:17,822 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:23:17,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:17,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:17,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 08:23:17,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-02 08:23:17,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:23:17,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 08:23:17,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-02 08:23:17,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 08:23:17,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-02 08:23:17,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:17,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-02 08:23:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:17,955 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:23:17,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:17,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:23:17,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 08:23:17,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 08:23:17,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:23:17,957 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 8 states. [2018-12-02 08:23:18,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:18,187 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-12-02 08:23:18,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:23:18,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-02 08:23:18,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:18,188 INFO L225 Difference]: With dead ends: 68 [2018-12-02 08:23:18,188 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 08:23:18,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 08:23:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 08:23:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-02 08:23:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 08:23:18,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-12-02 08:23:18,190 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 27 [2018-12-02 08:23:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:18,191 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-12-02 08:23:18,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 08:23:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-12-02 08:23:18,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 08:23:18,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:18,191 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:18,191 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-02 08:23:18,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:18,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1918400567, now seen corresponding path program 1 times [2018-12-02 08:23:18,192 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:23:18,192 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:23:18,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:18,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:18,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 08:23:18,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:18,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:18,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-02 08:23:18,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:23:18,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 08:23:18,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:18,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:18,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:18,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-02 08:23:18,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-02 08:23:18,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:18,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:18,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2018-12-02 08:23:18,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-12-02 08:23:18,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-02 08:23:18,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:18,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:18,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:18,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2018-12-02 08:23:18,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-12-02 08:23:18,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-12-02 08:23:18,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:18,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-12-02 08:23:18,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:18,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-12-02 08:23:18,558 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:18,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:18,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:18,570 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2018-12-02 08:23:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:18,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:23:18,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-12-02 08:23:18,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-12-02 08:23:18,921 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:18,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:18,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-02 08:23:18,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:50 [2018-12-02 08:23:19,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-12-02 08:23:19,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:19,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-12-02 08:23:19,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:19,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:23:19,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-12-02 08:23:19,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-02 08:23:19,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:19,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-02 08:23:19,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:19,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:23:19,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2018-12-02 08:23:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:19,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 08:23:19,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-12-02 08:23:19,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 08:23:19,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 08:23:19,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-02 08:23:19,243 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 17 states. [2018-12-02 08:23:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:20,281 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-12-02 08:23:20,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 08:23:20,281 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-12-02 08:23:20,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:20,282 INFO L225 Difference]: With dead ends: 72 [2018-12-02 08:23:20,282 INFO L226 Difference]: Without dead ends: 72 [2018-12-02 08:23:20,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-12-02 08:23:20,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-02 08:23:20,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2018-12-02 08:23:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 08:23:20,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-12-02 08:23:20,284 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 28 [2018-12-02 08:23:20,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:20,284 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-12-02 08:23:20,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 08:23:20,284 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-12-02 08:23:20,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 08:23:20,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:20,285 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:20,285 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-02 08:23:20,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:20,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1918400566, now seen corresponding path program 1 times [2018-12-02 08:23:20,285 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:23:20,285 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:23:20,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:20,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:20,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 08:23:20,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:20,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 08:23:20,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:20,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:20,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-12-02 08:23:20,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:20,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 08:23:20,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:20,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:20,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:20,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 08:23:20,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:20,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:20,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-12-02 08:23:20,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:23:20,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 08:23:20,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:20,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:20,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:23:20,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 08:23:20,564 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:20,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:20,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:20,578 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:43 [2018-12-02 08:23:20,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:20,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2018-12-02 08:23:20,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:20,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:20,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:20,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-02 08:23:20,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:20,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:20,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:46 [2018-12-02 08:23:20,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 08:23:20,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-12-02 08:23:20,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:20,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:20,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 43 [2018-12-02 08:23:20,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2018-12-02 08:23:20,928 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:20,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-12-02 08:23:20,965 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:20,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:20,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:20,993 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2018-12-02 08:23:21,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-12-02 08:23:21,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-02 08:23:21,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:21,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-02 08:23:21,065 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:21,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:21,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2018-12-02 08:23:21,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-02 08:23:21,098 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:21,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-12-02 08:23:21,122 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:21,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-12-02 08:23:21,142 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:21,150 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:21,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:21,155 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:68, output treesize:18 [2018-12-02 08:23:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:21,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:23:22,240 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-12-02 08:23:22,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-02 08:23:22,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-02 08:23:22,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-02 08:23:22,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-02 08:23:22,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-02 08:23:22,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-02 08:23:22,276 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,279 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-02 08:23:22,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-02 08:23:22,435 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,439 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-02 08:23:22,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-02 08:23:22,443 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,446 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:22,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-02 08:23:22,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-02 08:23:22,572 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:22,586 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:22,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-02 08:23:22,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-02 08:23:22,593 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:22,606 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:22,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-12-02 08:23:22,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-02 08:23:22,749 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:22,761 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:22,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-12-02 08:23:22,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-02 08:23:22,766 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:22,778 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:22,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 13 dim-0 vars, and 9 xjuncts. [2018-12-02 08:23:22,908 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2018-12-02 08:23:23,245 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2018-12-02 08:23:23,251 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 08:23:23,252 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 08:23:23,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-12-02 08:23:23,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:23,312 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 08:23:23,312 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 08:23:23,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-12-02 08:23:23,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:23,366 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 08:23:23,366 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 08:23:23,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-02 08:23:23,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:23,421 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 08:23:23,421 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 08:23:23,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-12-02 08:23:23,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:23,483 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 08:23:23,484 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 08:23:23,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-02 08:23:23,485 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:23,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2018-12-02 08:23:23,546 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:94, output treesize:33 [2018-12-02 08:23:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:23,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 08:23:23,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-12-02 08:23:23,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 08:23:23,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 08:23:23,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-12-02 08:23:23,899 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 21 states. [2018-12-02 08:23:24,958 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2018-12-02 08:23:25,120 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 50 [2018-12-02 08:23:25,656 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 56 [2018-12-02 08:23:31,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:31,169 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-12-02 08:23:31,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 08:23:31,170 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-12-02 08:23:31,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:31,170 INFO L225 Difference]: With dead ends: 68 [2018-12-02 08:23:31,170 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 08:23:31,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2018-12-02 08:23:31,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 08:23:31,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-12-02 08:23:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 08:23:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-02 08:23:31,172 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 28 [2018-12-02 08:23:31,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:31,172 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-02 08:23:31,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 08:23:31,172 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-02 08:23:31,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 08:23:31,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:31,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:31,173 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-02 08:23:31,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:31,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1271123095, now seen corresponding path program 1 times [2018-12-02 08:23:31,173 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:23:31,173 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:23:31,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:31,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:31,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 6 treesize of output 5 [2018-12-02 08:23:31,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:31,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:31,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 08:23:31,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 08:23:31,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:31,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:31,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2018-12-02 08:23:31,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:23:31,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 08:23:31,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:31,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:31,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:31,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-02 08:23:31,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:31,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:31,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 08:23:31,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:31,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:31,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-12-02 08:23:31,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-02 08:23:31,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-02 08:23:31,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:31,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:31,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:23:31,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-12-02 08:23:31,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 08:23:31,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-02 08:23:31,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:23:31,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:23:31,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-02 08:23:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:31,364 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:23:31,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:31,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 08:23:31,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 08:23:31,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 08:23:31,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:23:31,366 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 9 states. [2018-12-02 08:23:33,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:33,773 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-12-02 08:23:33,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 08:23:33,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-12-02 08:23:33,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:33,774 INFO L225 Difference]: With dead ends: 81 [2018-12-02 08:23:33,774 INFO L226 Difference]: Without dead ends: 81 [2018-12-02 08:23:33,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-02 08:23:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-02 08:23:33,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2018-12-02 08:23:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-02 08:23:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-12-02 08:23:33,776 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 28 [2018-12-02 08:23:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:33,776 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-12-02 08:23:33,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 08:23:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-12-02 08:23:33,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 08:23:33,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:33,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:33,777 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-02 08:23:33,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:33,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1271123094, now seen corresponding path program 1 times [2018-12-02 08:23:33,777 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:23:33,777 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:23:33,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:23:33,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:23:33,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:23:33,828 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:23:33,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:23:33,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 08:23:33,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:23:33,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:23:33,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:23:33,830 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 3 states. [2018-12-02 08:23:33,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:23:33,932 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-02 08:23:33,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:23:33,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 08:23:33,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:23:33,932 INFO L225 Difference]: With dead ends: 60 [2018-12-02 08:23:33,933 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 08:23:33,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:23:33,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 08:23:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-02 08:23:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-02 08:23:33,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-12-02 08:23:33,934 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 28 [2018-12-02 08:23:33,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:23:33,934 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-12-02 08:23:33,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:23:33,934 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-12-02 08:23:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 08:23:33,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:23:33,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:23:33,935 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-02 08:23:33,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:23:33,935 INFO L82 PathProgramCache]: Analyzing trace with hash 179927279, now seen corresponding path program 1 times [2018-12-02 08:23:33,935 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:23:33,935 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3454280c-1a55-4ac0-8a43-8868c2f324e0/bin-2019/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:23:33,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:23:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:23:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:23:34,205 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 08:23:34,214 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 08:23:34,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:23:34 BoogieIcfgContainer [2018-12-02 08:23:34,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 08:23:34,223 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 08:23:34,223 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 08:23:34,223 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 08:23:34,224 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:23:13" (3/4) ... [2018-12-02 08:23:34,226 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 08:23:34,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 08:23:34,227 INFO L168 Benchmark]: Toolchain (without parser) took 21327.06 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -135.6 MB). Peak memory consumption was 174.3 MB. Max. memory is 11.5 GB. [2018-12-02 08:23:34,227 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:23:34,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-02 08:23:34,227 INFO L168 Benchmark]: Boogie Preprocessor took 32.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:23:34,227 INFO L168 Benchmark]: RCFGBuilder took 359.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:23:34,227 INFO L168 Benchmark]: TraceAbstraction took 20633.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.7 MB). Peak memory consumption was 156.8 MB. Max. memory is 11.5 GB. [2018-12-02 08:23:34,228 INFO L168 Benchmark]: Witness Printer took 3.00 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:23:34,228 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 295.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.74 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 359.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20633.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.7 MB). Peak memory consumption was 156.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.00 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 633]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 633. Possible FailurePath: [L635] struct item *list = ((void *)0); VAL [list={-2146959039:0}] [L637] CALL append(&list) VAL [plist={-2146959039:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={-2146959040:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={-2146959040:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L627] item->next = *plist VAL [\read(**plist)={0:0}, item={-2146959040:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L628] EXPR item->next VAL [item={-2146959040:0}, item->next={0:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2147483648:0}, item={-2146959040:0}, item->next={0:0}, malloc(sizeof *item)={-2147483648:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2147483648:0}, item={-2146959040:0}, item->next={0:0}, malloc(sizeof *item)={-2147483648:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L631] *plist = item VAL [item={-2146959040:0}, malloc(sizeof *item)={-2147483648:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L637] RET append(&list) VAL [list={-2146959039:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] \read(*list) VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}] [L639] COND TRUE \read(*list) [L640] EXPR \read(*list) VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}] [L640] EXPR list->next VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}, list->next={0:0}] [L640] struct item *next = list->next; [L641] EXPR \read(*list) VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}, next={0:0}] [L641] free(list) VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}, next={0:0}] [L641] free(list) [L642] list = next VAL [list={-2146959039:0}, next={0:0}] [L644] \read(*list) VAL [\read(*list)={0:0}, list={-2146959039:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) [L649] return 0; [L635] struct item *list = ((void *)0); [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 84 locations, 39 error locations. UNSAFE Result, 20.5s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 13.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 677 SDtfs, 891 SDslu, 1763 SDs, 0 SdLazy, 2508 SolverSat, 133 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 261 SyntacticMatches, 3 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 52 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 351 ConstructedInterpolants, 44 QuantifiedInterpolants, 102672 SizeOfPredicates, 125 NumberOfNonLiveVariables, 1501 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...