./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/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_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/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_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/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_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/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-0cd3be1 [2018-11-28 11:38:42,459 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:38:42,460 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:38:42,469 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:38:42,469 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:38:42,470 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:38:42,471 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:38:42,472 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:38:42,473 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:38:42,473 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:38:42,474 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:38:42,474 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:38:42,475 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:38:42,475 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:38:42,476 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:38:42,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:38:42,477 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:38:42,478 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:38:42,479 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:38:42,480 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:38:42,481 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:38:42,481 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:38:42,482 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:38:42,482 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:38:42,482 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:38:42,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:38:42,483 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:38:42,484 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:38:42,484 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:38:42,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:38:42,485 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:38:42,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:38:42,485 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:38:42,485 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:38:42,486 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:38:42,486 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:38:42,486 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 11:38:42,493 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:38:42,493 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:38:42,494 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:38:42,494 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:38:42,495 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:38:42,495 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:38:42,495 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:38:42,495 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:38:42,495 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:38:42,495 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:38:42,495 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:38:42,496 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:38:42,496 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:38:42,496 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 11:38:42,496 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 11:38:42,496 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 11:38:42,496 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:38:42,497 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:38:42,497 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:38:42,497 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:38:42,497 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:38:42,497 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:38:42,497 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:38:42,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:38:42,498 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:38:42,498 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:38:42,498 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:38:42,498 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:38:42,498 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_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/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-11-28 11:38:42,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:38:42,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:38:42,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:38:42,534 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:38:42,534 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:38:42,535 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-11-28 11:38:42,571 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/data/8710ade79/c4594454aa8b4d81936ce2b5df9fe500/FLAG2c69c6b3d [2018-11-28 11:38:43,002 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:38:43,002 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-11-28 11:38:43,009 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/data/8710ade79/c4594454aa8b4d81936ce2b5df9fe500/FLAG2c69c6b3d [2018-11-28 11:38:43,017 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/data/8710ade79/c4594454aa8b4d81936ce2b5df9fe500 [2018-11-28 11:38:43,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:38:43,019 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 11:38:43,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:38:43,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:38:43,022 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:38:43,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:38:43" (1/1) ... [2018-11-28 11:38:43,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d9df2d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:43, skipping insertion in model container [2018-11-28 11:38:43,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:38:43" (1/1) ... [2018-11-28 11:38:43,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:38:43,053 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:38:43,224 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:38:43,230 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:38:43,305 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:38:43,338 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:38:43,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:43 WrapperNode [2018-11-28 11:38:43,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:38:43,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:38:43,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:38:43,339 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:38:43,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:43" (1/1) ... [2018-11-28 11:38:43,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:43" (1/1) ... [2018-11-28 11:38:43,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:43" (1/1) ... [2018-11-28 11:38:43,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:43" (1/1) ... [2018-11-28 11:38:43,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:43" (1/1) ... [2018-11-28 11:38:43,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:43" (1/1) ... [2018-11-28 11:38:43,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:43" (1/1) ... [2018-11-28 11:38:43,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:38:43,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:38:43,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:38:43,375 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:38:43,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:38:43,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:38:43,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:38:43,407 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-28 11:38:43,407 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:38:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 11:38:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 11:38:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 11:38:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 11:38:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 11:38:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 11:38:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 11:38:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 11:38:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 11:38:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 11:38:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 11:38:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 11:38:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 11:38:43,409 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 11:38:43,409 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 11:38:43,409 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 11:38:43,409 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 11:38:43,409 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 11:38:43,409 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 11:38:43,409 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 11:38:43,409 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 11:38:43,409 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 11:38:43,410 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 11:38:43,410 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 11:38:43,410 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 11:38:43,410 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 11:38:43,410 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 11:38:43,410 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 11:38:43,410 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 11:38:43,410 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 11:38:43,410 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 11:38:43,410 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 11:38:43,411 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 11:38:43,411 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 11:38:43,411 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 11:38:43,411 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 11:38:43,411 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 11:38:43,411 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 11:38:43,411 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 11:38:43,411 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 11:38:43,411 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 11:38:43,411 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 11:38:43,411 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 11:38:43,412 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 11:38:43,412 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 11:38:43,412 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 11:38:43,412 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 11:38:43,412 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 11:38:43,412 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 11:38:43,412 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 11:38:43,412 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 11:38:43,412 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 11:38:43,412 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 11:38:43,413 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 11:38:43,413 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 11:38:43,413 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 11:38:43,413 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 11:38:43,413 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 11:38:43,413 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 11:38:43,413 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 11:38:43,413 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 11:38:43,414 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 11:38:43,414 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 11:38:43,414 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 11:38:43,414 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 11:38:43,414 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 11:38:43,414 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 11:38:43,414 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 11:38:43,414 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 11:38:43,414 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 11:38:43,414 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 11:38:43,414 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 11:38:43,415 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 11:38:43,415 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 11:38:43,415 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 11:38:43,415 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 11:38:43,415 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 11:38:43,415 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 11:38:43,415 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 11:38:43,415 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 11:38:43,415 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 11:38:43,415 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 11:38:43,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 11:38:43,416 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 11:38:43,416 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 11:38:43,416 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 11:38:43,416 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 11:38:43,416 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 11:38:43,416 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 11:38:43,416 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 11:38:43,416 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 11:38:43,416 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 11:38:43,416 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 11:38:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 11:38:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 11:38:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 11:38:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 11:38:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 11:38:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 11:38:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 11:38:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 11:38:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 11:38:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 11:38:43,418 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-28 11:38:43,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:38:43,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 11:38:43,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 11:38:43,418 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:38:43,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 11:38:43,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:38:43,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:38:43,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:38:43,763 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:38:43,763 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 11:38:43,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:38:43 BoogieIcfgContainer [2018-11-28 11:38:43,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:38:43,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:38:43,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:38:43,767 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:38:43,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:38:43" (1/3) ... [2018-11-28 11:38:43,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2977eec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:38:43, skipping insertion in model container [2018-11-28 11:38:43,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:43" (2/3) ... [2018-11-28 11:38:43,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2977eec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:38:43, skipping insertion in model container [2018-11-28 11:38:43,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:38:43" (3/3) ... [2018-11-28 11:38:43,769 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-11-28 11:38:43,775 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:38:43,781 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-11-28 11:38:43,791 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-11-28 11:38:43,806 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:38:43,807 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:38:43,807 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 11:38:43,807 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:38:43,807 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:38:43,807 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:38:43,807 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:38:43,807 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:38:43,808 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:38:43,820 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-11-28 11:38:43,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 11:38:43,827 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:43,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:43,829 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-11-28 11:38:43,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:43,833 INFO L82 PathProgramCache]: Analyzing trace with hash -557279662, now seen corresponding path program 1 times [2018-11-28 11:38:43,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:43,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:43,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:43,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:43,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:43,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:43,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:38:43,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 11:38:43,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 11:38:43,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:38:43,928 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2018-11-28 11:38:43,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:43,941 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-11-28 11:38:43,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 11:38:43,943 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-11-28 11:38:43,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:43,949 INFO L225 Difference]: With dead ends: 85 [2018-11-28 11:38:43,949 INFO L226 Difference]: Without dead ends: 82 [2018-11-28 11:38:43,951 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-11-28 11:38:43,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-28 11:38:43,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-28 11:38:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 11:38:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-11-28 11:38:43,978 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 8 [2018-11-28 11:38:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:43,978 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-11-28 11:38:43,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 11:38:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-28 11:38:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 11:38:43,979 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:43,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:43,979 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-11-28 11:38:43,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:43,980 INFO L82 PathProgramCache]: Analyzing trace with hash -95705117, now seen corresponding path program 1 times [2018-11-28 11:38:43,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:43,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:43,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:43,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:43,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:44,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:44,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:38:44,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:38:44,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:38:44,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:38:44,078 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 5 states. [2018-11-28 11:38:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:44,242 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-28 11:38:44,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:38:44,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 11:38:44,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:44,243 INFO L225 Difference]: With dead ends: 74 [2018-11-28 11:38:44,243 INFO L226 Difference]: Without dead ends: 74 [2018-11-28 11:38:44,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:38:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-28 11:38:44,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-28 11:38:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 11:38:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-28 11:38:44,249 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 9 [2018-11-28 11:38:44,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:44,250 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-28 11:38:44,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:38:44,250 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-28 11:38:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 11:38:44,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:44,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:44,251 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-11-28 11:38:44,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:44,251 INFO L82 PathProgramCache]: Analyzing trace with hash -95705116, now seen corresponding path program 1 times [2018-11-28 11:38:44,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:44,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:44,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:44,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:44,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:44,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:44,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:38:44,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:38:44,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:38:44,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:38:44,332 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-11-28 11:38:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:44,522 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-28 11:38:44,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:38:44,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 11:38:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:44,525 INFO L225 Difference]: With dead ends: 90 [2018-11-28 11:38:44,525 INFO L226 Difference]: Without dead ends: 90 [2018-11-28 11:38:44,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:38:44,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-28 11:38:44,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2018-11-28 11:38:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-28 11:38:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-11-28 11:38:44,530 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 9 [2018-11-28 11:38:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:44,531 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-11-28 11:38:44,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:38:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-11-28 11:38:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 11:38:44,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:44,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:44,532 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-11-28 11:38:44,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:44,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1328108723, now seen corresponding path program 1 times [2018-11-28 11:38:44,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:44,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:44,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:44,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:44,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:44,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:44,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:38:44,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:38:44,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:38:44,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:38:44,556 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 3 states. [2018-11-28 11:38:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:44,593 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-11-28 11:38:44,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:38:44,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 11:38:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:44,594 INFO L225 Difference]: With dead ends: 75 [2018-11-28 11:38:44,594 INFO L226 Difference]: Without dead ends: 75 [2018-11-28 11:38:44,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:38:44,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-28 11:38:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-28 11:38:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-28 11:38:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-11-28 11:38:44,597 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 10 [2018-11-28 11:38:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:44,598 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-11-28 11:38:44,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:38:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-11-28 11:38:44,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 11:38:44,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:44,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:44,599 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-11-28 11:38:44,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:44,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1328108724, now seen corresponding path program 1 times [2018-11-28 11:38:44,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:44,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:44,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:44,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:44,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:44,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-11-28 11:38:44,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:44,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:38:44,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:38:44,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:38:44,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:38:44,623 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 3 states. [2018-11-28 11:38:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:44,663 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-11-28 11:38:44,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:38:44,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 11:38:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:44,664 INFO L225 Difference]: With dead ends: 71 [2018-11-28 11:38:44,664 INFO L226 Difference]: Without dead ends: 71 [2018-11-28 11:38:44,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:38:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-28 11:38:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-28 11:38:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-28 11:38:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-11-28 11:38:44,669 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 10 [2018-11-28 11:38:44,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:44,669 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-11-28 11:38:44,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:38:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-11-28 11:38:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 11:38:44,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:44,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:44,670 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-11-28 11:38:44,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:44,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1312633070, now seen corresponding path program 1 times [2018-11-28 11:38:44,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:44,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:44,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:44,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:44,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:44,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:44,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:38:44,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:38:44,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:38:44,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:38:44,757 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 8 states. [2018-11-28 11:38:44,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:44,898 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-11-28 11:38:44,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:38:44,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-28 11:38:44,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:44,899 INFO L225 Difference]: With dead ends: 82 [2018-11-28 11:38:44,900 INFO L226 Difference]: Without dead ends: 82 [2018-11-28 11:38:44,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:38:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-28 11:38:44,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-11-28 11:38:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 11:38:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-11-28 11:38:44,906 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 15 [2018-11-28 11:38:44,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:44,906 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-11-28 11:38:44,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:38:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-11-28 11:38:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 11:38:44,907 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:44,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:44,907 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-11-28 11:38:44,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:44,907 INFO L82 PathProgramCache]: Analyzing trace with hash 2037197624, now seen corresponding path program 1 times [2018-11-28 11:38:44,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:44,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:44,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:44,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:44,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:44,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:44,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:38:44,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:38:44,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:38:44,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:44,964 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 7 states. [2018-11-28 11:38:45,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:45,034 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-11-28 11:38:45,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:38:45,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-28 11:38:45,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:45,035 INFO L225 Difference]: With dead ends: 77 [2018-11-28 11:38:45,035 INFO L226 Difference]: Without dead ends: 77 [2018-11-28 11:38:45,035 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-11-28 11:38:45,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-28 11:38:45,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2018-11-28 11:38:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 11:38:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-11-28 11:38:45,039 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 16 [2018-11-28 11:38:45,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:45,039 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-11-28 11:38:45,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:38:45,039 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-11-28 11:38:45,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 11:38:45,040 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:45,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:45,041 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-11-28 11:38:45,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:45,041 INFO L82 PathProgramCache]: Analyzing trace with hash -200406812, now seen corresponding path program 1 times [2018-11-28 11:38:45,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:45,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:45,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:45,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:45,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:45,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:45,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:38:45,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:38:45,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:38:45,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:45,095 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 7 states. [2018-11-28 11:38:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:45,198 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-11-28 11:38:45,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:38:45,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-28 11:38:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:45,199 INFO L225 Difference]: With dead ends: 80 [2018-11-28 11:38:45,199 INFO L226 Difference]: Without dead ends: 80 [2018-11-28 11:38:45,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:38:45,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-28 11:38:45,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2018-11-28 11:38:45,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 11:38:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-11-28 11:38:45,203 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 24 [2018-11-28 11:38:45,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:45,204 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-11-28 11:38:45,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:38:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-11-28 11:38:45,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 11:38:45,204 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:45,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:45,205 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-11-28 11:38:45,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:45,205 INFO L82 PathProgramCache]: Analyzing trace with hash -200406811, now seen corresponding path program 1 times [2018-11-28 11:38:45,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:45,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:45,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:45,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:45,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:45,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:45,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:38:45,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:38:45,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:38:45,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:45,310 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 7 states. [2018-11-28 11:38:45,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:45,438 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-11-28 11:38:45,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:38:45,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-28 11:38:45,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:45,439 INFO L225 Difference]: With dead ends: 82 [2018-11-28 11:38:45,439 INFO L226 Difference]: Without dead ends: 82 [2018-11-28 11:38:45,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:38:45,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-28 11:38:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-11-28 11:38:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 11:38:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-11-28 11:38:45,442 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 24 [2018-11-28 11:38:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:45,442 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-11-28 11:38:45,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:38:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-11-28 11:38:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 11:38:45,443 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:45,443 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-11-28 11:38:45,443 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-11-28 11:38:45,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:45,443 INFO L82 PathProgramCache]: Analyzing trace with hash 700839514, now seen corresponding path program 1 times [2018-11-28 11:38:45,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:45,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:45,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:45,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:45,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:45,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:45,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:38:45,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:38:45,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:38:45,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:38:45,503 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-11-28 11:38:45,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:45,566 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-11-28 11:38:45,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:38:45,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-28 11:38:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:45,567 INFO L225 Difference]: With dead ends: 66 [2018-11-28 11:38:45,567 INFO L226 Difference]: Without dead ends: 66 [2018-11-28 11:38:45,567 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-11-28 11:38:45,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-28 11:38:45,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-28 11:38:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 11:38:45,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-11-28 11:38:45,569 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2018-11-28 11:38:45,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:45,569 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-11-28 11:38:45,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:38:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-11-28 11:38:45,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 11:38:45,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:45,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:45,572 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-11-28 11:38:45,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:45,572 INFO L82 PathProgramCache]: Analyzing trace with hash -314795811, now seen corresponding path program 1 times [2018-11-28 11:38:45,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:45,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:45,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:45,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:45,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:45,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:45,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:38:45,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:38:45,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:38:45,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:38:45,620 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 6 states. [2018-11-28 11:38:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:45,717 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-11-28 11:38:45,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:38:45,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-28 11:38:45,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:45,718 INFO L225 Difference]: With dead ends: 65 [2018-11-28 11:38:45,718 INFO L226 Difference]: Without dead ends: 65 [2018-11-28 11:38:45,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:38:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-28 11:38:45,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-28 11:38:45,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 11:38:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-11-28 11:38:45,721 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 27 [2018-11-28 11:38:45,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:45,722 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-11-28 11:38:45,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:38:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-11-28 11:38:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 11:38:45,722 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:45,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:45,723 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-11-28 11:38:45,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:45,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1168735483, now seen corresponding path program 1 times [2018-11-28 11:38:45,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:45,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:45,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:45,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:45,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:45,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:45,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:38:45,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:38:45,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:38:45,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:45,780 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 7 states. [2018-11-28 11:38:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:45,853 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-28 11:38:45,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:38:45,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-11-28 11:38:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:45,853 INFO L225 Difference]: With dead ends: 64 [2018-11-28 11:38:45,853 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 11:38:45,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:38:45,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 11:38:45,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-28 11:38:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 11:38:45,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-11-28 11:38:45,856 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 28 [2018-11-28 11:38:45,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:45,856 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-11-28 11:38:45,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:38:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-28 11:38:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 11:38:45,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:45,857 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:45,857 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-11-28 11:38:45,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:45,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1776628288, now seen corresponding path program 1 times [2018-11-28 11:38:45,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:45,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:45,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:45,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:45,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:45,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:38:45,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:38:45,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:45,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:46,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:38:46,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:38:46,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-11-28 11:38:46,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-28 11:38:46,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-11-28 11:38:46,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-28 11:38:46,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-28 11:38:46,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:46,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-11-28 11:38:46,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-11-28 11:38:46,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-11-28 11:38:46,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-11-28 11:38:46,211 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-11-28 11:38:46,220 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:46,228 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-11-28 11:38:46,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-11-28 11:38:46,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:38:46,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 15 [2018-11-28 11:38:46,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 11:38:46,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 11:38:46,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-11-28 11:38:46,255 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 16 states. [2018-11-28 11:38:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:46,610 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-28 11:38:46,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:38:46,611 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-11-28 11:38:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:46,611 INFO L225 Difference]: With dead ends: 70 [2018-11-28 11:38:46,611 INFO L226 Difference]: Without dead ends: 70 [2018-11-28 11:38:46,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-11-28 11:38:46,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-28 11:38:46,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-28 11:38:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 11:38:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-11-28 11:38:46,614 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 29 [2018-11-28 11:38:46,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:46,615 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-28 11:38:46,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 11:38:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-28 11:38:46,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 11:38:46,616 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:46,616 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:46,616 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-11-28 11:38:46,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:46,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1776628289, now seen corresponding path program 1 times [2018-11-28 11:38:46,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:46,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:46,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:46,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:46,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:46,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:38:46,758 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:38:46,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:46,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:46,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:38:46,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:38:46,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:38:46,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:38:46,834 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,840 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-11-28 11:38:46,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:38:46,890 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:38:46,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 11:38:46,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 11:38:46,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-11-28 11:38:46,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-28 11:38:46,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-28 11:38:46,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:46,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-11-28 11:38:47,005 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-11-28 11:38:47,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:47,022 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-11-28 11:38:47,023 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:47,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:47,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:47,039 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-11-28 11:38:47,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-11-28 11:38:47,070 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-11-28 11:38:47,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:47,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-28 11:38:47,084 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:47,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-11-28 11:38:47,096 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:47,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:47,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-28 11:38:47,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-11-28 11:38:47,116 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:47,120 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:47,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:47,125 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-11-28 11:38:47,143 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:47,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:38:47,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2018-11-28 11:38:47,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 11:38:47,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 11:38:47,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-28 11:38:47,159 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 17 states. [2018-11-28 11:38:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:47,579 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-11-28 11:38:47,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 11:38:47,580 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-11-28 11:38:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:47,581 INFO L225 Difference]: With dead ends: 69 [2018-11-28 11:38:47,581 INFO L226 Difference]: Without dead ends: 69 [2018-11-28 11:38:47,581 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-11-28 11:38:47,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-28 11:38:47,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-28 11:38:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 11:38:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-28 11:38:47,584 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 29 [2018-11-28 11:38:47,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:47,584 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-28 11:38:47,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 11:38:47,584 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-28 11:38:47,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 11:38:47,585 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:47,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:47,585 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-11-28 11:38:47,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:47,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1871061536, now seen corresponding path program 1 times [2018-11-28 11:38:47,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:47,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:47,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:47,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:47,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:47,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:47,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:38:47,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:38:47,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:38:47,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:38:47,695 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 8 states. [2018-11-28 11:38:47,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:47,812 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-28 11:38:47,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:38:47,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-11-28 11:38:47,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:47,813 INFO L225 Difference]: With dead ends: 66 [2018-11-28 11:38:47,813 INFO L226 Difference]: Without dead ends: 66 [2018-11-28 11:38:47,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:38:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-28 11:38:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-28 11:38:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 11:38:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-11-28 11:38:47,816 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 29 [2018-11-28 11:38:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:47,816 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-11-28 11:38:47,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:38:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-28 11:38:47,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 11:38:47,821 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:47,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:47,821 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-11-28 11:38:47,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:47,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1871061535, now seen corresponding path program 1 times [2018-11-28 11:38:47,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:47,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:47,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:47,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:47,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:47,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:47,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:38:47,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:38:47,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:38:47,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:38:47,880 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 3 states. [2018-11-28 11:38:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:47,912 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-28 11:38:47,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:38:47,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 11:38:47,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:47,914 INFO L225 Difference]: With dead ends: 61 [2018-11-28 11:38:47,914 INFO L226 Difference]: Without dead ends: 61 [2018-11-28 11:38:47,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:38:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-28 11:38:47,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-28 11:38:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 11:38:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-11-28 11:38:47,916 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 29 [2018-11-28 11:38:47,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:47,917 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-11-28 11:38:47,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:38:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-28 11:38:47,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 11:38:47,917 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:47,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:47,918 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION]=== [2018-11-28 11:38:47,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:47,918 INFO L82 PathProgramCache]: Analyzing trace with hash -492861402, now seen corresponding path program 1 times [2018-11-28 11:38:47,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:38:47,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:38:47,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:47,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:47,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:38:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:38:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:38:47,956 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 11:38:47,968 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-11-28 11:38:47,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:38:47 BoogieIcfgContainer [2018-11-28 11:38:47,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:38:47,981 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:38:47,981 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:38:47,981 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:38:47,981 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:38:43" (3/4) ... [2018-11-28 11:38:47,986 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:38:47,987 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:38:47,987 INFO L168 Benchmark]: Toolchain (without parser) took 4968.09 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.0 MB). Free memory was 951.7 MB in the beginning and 1.2 GB in the end (delta: -199.8 MB). Peak memory consumption was 103.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:38:47,989 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:38:47,989 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:38:47,990 INFO L168 Benchmark]: Boogie Preprocessor took 36.06 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:38:47,990 INFO L168 Benchmark]: RCFGBuilder took 388.40 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: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:38:47,990 INFO L168 Benchmark]: TraceAbstraction took 4216.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -74.3 MB). Peak memory consumption was 77.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:38:47,991 INFO L168 Benchmark]: Witness Printer took 5.78 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:38:47,996 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.06 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 388.40 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: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4216.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -74.3 MB). Peak memory consumption was 77.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.78 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 633]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 633. Possible FailurePath: [L635] struct item *list = ((void *)0); VAL [list={10:0}] [L637] CALL append(&list) VAL [plist={10:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L627] item->next = *plist VAL [\read(**plist)={0:0}, item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L628] EXPR item->next VAL [item={13:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, item={13:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, item={13:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L631] *plist = item VAL [item={13:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L637] RET append(&list) VAL [list={10:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] \read(*list) VAL [\read(*list)={13:0}, list={10:0}] [L639] COND TRUE \read(*list) [L640] EXPR \read(*list) VAL [\read(*list)={13:0}, list={10:0}] [L640] EXPR list->next VAL [\read(*list)={13:0}, list={10:0}, list->next={0:0}] [L640] struct item *next = list->next; [L641] EXPR \read(*list) VAL [\read(*list)={13:0}, list={10:0}, next={0:0}] [L641] free(list) VAL [\read(*list)={13:0}, list={10:0}, next={0:0}] [L641] free(list) [L642] list = next VAL [list={10:0}, next={0:0}] [L644] \read(*list) VAL [\read(*list)={0:0}, list={10:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) [L649] return 0; [L635] struct item *list = ((void *)0); [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 85 locations, 39 error locations. UNSAFE Result, 4.1s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 729 SDtfs, 693 SDslu, 1688 SDs, 0 SdLazy, 2061 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.4s 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.5s 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-0cd3be1 [2018-11-28 11:38:49,422 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:38:49,423 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:38:49,431 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:38:49,431 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:38:49,432 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:38:49,433 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:38:49,434 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:38:49,435 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:38:49,435 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:38:49,436 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:38:49,436 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:38:49,437 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:38:49,438 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:38:49,439 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:38:49,439 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:38:49,440 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:38:49,441 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:38:49,442 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:38:49,443 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:38:49,444 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:38:49,445 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:38:49,446 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:38:49,447 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:38:49,447 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:38:49,447 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:38:49,448 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:38:49,448 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:38:49,449 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:38:49,450 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:38:49,450 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:38:49,451 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:38:49,451 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:38:49,451 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:38:49,452 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:38:49,452 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:38:49,452 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-11-28 11:38:49,463 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:38:49,463 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:38:49,463 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:38:49,464 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:38:49,464 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:38:49,464 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:38:49,464 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:38:49,464 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:38:49,465 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:38:49,465 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:38:49,465 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:38:49,465 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:38:49,465 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:38:49,465 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 11:38:49,465 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 11:38:49,465 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 11:38:49,465 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:38:49,466 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-28 11:38:49,466 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-28 11:38:49,466 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:38:49,466 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:38:49,466 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:38:49,466 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:38:49,466 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:38:49,466 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:38:49,467 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:38:49,467 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:38:49,467 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:38:49,467 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-28 11:38:49,467 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:38:49,467 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-28 11:38:49,467 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_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/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-11-28 11:38:49,494 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:38:49,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:38:49,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:38:49,507 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:38:49,507 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:38:49,508 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-11-28 11:38:49,553 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/data/ee86400c4/b20a954517e142ab9735592daaaaa136/FLAGbe7a182c7 [2018-11-28 11:38:49,879 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:38:49,880 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-11-28 11:38:49,890 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/data/ee86400c4/b20a954517e142ab9735592daaaaa136/FLAGbe7a182c7 [2018-11-28 11:38:49,901 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/data/ee86400c4/b20a954517e142ab9735592daaaaa136 [2018-11-28 11:38:49,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:38:49,904 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 11:38:49,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:38:49,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:38:49,908 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:38:49,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:38:49" (1/1) ... [2018-11-28 11:38:49,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1f34f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:49, skipping insertion in model container [2018-11-28 11:38:49,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:38:49" (1/1) ... [2018-11-28 11:38:49,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:38:49,943 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:38:50,154 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:38:50,161 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:38:50,228 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:38:50,262 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:38:50,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:50 WrapperNode [2018-11-28 11:38:50,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:38:50,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:38:50,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:38:50,264 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:38:50,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:50" (1/1) ... [2018-11-28 11:38:50,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:50" (1/1) ... [2018-11-28 11:38:50,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:50" (1/1) ... [2018-11-28 11:38:50,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:50" (1/1) ... [2018-11-28 11:38:50,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:50" (1/1) ... [2018-11-28 11:38:50,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:50" (1/1) ... [2018-11-28 11:38:50,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:50" (1/1) ... [2018-11-28 11:38:50,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:38:50,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:38:50,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:38:50,298 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:38:50,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:38:50,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:38:50,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:38:50,332 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-28 11:38:50,332 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:38:50,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 11:38:50,332 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 11:38:50,332 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 11:38:50,332 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 11:38:50,332 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 11:38:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 11:38:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 11:38:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 11:38:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 11:38:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 11:38:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 11:38:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 11:38:50,333 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 11:38:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 11:38:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 11:38:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 11:38:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 11:38:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 11:38:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 11:38:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 11:38:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 11:38:50,334 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 11:38:50,335 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 11:38:50,335 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 11:38:50,335 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 11:38:50,335 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 11:38:50,335 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 11:38:50,335 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 11:38:50,335 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 11:38:50,335 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 11:38:50,336 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 11:38:50,336 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 11:38:50,336 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 11:38:50,336 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 11:38:50,336 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 11:38:50,336 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 11:38:50,336 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 11:38:50,336 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 11:38:50,336 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 11:38:50,337 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 11:38:50,337 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 11:38:50,337 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 11:38:50,337 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 11:38:50,337 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 11:38:50,337 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 11:38:50,337 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 11:38:50,337 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 11:38:50,337 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 11:38:50,337 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 11:38:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 11:38:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 11:38:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 11:38:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 11:38:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 11:38:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 11:38:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 11:38:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 11:38:50,338 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 11:38:50,339 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 11:38:50,339 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 11:38:50,339 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 11:38:50,339 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 11:38:50,339 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 11:38:50,339 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 11:38:50,339 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 11:38:50,339 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 11:38:50,339 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 11:38:50,339 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 11:38:50,340 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 11:38:50,340 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 11:38:50,340 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 11:38:50,340 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 11:38:50,340 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 11:38:50,340 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 11:38:50,340 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 11:38:50,340 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 11:38:50,340 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 11:38:50,341 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 11:38:50,343 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 11:38:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 11:38:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 11:38:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 11:38:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 11:38:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 11:38:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 11:38:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 11:38:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 11:38:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 11:38:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 11:38:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 11:38:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 11:38:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 11:38:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 11:38:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 11:38:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 11:38:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 11:38:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 11:38:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 11:38:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 11:38:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 11:38:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 11:38:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 11:38:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 11:38:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-28 11:38:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:38:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 11:38:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 11:38:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:38:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 11:38:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:38:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:38:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:38:50,732 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:38:50,732 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 11:38:50,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:38:50 BoogieIcfgContainer [2018-11-28 11:38:50,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:38:50,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:38:50,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:38:50,736 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:38:50,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:38:49" (1/3) ... [2018-11-28 11:38:50,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2498932d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:38:50, skipping insertion in model container [2018-11-28 11:38:50,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:38:50" (2/3) ... [2018-11-28 11:38:50,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2498932d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:38:50, skipping insertion in model container [2018-11-28 11:38:50,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:38:50" (3/3) ... [2018-11-28 11:38:50,739 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-11-28 11:38:50,748 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:38:50,756 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-11-28 11:38:50,767 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-11-28 11:38:50,784 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:38:50,784 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:38:50,784 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 11:38:50,784 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:38:50,784 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:38:50,784 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:38:50,784 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:38:50,785 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:38:50,785 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:38:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-11-28 11:38:50,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 11:38:50,800 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:50,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:50,802 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 11:38:50,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:50,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1993923955, now seen corresponding path program 1 times [2018-11-28 11:38:50,808 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:38:50,809 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 11:38:50,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:50,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:50,862 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:38:50,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:50,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:38:50,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 11:38:50,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 11:38:50,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 11:38:50,877 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-11-28 11:38:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:50,890 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-11-28 11:38:50,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 11:38:50,891 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-11-28 11:38:50,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:50,897 INFO L225 Difference]: With dead ends: 84 [2018-11-28 11:38:50,898 INFO L226 Difference]: Without dead ends: 81 [2018-11-28 11:38:50,899 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-11-28 11:38:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-28 11:38:50,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-28 11:38:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-28 11:38:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2018-11-28 11:38:50,925 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 8 [2018-11-28 11:38:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:50,925 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2018-11-28 11:38:50,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 11:38:50,925 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-11-28 11:38:50,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 11:38:50,926 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:50,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:50,926 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 11:38:50,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:50,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1682195681, now seen corresponding path program 1 times [2018-11-28 11:38:50,927 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:38:50,927 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 11:38:50,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:50,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:50,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:38:50,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:50,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:50,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 11:38:51,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:38:51,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:38:51,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-11-28 11:38:51,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:51,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:51,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-11-28 11:38:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:51,053 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:38:51,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:51,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:38:51,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:38:51,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:38:51,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:38:51,059 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 5 states. [2018-11-28 11:38:51,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:51,430 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-11-28 11:38:51,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:38:51,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 11:38:51,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:51,431 INFO L225 Difference]: With dead ends: 73 [2018-11-28 11:38:51,432 INFO L226 Difference]: Without dead ends: 73 [2018-11-28 11:38:51,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:38:51,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-28 11:38:51,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-11-28 11:38:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 11:38:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-11-28 11:38:51,438 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 9 [2018-11-28 11:38:51,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:51,439 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-11-28 11:38:51,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:38:51,439 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-28 11:38:51,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 11:38:51,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:51,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:51,440 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 11:38:51,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:51,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1682195682, now seen corresponding path program 1 times [2018-11-28 11:38:51,440 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:38:51,440 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 11:38:51,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:51,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:51,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:38:51,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:51,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:38:51,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:51,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:51,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 11:38:51,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:38:51,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:38:51,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 11:38:51,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:51,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:38:51,579 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:38:51,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-28 11:38:51,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:51,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:51,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-11-28 11:38:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:51,608 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:38:51,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:51,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:38:51,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:38:51,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:38:51,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:38:51,611 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 5 states. [2018-11-28 11:38:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:51,893 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-11-28 11:38:51,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:38:51,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 11:38:51,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:51,896 INFO L225 Difference]: With dead ends: 89 [2018-11-28 11:38:51,896 INFO L226 Difference]: Without dead ends: 89 [2018-11-28 11:38:51,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:38:51,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-28 11:38:51,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-11-28 11:38:51,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 11:38:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-11-28 11:38:51,902 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 9 [2018-11-28 11:38:51,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:51,903 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-11-28 11:38:51,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:38:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-11-28 11:38:51,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 11:38:51,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:51,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:51,904 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 11:38:51,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:51,904 INFO L82 PathProgramCache]: Analyzing trace with hash 608458612, now seen corresponding path program 1 times [2018-11-28 11:38:51,904 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:38:51,904 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 11:38:51,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:51,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:51,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:38:51,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:51,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:51,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 11:38:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:51,975 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:38:51,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:51,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:38:51,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:38:51,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:38:51,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:38:51,978 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 3 states. [2018-11-28 11:38:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:52,056 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-11-28 11:38:52,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:38:52,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 11:38:52,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:52,058 INFO L225 Difference]: With dead ends: 74 [2018-11-28 11:38:52,058 INFO L226 Difference]: Without dead ends: 74 [2018-11-28 11:38:52,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:38:52,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-28 11:38:52,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-28 11:38:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 11:38:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-11-28 11:38:52,061 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 10 [2018-11-28 11:38:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:52,061 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-11-28 11:38:52,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:38:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-11-28 11:38:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 11:38:52,062 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:52,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:52,062 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 11:38:52,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:52,063 INFO L82 PathProgramCache]: Analyzing trace with hash 608458613, now seen corresponding path program 1 times [2018-11-28 11:38:52,063 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:38:52,063 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 11:38:52,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:52,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:52,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:38:52,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:52,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:52,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:38:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:52,123 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:38:52,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:52,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:38:52,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:38:52,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:38:52,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:38:52,125 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 3 states. [2018-11-28 11:38:52,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:52,193 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-28 11:38:52,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:38:52,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 11:38:52,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:52,194 INFO L225 Difference]: With dead ends: 70 [2018-11-28 11:38:52,194 INFO L226 Difference]: Without dead ends: 70 [2018-11-28 11:38:52,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:38:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-28 11:38:52,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-28 11:38:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-28 11:38:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-11-28 11:38:52,198 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 10 [2018-11-28 11:38:52,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:52,198 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-11-28 11:38:52,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:38:52,198 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-28 11:38:52,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 11:38:52,198 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:52,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:52,199 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 11:38:52,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:52,199 INFO L82 PathProgramCache]: Analyzing trace with hash 620506892, now seen corresponding path program 1 times [2018-11-28 11:38:52,199 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:38:52,199 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 11:38:52,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:52,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:52,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-28 11:38:52,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-28 11:38:52,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:52,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:52,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-28 11:38:52,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-11-28 11:38:52,414 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:52,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-28 11:38:52,446 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:52,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:52,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:52,463 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-11-28 11:38:52,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-28 11:38:52,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-28 11:38:52,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:52,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 11:38:52,520 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:52,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-11-28 11:38:52,535 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:52,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:52,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-28 11:38:52,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-28 11:38:52,562 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:52,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 11:38:52,582 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:52,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-11-28 11:38:52,594 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:52,597 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:52,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:52,600 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2018-11-28 11:38:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:52,611 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:38:52,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:52,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:38:52,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:38:52,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:38:52,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=38, Unknown=5, NotChecked=0, Total=56 [2018-11-28 11:38:52,614 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 8 states. [2018-11-28 11:38:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:53,065 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-11-28 11:38:53,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:38:53,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-28 11:38:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:53,066 INFO L225 Difference]: With dead ends: 78 [2018-11-28 11:38:53,066 INFO L226 Difference]: Without dead ends: 78 [2018-11-28 11:38:53,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=97, Unknown=13, NotChecked=0, Total=156 [2018-11-28 11:38:53,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-28 11:38:53,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-28 11:38:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 11:38:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-11-28 11:38:53,072 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 15 [2018-11-28 11:38:53,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:53,073 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-11-28 11:38:53,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:38:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-11-28 11:38:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 11:38:53,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:53,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:53,073 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 11:38:53,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:53,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2056122585, now seen corresponding path program 1 times [2018-11-28 11:38:53,074 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:38:53,074 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 11:38:53,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:53,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:53,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:38:53,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-28 11:38:53,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:53,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:38:53,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:38:53,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:38:53,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:53,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:53,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-11-28 11:38:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:53,229 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:38:53,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:53,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:38:53,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:38:53,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:38:53,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:53,234 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 7 states. [2018-11-28 11:38:53,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:53,555 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-11-28 11:38:53,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:38:53,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-28 11:38:53,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:53,556 INFO L225 Difference]: With dead ends: 78 [2018-11-28 11:38:53,556 INFO L226 Difference]: Without dead ends: 78 [2018-11-28 11:38:53,556 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-11-28 11:38:53,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-28 11:38:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-28 11:38:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 11:38:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-11-28 11:38:53,560 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 16 [2018-11-28 11:38:53,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:53,560 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-11-28 11:38:53,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:38:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-11-28 11:38:53,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 11:38:53,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:53,561 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-11-28 11:38:53,561 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 11:38:53,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:53,562 INFO L82 PathProgramCache]: Analyzing trace with hash -811500198, now seen corresponding path program 1 times [2018-11-28 11:38:53,562 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:38:53,562 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 11:38:53,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:53,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:53,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:38:53,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:53,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:53,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-11-28 11:38:53,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:38:53,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:38:53,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:53,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:53,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:53,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-28 11:38:53,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 11:38:53,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-28 11:38:53,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:53,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:53,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:53,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-11-28 11:38:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:53,693 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:38:53,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:53,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:38:53,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:38:53,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:38:53,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:38:53,695 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 8 states. [2018-11-28 11:38:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:53,997 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-28 11:38:53,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:38:53,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-28 11:38:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:53,998 INFO L225 Difference]: With dead ends: 84 [2018-11-28 11:38:53,998 INFO L226 Difference]: Without dead ends: 84 [2018-11-28 11:38:53,998 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-11-28 11:38:53,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-28 11:38:54,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2018-11-28 11:38:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 11:38:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-11-28 11:38:54,001 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 23 [2018-11-28 11:38:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:54,001 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-11-28 11:38:54,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:38:54,001 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-11-28 11:38:54,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 11:38:54,002 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:54,002 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-11-28 11:38:54,002 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 11:38:54,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:54,002 INFO L82 PathProgramCache]: Analyzing trace with hash -811500197, now seen corresponding path program 1 times [2018-11-28 11:38:54,003 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:38:54,003 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 11:38:54,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:54,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:54,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:38:54,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:38:54,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:38:54,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:38:54,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,143 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-11-28 11:38:54,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 11:38:54,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 11:38:54,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-28 11:38:54,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 11:38:54,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,193 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,197 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-11-28 11:38:54,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:54,212 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:38:54,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:54,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:38:54,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:38:54,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:38:54,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:38:54,214 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 8 states. [2018-11-28 11:38:54,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:54,534 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-11-28 11:38:54,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:38:54,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-28 11:38:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:54,535 INFO L225 Difference]: With dead ends: 86 [2018-11-28 11:38:54,535 INFO L226 Difference]: Without dead ends: 86 [2018-11-28 11:38:54,535 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-11-28 11:38:54,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-28 11:38:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2018-11-28 11:38:54,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 11:38:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-11-28 11:38:54,539 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 23 [2018-11-28 11:38:54,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:54,540 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-11-28 11:38:54,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:38:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-11-28 11:38:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 11:38:54,540 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:54,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:54,541 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 11:38:54,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:54,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1850615088, now seen corresponding path program 1 times [2018-11-28 11:38:54,541 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:38:54,541 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 11:38:54,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:54,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:54,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:38:54,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:38:54,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-28 11:38:54,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-28 11:38:54,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-28 11:38:54,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-28 11:38:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:54,684 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:38:54,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:54,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:38:54,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:38:54,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:38:54,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:54,687 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 7 states. [2018-11-28 11:38:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:54,872 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-28 11:38:54,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:38:54,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-28 11:38:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:54,874 INFO L225 Difference]: With dead ends: 70 [2018-11-28 11:38:54,874 INFO L226 Difference]: Without dead ends: 70 [2018-11-28 11:38:54,874 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-11-28 11:38:54,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-28 11:38:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-28 11:38:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-28 11:38:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-11-28 11:38:54,877 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 25 [2018-11-28 11:38:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:54,877 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-11-28 11:38:54,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:38:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-28 11:38:54,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 11:38:54,878 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:54,878 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-11-28 11:38:54,878 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 11:38:54,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:54,878 INFO L82 PathProgramCache]: Analyzing trace with hash 968508614, now seen corresponding path program 1 times [2018-11-28 11:38:54,879 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:38:54,879 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 11:38:54,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:54,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:54,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:38:54,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:38:54,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:54,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-28 11:38:54,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 11:38:55,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 11:38:55,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-28 11:38:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:55,024 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:38:55,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:55,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:38:55,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:38:55,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:38:55,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:38:55,030 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 7 states. [2018-11-28 11:38:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:55,184 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-28 11:38:55,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:38:55,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-28 11:38:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:55,185 INFO L225 Difference]: With dead ends: 69 [2018-11-28 11:38:55,185 INFO L226 Difference]: Without dead ends: 69 [2018-11-28 11:38:55,185 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-11-28 11:38:55,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-28 11:38:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-28 11:38:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 11:38:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2018-11-28 11:38:55,188 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 26 [2018-11-28 11:38:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:55,188 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2018-11-28 11:38:55,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:38:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-11-28 11:38:55,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 11:38:55,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:55,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:38:55,189 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 11:38:55,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:55,189 INFO L82 PathProgramCache]: Analyzing trace with hash -41003973, now seen corresponding path program 1 times [2018-11-28 11:38:55,189 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:38:55,189 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 11:38:55,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:55,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:55,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:38:55,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-11-28 11:38:55,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:38:55,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:38:55,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-28 11:38:55,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 11:38:55,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-28 11:38:55,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-11-28 11:38:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:55,344 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:38:55,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:38:55,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:38:55,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:38:55,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:38:55,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:38:55,347 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 8 states. [2018-11-28 11:38:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:55,568 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-28 11:38:55,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:38:55,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-28 11:38:55,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:55,569 INFO L225 Difference]: With dead ends: 68 [2018-11-28 11:38:55,569 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 11:38:55,569 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-11-28 11:38:55,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 11:38:55,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-28 11:38:55,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 11:38:55,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-11-28 11:38:55,571 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 27 [2018-11-28 11:38:55,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:55,571 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-11-28 11:38:55,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:38:55,571 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-28 11:38:55,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 11:38:55,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:55,572 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-11-28 11:38:55,572 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 11:38:55,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:55,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1918400567, now seen corresponding path program 1 times [2018-11-28 11:38:55,573 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:38:55,573 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 11:38:55,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:55,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:55,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:38:55,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-11-28 11:38:55,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:38:55,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:38:55,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-28 11:38:55,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 11:38:55,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2018-11-28 11:38:55,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-28 11:38:55,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-28 11:38:55,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:55,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2018-11-28 11:38:55,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-11-28 11:38:55,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-11-28 11:38:55,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-11-28 11:38:55,897 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-11-28 11:38:55,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:55,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:55,926 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2018-11-28 11:38:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:55,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 11:38:56,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-28 11:38:56,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-28 11:38:56,105 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:56,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:56,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-28 11:38:56,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:50 [2018-11-28 11:38:56,190 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-11-28 11:38:56,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:56,202 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-11-28 11:38:56,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:56,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:38:56,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-11-28 11:38:56,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-11-28 11:38:56,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:56,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-11-28 11:38:56,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:56,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:38:56,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2018-11-28 11:38:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:56,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:38:56,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-11-28 11:38:56,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 11:38:56,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 11:38:56,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-28 11:38:56,236 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 17 states. [2018-11-28 11:38:57,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:38:57,087 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-28 11:38:57,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:38:57,088 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-11-28 11:38:57,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:38:57,088 INFO L225 Difference]: With dead ends: 72 [2018-11-28 11:38:57,088 INFO L226 Difference]: Without dead ends: 72 [2018-11-28 11:38:57,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-11-28 11:38:57,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-28 11:38:57,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2018-11-28 11:38:57,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 11:38:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-28 11:38:57,091 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 28 [2018-11-28 11:38:57,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:38:57,091 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-28 11:38:57,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 11:38:57,091 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-28 11:38:57,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 11:38:57,092 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:38:57,092 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-11-28 11:38:57,092 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 11:38:57,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:38:57,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1918400566, now seen corresponding path program 1 times [2018-11-28 11:38:57,093 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:38:57,093 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 11:38:57,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:38:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:38:57,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:38:57,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:38:57,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:38:57,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-11-28 11:38:57,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:38:57,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 11:38:57,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:38:57,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:38:57,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:38:57,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:57,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-11-28 11:38:57,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:38:57,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:38:57,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:38:57,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:38:57,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,402 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:57,417 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:43 [2018-11-28 11:38:57,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:38:57,526 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-11-28 11:38:57,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:38:57,548 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:38:57,548 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-11-28 11:38:57,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:57,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:46 [2018-11-28 11:38:57,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-28 11:38:57,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-28 11:38:57,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,779 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-11-28 11:38:57,784 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-11-28 11:38:57,784 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,818 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-11-28 11:38:57,818 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:57,844 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2018-11-28 11:38:57,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-28 11:38:57,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-28 11:38:57,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-11-28 11:38:57,907 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,937 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-11-28 11:38:57,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-28 11:38:57,941 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,962 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-11-28 11:38:57,962 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-11-28 11:38:57,982 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,989 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:57,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:57,995 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:68, output treesize:18 [2018-11-28 11:38:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:38:58,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 11:38:59,023 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-11-28 11:38:59,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-28 11:38:59,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 11:38:59,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:59,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:59,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-28 11:38:59,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 11:38:59,045 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:59,050 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:59,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-28 11:38:59,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 11:38:59,056 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:59,060 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:59,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-11-28 11:38:59,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-28 11:38:59,207 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:59,210 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:59,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-11-28 11:38:59,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-28 11:38:59,214 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:38:59,217 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:38:59,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-28 11:38:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-28 11:38:59,330 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:59,341 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:59,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-28 11:38:59,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-28 11:38:59,347 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:59,356 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:59,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-28 11:38:59,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-28 11:38:59,474 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:59,483 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:59,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-28 11:38:59,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-28 11:38:59,489 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:59,499 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:38:59,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 13 dim-0 vars, and 9 xjuncts. [2018-11-28 11:38:59,615 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2018-11-28 11:38:59,929 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2018-11-28 11:38:59,935 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:38:59,936 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:38:59,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-28 11:38:59,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:39:00,011 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:39:00,011 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:39:00,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-28 11:39:00,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:39:00,065 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:39:00,065 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:39:00,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-28 11:39:00,066 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:39:00,113 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:39:00,114 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:39:00,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-28 11:39:00,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:39:00,160 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:39:00,161 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:39:00,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-28 11:39:00,162 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:39:00,206 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-11-28 11:39:00,207 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:94, output treesize:33 [2018-11-28 11:39:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:39:00,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:39:00,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-11-28 11:39:00,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 11:39:00,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 11:39:00,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-11-28 11:39:00,550 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 21 states. [2018-11-28 11:39:02,204 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 56 [2018-11-28 11:39:07,016 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2018-11-28 11:39:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:39:07,471 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-28 11:39:07,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:39:07,472 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-11-28 11:39:07,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:39:07,473 INFO L225 Difference]: With dead ends: 68 [2018-11-28 11:39:07,473 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 11:39:07,473 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-11-28 11:39:07,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 11:39:07,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-11-28 11:39:07,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 11:39:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-11-28 11:39:07,475 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 28 [2018-11-28 11:39:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:39:07,476 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-11-28 11:39:07,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 11:39:07,476 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-28 11:39:07,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 11:39:07,476 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:39:07,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:39:07,477 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 11:39:07,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:39:07,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1271123095, now seen corresponding path program 1 times [2018-11-28 11:39:07,477 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:39:07,477 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 11:39:07,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:39:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:39:07,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:39:07,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:39:07,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:39:07,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:39:07,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 11:39:07,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:39:07,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:39:07,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:39:07,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2018-11-28 11:39:07,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:39:07,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:39:07,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:39:07,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:39:07,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:39:07,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-28 11:39:07,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:39:07,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:39:07,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 11:39:07,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:39:07,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:39:07,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-28 11:39:07,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-28 11:39:07,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-28 11:39:07,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:39:07,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:39:07,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:39:07,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-11-28 11:39:07,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:39:07,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 11:39:07,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:39:07,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:39:07,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-11-28 11:39:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:39:07,691 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:39:07,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:39:07,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:39:07,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 11:39:07,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:39:07,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:39:07,693 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 9 states. [2018-11-28 11:39:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:39:10,035 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-11-28 11:39:10,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:39:10,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-28 11:39:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:39:10,036 INFO L225 Difference]: With dead ends: 81 [2018-11-28 11:39:10,036 INFO L226 Difference]: Without dead ends: 81 [2018-11-28 11:39:10,036 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-11-28 11:39:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-28 11:39:10,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2018-11-28 11:39:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 11:39:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-11-28 11:39:10,039 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 28 [2018-11-28 11:39:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:39:10,039 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-11-28 11:39:10,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 11:39:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-11-28 11:39:10,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 11:39:10,039 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:39:10,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:39:10,040 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 11:39:10,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:39:10,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1271123094, now seen corresponding path program 1 times [2018-11-28 11:39:10,040 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:39:10,040 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 11:39:10,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:39:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:39:10,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:39:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:39:10,114 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 11:39:10,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:39:10,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:39:10,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:39:10,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:39:10,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:39:10,117 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 3 states. [2018-11-28 11:39:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:39:10,208 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-28 11:39:10,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:39:10,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 11:39:10,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:39:10,209 INFO L225 Difference]: With dead ends: 60 [2018-11-28 11:39:10,209 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 11:39:10,210 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-11-28 11:39:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 11:39:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-28 11:39:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 11:39:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-28 11:39:10,211 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 28 [2018-11-28 11:39:10,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:39:10,212 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-28 11:39:10,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:39:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-28 11:39:10,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 11:39:10,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:39:10,213 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-11-28 11:39:10,213 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-28 11:39:10,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:39:10,213 INFO L82 PathProgramCache]: Analyzing trace with hash 179927279, now seen corresponding path program 1 times [2018-11-28 11:39:10,214 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 11:39:10,214 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e130be9a-66c6-4db6-bb9f-0e1fcf7a5ddc/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-11-28 11:39:10,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:39:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:39:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:39:10,492 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 11:39:10,502 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-11-28 11:39:10,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:39:10 BoogieIcfgContainer [2018-11-28 11:39:10,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:39:10,515 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:39:10,515 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:39:10,515 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:39:10,516 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:38:50" (3/4) ... [2018-11-28 11:39:10,521 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:39:10,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:39:10,521 INFO L168 Benchmark]: Toolchain (without parser) took 20617.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -120.9 MB). Peak memory consumption was 195.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:39:10,522 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-11-28 11:39:10,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -205.4 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:39:10,522 INFO L168 Benchmark]: Boogie Preprocessor took 34.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:39:10,522 INFO L168 Benchmark]: RCFGBuilder took 434.40 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: 59.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:39:10,523 INFO L168 Benchmark]: TraceAbstraction took 19781.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.3 MB). Peak memory consumption was 179.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:39:10,523 INFO L168 Benchmark]: Witness Printer took 5.78 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-11-28 11:39:10,524 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 358.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -205.4 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.43 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 434.40 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: 59.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19781.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.3 MB). Peak memory consumption was 179.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.78 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, 19.7s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 13.0s 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.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 261 SyntacticMatches, 3 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 52 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.1s 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...