./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/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 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/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 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 04:45:43,543 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:45:43,545 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:45:43,555 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:45:43,555 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:45:43,556 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:45:43,557 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:45:43,558 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:45:43,560 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:45:43,560 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:45:43,561 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:45:43,561 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:45:43,562 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:45:43,562 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:45:43,563 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:45:43,564 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:45:43,564 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:45:43,565 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:45:43,567 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:45:43,568 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:45:43,569 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:45:43,570 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:45:43,571 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:45:43,572 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:45:43,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:45:43,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:45:43,573 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:45:43,574 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:45:43,575 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:45:43,575 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:45:43,576 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:45:43,576 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:45:43,576 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:45:43,576 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:45:43,582 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:45:43,583 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:45:43,583 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-27 04:45:43,593 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:45:43,594 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:45:43,595 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 04:45:43,595 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 04:45:43,595 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 04:45:43,595 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:45:43,595 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 04:45:43,595 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 04:45:43,596 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:45:43,596 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 04:45:43,596 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:45:43,596 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-27 04:45:43,596 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-27 04:45:43,596 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-27 04:45:43,596 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:45:43,597 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 04:45:43,597 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:45:43,597 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:45:43,597 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:45:43,597 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:45:43,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:45:43,597 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:45:43,598 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:45:43,598 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 04:45:43,598 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:45:43,598 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_0293f65a-a5ad-4f02-8144-f324403cffc3/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 -> 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c [2018-10-27 04:45:43,624 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:45:43,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:45:43,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:45:43,638 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:45:43,638 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:45:43,639 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i [2018-10-27 04:45:43,683 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/data/d7540062b/b77831fd37d9489c961ebc80307502c6/FLAG70602612f [2018-10-27 04:45:44,124 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:45:44,127 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i [2018-10-27 04:45:44,138 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/data/d7540062b/b77831fd37d9489c961ebc80307502c6/FLAG70602612f [2018-10-27 04:45:44,150 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/data/d7540062b/b77831fd37d9489c961ebc80307502c6 [2018-10-27 04:45:44,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:45:44,155 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 04:45:44,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:45:44,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:45:44,162 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:45:44,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:45:44" (1/1) ... [2018-10-27 04:45:44,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@557e7714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:44, skipping insertion in model container [2018-10-27 04:45:44,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:45:44" (1/1) ... [2018-10-27 04:45:44,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:45:44,220 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:45:44,445 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:45:44,452 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:45:44,517 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:45:44,552 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:45:44,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:44 WrapperNode [2018-10-27 04:45:44,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:45:44,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:45:44,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:45:44,553 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:45:44,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:44" (1/1) ... [2018-10-27 04:45:44,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:44" (1/1) ... [2018-10-27 04:45:44,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:44" (1/1) ... [2018-10-27 04:45:44,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:44" (1/1) ... [2018-10-27 04:45:44,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:44" (1/1) ... [2018-10-27 04:45:44,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:44" (1/1) ... [2018-10-27 04:45:44,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:44" (1/1) ... [2018-10-27 04:45:44,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:45:44,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:45:44,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:45:44,673 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:45:44,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/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-10-27 04:45:44,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:45:44,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:45:44,719 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-10-27 04:45:44,719 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-10-27 04:45:44,719 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2018-10-27 04:45:44,719 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2018-10-27 04:45:44,719 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-10-27 04:45:44,719 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:45:44,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-27 04:45:44,719 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-10-27 04:45:44,720 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-10-27 04:45:44,720 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-10-27 04:45:44,720 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-10-27 04:45:44,720 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-10-27 04:45:44,720 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-10-27 04:45:44,720 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-10-27 04:45:44,720 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-10-27 04:45:44,720 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-10-27 04:45:44,720 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-10-27 04:45:44,721 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-10-27 04:45:44,721 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-10-27 04:45:44,721 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-10-27 04:45:44,721 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-10-27 04:45:44,721 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-10-27 04:45:44,721 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-10-27 04:45:44,721 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-10-27 04:45:44,721 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-10-27 04:45:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-10-27 04:45:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-10-27 04:45:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-10-27 04:45:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-10-27 04:45:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-10-27 04:45:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-10-27 04:45:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-10-27 04:45:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-10-27 04:45:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-10-27 04:45:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-10-27 04:45:44,723 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-10-27 04:45:44,723 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-10-27 04:45:44,723 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-10-27 04:45:44,723 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-10-27 04:45:44,723 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-10-27 04:45:44,723 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-10-27 04:45:44,723 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-10-27 04:45:44,723 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-10-27 04:45:44,723 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-10-27 04:45:44,723 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-10-27 04:45:44,723 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-10-27 04:45:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-10-27 04:45:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-10-27 04:45:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-10-27 04:45:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-10-27 04:45:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-10-27 04:45:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-10-27 04:45:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-10-27 04:45:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-10-27 04:45:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-10-27 04:45:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-10-27 04:45:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-10-27 04:45:44,725 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-10-27 04:45:44,725 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-10-27 04:45:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-27 04:45:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-10-27 04:45:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-10-27 04:45:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-10-27 04:45:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-10-27 04:45:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-10-27 04:45:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-10-27 04:45:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-10-27 04:45:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-10-27 04:45:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-10-27 04:45:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-10-27 04:45:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-10-27 04:45:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-10-27 04:45:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-27 04:45:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-10-27 04:45:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-10-27 04:45:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-10-27 04:45:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-10-27 04:45:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-10-27 04:45:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-10-27 04:45:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-10-27 04:45:44,728 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-10-27 04:45:44,728 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-10-27 04:45:44,728 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-10-27 04:45:44,728 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-10-27 04:45:44,728 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-10-27 04:45:44,728 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-10-27 04:45:44,728 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-10-27 04:45:44,728 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-10-27 04:45:44,728 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-10-27 04:45:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-10-27 04:45:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-10-27 04:45:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-10-27 04:45:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-10-27 04:45:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-10-27 04:45:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-10-27 04:45:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-10-27 04:45:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-10-27 04:45:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-10-27 04:45:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-10-27 04:45:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-10-27 04:45:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-10-27 04:45:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-10-27 04:45:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-10-27 04:45:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-10-27 04:45:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-10-27 04:45:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-10-27 04:45:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-10-27 04:45:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-10-27 04:45:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-10-27 04:45:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-10-27 04:45:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-10-27 04:45:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-10-27 04:45:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-27 04:45:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2018-10-27 04:45:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-27 04:45:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 04:45:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-27 04:45:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-27 04:45:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 04:45:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2018-10-27 04:45:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-27 04:45:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-10-27 04:45:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:45:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:45:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:45:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-10-27 04:45:46,296 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:45:46,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:45:46 BoogieIcfgContainer [2018-10-27 04:45:46,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:45:46,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:45:46,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:45:46,299 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:45:46,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:45:44" (1/3) ... [2018-10-27 04:45:46,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b12d490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:45:46, skipping insertion in model container [2018-10-27 04:45:46,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:44" (2/3) ... [2018-10-27 04:45:46,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b12d490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:45:46, skipping insertion in model container [2018-10-27 04:45:46,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:45:46" (3/3) ... [2018-10-27 04:45:46,303 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02_false-valid-memtrack.i [2018-10-27 04:45:46,309 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:45:46,315 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations. [2018-10-27 04:45:46,326 INFO L257 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2018-10-27 04:45:46,345 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 04:45:46,346 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:45:46,346 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-27 04:45:46,346 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:45:46,346 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:45:46,347 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:45:46,347 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:45:46,347 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:45:46,347 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:45:46,366 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states. [2018-10-27 04:45:46,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-27 04:45:46,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:46,375 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:46,377 INFO L424 AbstractCegarLoop]: === Iteration 1 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:45:46,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:46,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1761481063, now seen corresponding path program 1 times [2018-10-27 04:45:46,386 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:46,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:46,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:46,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:46,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:46,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:46,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:45:46,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:45:46,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:45:46,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:45:46,545 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 3 states. [2018-10-27 04:45:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:46,898 INFO L93 Difference]: Finished difference Result 216 states and 228 transitions. [2018-10-27 04:45:46,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:45:46,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-27 04:45:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:46,908 INFO L225 Difference]: With dead ends: 216 [2018-10-27 04:45:46,909 INFO L226 Difference]: Without dead ends: 213 [2018-10-27 04:45:46,910 INFO L605 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-10-27 04:45:46,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-27 04:45:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-10-27 04:45:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-27 04:45:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 225 transitions. [2018-10-27 04:45:46,951 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 225 transitions. Word has length 7 [2018-10-27 04:45:46,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:46,952 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 225 transitions. [2018-10-27 04:45:46,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:45:46,952 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 225 transitions. [2018-10-27 04:45:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-27 04:45:46,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:46,953 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:46,953 INFO L424 AbstractCegarLoop]: === Iteration 2 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:45:46,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:46,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1761481062, now seen corresponding path program 1 times [2018-10-27 04:45:46,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:46,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:46,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:46,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:46,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:47,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:47,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:45:47,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:45:47,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:45:47,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:45:47,041 INFO L87 Difference]: Start difference. First operand 213 states and 225 transitions. Second operand 3 states. [2018-10-27 04:45:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:47,341 INFO L93 Difference]: Finished difference Result 214 states and 227 transitions. [2018-10-27 04:45:47,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:45:47,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-27 04:45:47,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:47,346 INFO L225 Difference]: With dead ends: 214 [2018-10-27 04:45:47,346 INFO L226 Difference]: Without dead ends: 214 [2018-10-27 04:45:47,347 INFO L605 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-10-27 04:45:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-27 04:45:47,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-10-27 04:45:47,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-27 04:45:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 224 transitions. [2018-10-27 04:45:47,362 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 224 transitions. Word has length 7 [2018-10-27 04:45:47,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:47,363 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 224 transitions. [2018-10-27 04:45:47,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:45:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 224 transitions. [2018-10-27 04:45:47,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 04:45:47,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:47,363 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:47,364 INFO L424 AbstractCegarLoop]: === Iteration 3 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:45:47,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:47,364 INFO L82 PathProgramCache]: Analyzing trace with hash -539885894, now seen corresponding path program 1 times [2018-10-27 04:45:47,364 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:47,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:47,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:47,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:47,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:47,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:45:47,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:45:47,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:45:47,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:45:47,488 INFO L87 Difference]: Start difference. First operand 212 states and 224 transitions. Second operand 7 states. [2018-10-27 04:45:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:48,147 INFO L93 Difference]: Finished difference Result 232 states and 248 transitions. [2018-10-27 04:45:48,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:45:48,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-10-27 04:45:48,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:48,149 INFO L225 Difference]: With dead ends: 232 [2018-10-27 04:45:48,149 INFO L226 Difference]: Without dead ends: 232 [2018-10-27 04:45:48,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:45:48,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-27 04:45:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 221. [2018-10-27 04:45:48,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-27 04:45:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 236 transitions. [2018-10-27 04:45:48,159 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 236 transitions. Word has length 14 [2018-10-27 04:45:48,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:48,160 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 236 transitions. [2018-10-27 04:45:48,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:45:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 236 transitions. [2018-10-27 04:45:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 04:45:48,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:48,162 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:48,163 INFO L424 AbstractCegarLoop]: === Iteration 4 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:45:48,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:48,163 INFO L82 PathProgramCache]: Analyzing trace with hash 443406682, now seen corresponding path program 1 times [2018-10-27 04:45:48,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:48,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:48,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:48,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:48,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:48,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:48,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:48,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:48,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:48,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:48,215 INFO L87 Difference]: Start difference. First operand 221 states and 236 transitions. Second operand 4 states. [2018-10-27 04:45:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:48,378 INFO L93 Difference]: Finished difference Result 219 states and 233 transitions. [2018-10-27 04:45:48,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:45:48,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-27 04:45:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:48,382 INFO L225 Difference]: With dead ends: 219 [2018-10-27 04:45:48,382 INFO L226 Difference]: Without dead ends: 219 [2018-10-27 04:45:48,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:48,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-27 04:45:48,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-10-27 04:45:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-27 04:45:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 233 transitions. [2018-10-27 04:45:48,389 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 233 transitions. Word has length 15 [2018-10-27 04:45:48,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:48,389 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 233 transitions. [2018-10-27 04:45:48,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:48,389 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 233 transitions. [2018-10-27 04:45:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 04:45:48,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:48,390 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:48,390 INFO L424 AbstractCegarLoop]: === Iteration 5 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:45:48,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:48,391 INFO L82 PathProgramCache]: Analyzing trace with hash 443406683, now seen corresponding path program 1 times [2018-10-27 04:45:48,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:48,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:48,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:48,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:48,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:48,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:48,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:48,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:48,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:48,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:48,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:48,436 INFO L87 Difference]: Start difference. First operand 219 states and 233 transitions. Second operand 4 states. [2018-10-27 04:45:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:48,596 INFO L93 Difference]: Finished difference Result 217 states and 230 transitions. [2018-10-27 04:45:48,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:45:48,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-27 04:45:48,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:48,598 INFO L225 Difference]: With dead ends: 217 [2018-10-27 04:45:48,598 INFO L226 Difference]: Without dead ends: 217 [2018-10-27 04:45:48,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:48,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-27 04:45:48,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-10-27 04:45:48,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-27 04:45:48,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 230 transitions. [2018-10-27 04:45:48,615 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 230 transitions. Word has length 15 [2018-10-27 04:45:48,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:48,615 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 230 transitions. [2018-10-27 04:45:48,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 230 transitions. [2018-10-27 04:45:48,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 04:45:48,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:48,616 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:48,616 INFO L424 AbstractCegarLoop]: === Iteration 6 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:45:48,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:48,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1424275787, now seen corresponding path program 1 times [2018-10-27 04:45:48,616 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:48,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:48,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:48,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:48,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:48,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:48,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-27 04:45:48,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 04:45:48,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 04:45:48,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:45:48,945 INFO L87 Difference]: Start difference. First operand 217 states and 230 transitions. Second operand 13 states. [2018-10-27 04:45:50,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:50,570 INFO L93 Difference]: Finished difference Result 219 states and 233 transitions. [2018-10-27 04:45:50,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:45:50,571 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-10-27 04:45:50,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:50,572 INFO L225 Difference]: With dead ends: 219 [2018-10-27 04:45:50,572 INFO L226 Difference]: Without dead ends: 219 [2018-10-27 04:45:50,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:45:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-27 04:45:50,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2018-10-27 04:45:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-27 04:45:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 231 transitions. [2018-10-27 04:45:50,579 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 231 transitions. Word has length 20 [2018-10-27 04:45:50,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:50,579 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 231 transitions. [2018-10-27 04:45:50,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 04:45:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 231 transitions. [2018-10-27 04:45:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-27 04:45:50,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:50,580 INFO L375 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] [2018-10-27 04:45:50,580 INFO L424 AbstractCegarLoop]: === Iteration 7 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:45:50,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:50,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1371548356, now seen corresponding path program 1 times [2018-10-27 04:45:50,581 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:50,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:50,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:50,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:50,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:50,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:50,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:50,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:45:50,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:50,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:50,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:50,620 INFO L87 Difference]: Start difference. First operand 218 states and 231 transitions. Second operand 4 states. [2018-10-27 04:45:50,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:50,655 INFO L93 Difference]: Finished difference Result 306 states and 323 transitions. [2018-10-27 04:45:50,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:45:50,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-10-27 04:45:50,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:50,660 INFO L225 Difference]: With dead ends: 306 [2018-10-27 04:45:50,660 INFO L226 Difference]: Without dead ends: 306 [2018-10-27 04:45:50,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:50,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-10-27 04:45:50,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 270. [2018-10-27 04:45:50,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-27 04:45:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 323 transitions. [2018-10-27 04:45:50,665 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 323 transitions. Word has length 22 [2018-10-27 04:45:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:50,665 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 323 transitions. [2018-10-27 04:45:50,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 323 transitions. [2018-10-27 04:45:50,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 04:45:50,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:50,666 INFO L375 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-10-27 04:45:50,666 INFO L424 AbstractCegarLoop]: === Iteration 8 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:45:50,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:50,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1050767942, now seen corresponding path program 1 times [2018-10-27 04:45:50,667 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:50,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:50,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:50,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:50,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:50,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:50,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:50,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:50,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:50,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:50,752 INFO L87 Difference]: Start difference. First operand 270 states and 323 transitions. Second operand 4 states. [2018-10-27 04:45:50,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:50,865 INFO L93 Difference]: Finished difference Result 283 states and 329 transitions. [2018-10-27 04:45:50,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:45:50,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-10-27 04:45:50,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:50,867 INFO L225 Difference]: With dead ends: 283 [2018-10-27 04:45:50,867 INFO L226 Difference]: Without dead ends: 283 [2018-10-27 04:45:50,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:50,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-27 04:45:50,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 272. [2018-10-27 04:45:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-27 04:45:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 321 transitions. [2018-10-27 04:45:50,881 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 321 transitions. Word has length 26 [2018-10-27 04:45:50,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:50,882 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 321 transitions. [2018-10-27 04:45:50,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:50,882 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 321 transitions. [2018-10-27 04:45:50,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 04:45:50,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:50,882 INFO L375 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-10-27 04:45:50,883 INFO L424 AbstractCegarLoop]: === Iteration 9 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:45:50,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:50,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1050767943, now seen corresponding path program 1 times [2018-10-27 04:45:50,883 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:50,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:50,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:50,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:50,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:50,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:50,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:45:50,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:50,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:50,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:50,969 INFO L87 Difference]: Start difference. First operand 272 states and 321 transitions. Second operand 5 states. [2018-10-27 04:45:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:51,302 INFO L93 Difference]: Finished difference Result 295 states and 337 transitions. [2018-10-27 04:45:51,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:45:51,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-10-27 04:45:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:51,307 INFO L225 Difference]: With dead ends: 295 [2018-10-27 04:45:51,308 INFO L226 Difference]: Without dead ends: 295 [2018-10-27 04:45:51,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:45:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-27 04:45:51,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 273. [2018-10-27 04:45:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-27 04:45:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 315 transitions. [2018-10-27 04:45:51,318 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 315 transitions. Word has length 26 [2018-10-27 04:45:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:51,319 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 315 transitions. [2018-10-27 04:45:51,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 315 transitions. [2018-10-27 04:45:51,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 04:45:51,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:51,321 INFO L375 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-10-27 04:45:51,321 INFO L424 AbstractCegarLoop]: === Iteration 10 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:45:51,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:51,321 INFO L82 PathProgramCache]: Analyzing trace with hash 434626540, now seen corresponding path program 1 times [2018-10-27 04:45:51,321 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:51,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:51,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:51,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:51,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:51,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:51,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:45:51,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:51,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:51,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:51,392 INFO L87 Difference]: Start difference. First operand 273 states and 315 transitions. Second operand 5 states. [2018-10-27 04:45:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:51,605 INFO L93 Difference]: Finished difference Result 282 states and 321 transitions. [2018-10-27 04:45:51,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:45:51,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-10-27 04:45:51,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:51,608 INFO L225 Difference]: With dead ends: 282 [2018-10-27 04:45:51,608 INFO L226 Difference]: Without dead ends: 282 [2018-10-27 04:45:51,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:45:51,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-27 04:45:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 272. [2018-10-27 04:45:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-27 04:45:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 313 transitions. [2018-10-27 04:45:51,614 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 313 transitions. Word has length 32 [2018-10-27 04:45:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:51,615 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 313 transitions. [2018-10-27 04:45:51,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 313 transitions. [2018-10-27 04:45:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 04:45:51,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:51,616 INFO L375 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-10-27 04:45:51,616 INFO L424 AbstractCegarLoop]: === Iteration 11 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:45:51,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:51,616 INFO L82 PathProgramCache]: Analyzing trace with hash 434626541, now seen corresponding path program 1 times [2018-10-27 04:45:51,616 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:51,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:51,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:51,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:51,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:51,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:51,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:45:51,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:45:51,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:45:51,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:45:51,764 INFO L87 Difference]: Start difference. First operand 272 states and 313 transitions. Second operand 6 states. [2018-10-27 04:45:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:52,003 INFO L93 Difference]: Finished difference Result 292 states and 333 transitions. [2018-10-27 04:45:52,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:45:52,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-10-27 04:45:52,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:52,005 INFO L225 Difference]: With dead ends: 292 [2018-10-27 04:45:52,005 INFO L226 Difference]: Without dead ends: 292 [2018-10-27 04:45:52,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:45:52,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-27 04:45:52,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 282. [2018-10-27 04:45:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-27 04:45:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 323 transitions. [2018-10-27 04:45:52,009 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 323 transitions. Word has length 32 [2018-10-27 04:45:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:52,010 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 323 transitions. [2018-10-27 04:45:52,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:45:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 323 transitions. [2018-10-27 04:45:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-27 04:45:52,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:52,011 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:52,011 INFO L424 AbstractCegarLoop]: === Iteration 12 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:45:52,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:52,011 INFO L82 PathProgramCache]: Analyzing trace with hash 96982184, now seen corresponding path program 1 times [2018-10-27 04:45:52,011 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:52,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:52,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:52,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:52,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:52,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:52,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:52,426 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/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-10-27 04:45:52,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:52,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:52,554 INFO L477 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-10-27 04:45:52,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:45:52,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:45:52,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:45:52,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:45:52,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:45:52,667 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:52,674 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:21 [2018-10-27 04:45:52,918 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-27 04:45:53,001 INFO L477 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 21 treesize of output 17 [2018-10-27 04:45:53,003 INFO L477 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 5 [2018-10-27 04:45:53,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,029 INFO L477 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 32 treesize of output 26 [2018-10-27 04:45:53,031 INFO L477 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 11 [2018-10-27 04:45:53,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:53,039 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:19 [2018-10-27 04:45:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:53,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:53,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-27 04:45:53,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 04:45:53,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 04:45:53,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:45:53,080 INFO L87 Difference]: Start difference. First operand 282 states and 323 transitions. Second operand 16 states. [2018-10-27 04:45:55,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:55,222 INFO L93 Difference]: Finished difference Result 291 states and 331 transitions. [2018-10-27 04:45:55,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:45:55,223 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-10-27 04:45:55,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:55,224 INFO L225 Difference]: With dead ends: 291 [2018-10-27 04:45:55,224 INFO L226 Difference]: Without dead ends: 291 [2018-10-27 04:45:55,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2018-10-27 04:45:55,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-27 04:45:55,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 275. [2018-10-27 04:45:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-27 04:45:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 315 transitions. [2018-10-27 04:45:55,229 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 315 transitions. Word has length 39 [2018-10-27 04:45:55,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:55,229 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 315 transitions. [2018-10-27 04:45:55,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 04:45:55,229 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 315 transitions. [2018-10-27 04:45:55,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-27 04:45:55,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:55,230 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:55,230 INFO L424 AbstractCegarLoop]: === Iteration 13 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:45:55,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:55,231 INFO L82 PathProgramCache]: Analyzing trace with hash -284487357, now seen corresponding path program 1 times [2018-10-27 04:45:55,231 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:55,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:55,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:55,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:55,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:45:55,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:55,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:55,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:55,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:55,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:55,405 INFO L87 Difference]: Start difference. First operand 275 states and 315 transitions. Second operand 4 states. [2018-10-27 04:45:55,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:55,502 INFO L93 Difference]: Finished difference Result 277 states and 309 transitions. [2018-10-27 04:45:55,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:45:55,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-10-27 04:45:55,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:55,503 INFO L225 Difference]: With dead ends: 277 [2018-10-27 04:45:55,504 INFO L226 Difference]: Without dead ends: 277 [2018-10-27 04:45:55,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-27 04:45:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 271. [2018-10-27 04:45:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-27 04:45:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 303 transitions. [2018-10-27 04:45:55,508 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 303 transitions. Word has length 52 [2018-10-27 04:45:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:55,508 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 303 transitions. [2018-10-27 04:45:55,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 303 transitions. [2018-10-27 04:45:55,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-27 04:45:55,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:55,512 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:55,512 INFO L424 AbstractCegarLoop]: === Iteration 14 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:45:55,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:55,513 INFO L82 PathProgramCache]: Analyzing trace with hash -284487356, now seen corresponding path program 1 times [2018-10-27 04:45:55,513 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:55,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:55,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:55,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:55,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:45:55,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:55,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:55,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:55,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:55,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:55,670 INFO L87 Difference]: Start difference. First operand 271 states and 303 transitions. Second operand 4 states. [2018-10-27 04:45:55,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:55,757 INFO L93 Difference]: Finished difference Result 273 states and 297 transitions. [2018-10-27 04:45:55,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:45:55,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-10-27 04:45:55,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:55,759 INFO L225 Difference]: With dead ends: 273 [2018-10-27 04:45:55,759 INFO L226 Difference]: Without dead ends: 273 [2018-10-27 04:45:55,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-27 04:45:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2018-10-27 04:45:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-27 04:45:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 291 transitions. [2018-10-27 04:45:55,764 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 291 transitions. Word has length 52 [2018-10-27 04:45:55,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:55,765 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 291 transitions. [2018-10-27 04:45:55,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:55,765 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 291 transitions. [2018-10-27 04:45:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-27 04:45:55,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:55,766 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:55,766 INFO L424 AbstractCegarLoop]: === Iteration 15 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:45:55,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:55,766 INFO L82 PathProgramCache]: Analyzing trace with hash -230061340, now seen corresponding path program 1 times [2018-10-27 04:45:55,766 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:55,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:55,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:55,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:55,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:55,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:55,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:55,831 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/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-10-27 04:45:55,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:55,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:55,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:55,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-10-27 04:45:55,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:55,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:55,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:55,893 INFO L87 Difference]: Start difference. First operand 267 states and 291 transitions. Second operand 5 states. [2018-10-27 04:45:55,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:55,907 INFO L93 Difference]: Finished difference Result 291 states and 315 transitions. [2018-10-27 04:45:55,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:45:55,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-10-27 04:45:55,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:55,910 INFO L225 Difference]: With dead ends: 291 [2018-10-27 04:45:55,910 INFO L226 Difference]: Without dead ends: 291 [2018-10-27 04:45:55,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:55,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-27 04:45:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 281. [2018-10-27 04:45:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-27 04:45:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 305 transitions. [2018-10-27 04:45:55,918 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 305 transitions. Word has length 53 [2018-10-27 04:45:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:55,918 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 305 transitions. [2018-10-27 04:45:55,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 305 transitions. [2018-10-27 04:45:55,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-27 04:45:55,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:55,919 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:55,919 INFO L424 AbstractCegarLoop]: === Iteration 16 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:45:55,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:55,920 INFO L82 PathProgramCache]: Analyzing trace with hash 827943177, now seen corresponding path program 2 times [2018-10-27 04:45:55,920 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:55,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:55,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:55,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:55,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:56,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:56,176 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:45:56,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 04:45:56,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-27 04:45:56,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:56,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:56,347 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |create_data_#t~malloc5.base| 1)) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) 0))) is different from true [2018-10-27 04:45:56,354 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (and (= |c_#valid| (store (store |c_old(#valid)| |create_data_#t~malloc5.base| 1) |create_data_#t~malloc6.base| 1)) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) 0))) is different from true [2018-10-27 04:45:56,437 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:56,461 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:56,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-10-27 04:45:56,525 INFO L477 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 20 [2018-10-27 04:45:56,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:56,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:56,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:56,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-10-27 04:45:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 04:45:56,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:45:56,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2018-10-27 04:45:56,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:45:56,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:45:56,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=41, Unknown=2, NotChecked=26, Total=90 [2018-10-27 04:45:56,711 INFO L87 Difference]: Start difference. First operand 281 states and 305 transitions. Second operand 10 states. [2018-10-27 04:45:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:58,225 INFO L93 Difference]: Finished difference Result 345 states and 378 transitions. [2018-10-27 04:45:58,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:45:58,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-10-27 04:45:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:58,228 INFO L225 Difference]: With dead ends: 345 [2018-10-27 04:45:58,228 INFO L226 Difference]: Without dead ends: 345 [2018-10-27 04:45:58,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=8, NotChecked=38, Total=156 [2018-10-27 04:45:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-10-27 04:45:58,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 313. [2018-10-27 04:45:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-27 04:45:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 343 transitions. [2018-10-27 04:45:58,234 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 343 transitions. Word has length 60 [2018-10-27 04:45:58,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:58,235 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 343 transitions. [2018-10-27 04:45:58,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:45:58,235 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 343 transitions. [2018-10-27 04:45:58,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-27 04:45:58,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:58,236 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:45:58,236 INFO L424 AbstractCegarLoop]: === Iteration 17 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:45:58,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:58,236 INFO L82 PathProgramCache]: Analyzing trace with hash -69253307, now seen corresponding path program 1 times [2018-10-27 04:45:58,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:58,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:58,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:58,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:58,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:58,985 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-10-27 04:45:59,808 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-27 04:45:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 04:45:59,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:59,841 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:45:59,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:59,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:00,073 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (and (= 0 (select (store |c_old(#valid)| |create_data_#t~malloc5.base| 1) |create_data_#t~malloc6.base|)) (= (store (store |c_old(#length)| |create_data_#t~malloc5.base| 16) |create_data_#t~malloc6.base| 80) |c_#length|) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) 0))) is different from true [2018-10-27 04:46:00,195 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,196 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,196 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 04:46:00,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-10-27 04:46:00,262 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:00,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 36 [2018-10-27 04:46:00,264 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,289 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:00,297 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-10-27 04:46:00,297 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-10-27 04:46:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:00,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:00,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2018-10-27 04:46:00,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 04:46:00,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 04:46:00,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=297, Unknown=5, NotChecked=36, Total=420 [2018-10-27 04:46:00,350 INFO L87 Difference]: Start difference. First operand 313 states and 343 transitions. Second operand 21 states. [2018-10-27 04:46:00,729 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 27 [2018-10-27 04:46:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:02,061 INFO L93 Difference]: Finished difference Result 359 states and 393 transitions. [2018-10-27 04:46:02,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:46:02,062 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-10-27 04:46:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:02,064 INFO L225 Difference]: With dead ends: 359 [2018-10-27 04:46:02,064 INFO L226 Difference]: Without dead ends: 359 [2018-10-27 04:46:02,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=180, Invalid=686, Unknown=8, NotChecked=56, Total=930 [2018-10-27 04:46:02,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-27 04:46:02,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 325. [2018-10-27 04:46:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-27 04:46:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 357 transitions. [2018-10-27 04:46:02,070 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 357 transitions. Word has length 67 [2018-10-27 04:46:02,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:02,070 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 357 transitions. [2018-10-27 04:46:02,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 04:46:02,070 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 357 transitions. [2018-10-27 04:46:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-27 04:46:02,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:02,071 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:02,071 INFO L424 AbstractCegarLoop]: === Iteration 18 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:02,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:02,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1208746785, now seen corresponding path program 1 times [2018-10-27 04:46:02,071 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:02,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:02,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:02,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:02,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:02,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:02,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:46:02,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:46:02,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:46:02,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:46:02,290 INFO L87 Difference]: Start difference. First operand 325 states and 357 transitions. Second operand 6 states. [2018-10-27 04:46:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:02,457 INFO L93 Difference]: Finished difference Result 382 states and 422 transitions. [2018-10-27 04:46:02,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:46:02,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-10-27 04:46:02,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:02,460 INFO L225 Difference]: With dead ends: 382 [2018-10-27 04:46:02,460 INFO L226 Difference]: Without dead ends: 382 [2018-10-27 04:46:02,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:46:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-27 04:46:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 336. [2018-10-27 04:46:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-10-27 04:46:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 369 transitions. [2018-10-27 04:46:02,469 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 369 transitions. Word has length 69 [2018-10-27 04:46:02,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:02,469 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 369 transitions. [2018-10-27 04:46:02,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:46:02,469 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 369 transitions. [2018-10-27 04:46:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-27 04:46:02,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:02,470 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:02,470 INFO L424 AbstractCegarLoop]: === Iteration 19 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:02,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:02,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2127911308, now seen corresponding path program 1 times [2018-10-27 04:46:02,470 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:02,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:02,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:02,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:02,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 04:46:02,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:02,985 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:02,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:03,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:03,040 INFO L477 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-10-27 04:46:03,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:03,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:03,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:46:03,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:46:03,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:03,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:03,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-27 04:46:03,365 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (and (= 0 (select (store |c_old(#valid)| |create_data_#t~malloc5.base| 1) |create_data_#t~malloc6.base|)) (= (store (store |c_old(#length)| |create_data_#t~malloc5.base| 16) |create_data_#t~malloc6.base| 80) |c_#length|) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) 0))) is different from true [2018-10-27 04:46:03,424 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:03,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-10-27 04:46:03,427 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:03,429 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:03,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 36 [2018-10-27 04:46:03,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:03,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:03,447 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:03,448 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:03,449 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:03,450 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:03,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 04:46:03,451 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:03,459 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-10-27 04:46:03,459 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-10-27 04:46:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:03,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:03,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 25 [2018-10-27 04:46:03,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 04:46:03,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 04:46:03,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=515, Unknown=6, NotChecked=46, Total=650 [2018-10-27 04:46:03,517 INFO L87 Difference]: Start difference. First operand 336 states and 369 transitions. Second operand 26 states. [2018-10-27 04:46:05,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:05,174 INFO L93 Difference]: Finished difference Result 360 states and 393 transitions. [2018-10-27 04:46:05,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-27 04:46:05,175 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-10-27 04:46:05,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:05,177 INFO L225 Difference]: With dead ends: 360 [2018-10-27 04:46:05,177 INFO L226 Difference]: Without dead ends: 360 [2018-10-27 04:46:05,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=229, Invalid=1405, Unknown=10, NotChecked=78, Total=1722 [2018-10-27 04:46:05,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-10-27 04:46:05,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 337. [2018-10-27 04:46:05,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-27 04:46:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 370 transitions. [2018-10-27 04:46:05,185 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 370 transitions. Word has length 69 [2018-10-27 04:46:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:05,185 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 370 transitions. [2018-10-27 04:46:05,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-27 04:46:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 370 transitions. [2018-10-27 04:46:05,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-27 04:46:05,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:05,186 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:05,186 INFO L424 AbstractCegarLoop]: === Iteration 20 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:05,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:05,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2127911309, now seen corresponding path program 1 times [2018-10-27 04:46:05,187 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:05,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:05,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:05,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:05,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 04:46:05,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:05,822 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:05,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:05,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:05,877 INFO L477 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-10-27 04:46:05,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:05,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:05,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:46:05,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:46:05,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:05,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:05,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-27 04:46:05,949 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |create_data_#t~malloc5.base| 1)) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) 0))) is different from true [2018-10-27 04:46:05,953 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| |create_data_#t~malloc5.base| 1))) (and (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= |c_#valid| (store .cse0 |create_data_#t~malloc6.base| 1)) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) 0)))) is different from true [2018-10-27 04:46:06,004 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:06,009 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:06,010 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:06,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-10-27 04:46:06,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 34 [2018-10-27 04:46:06,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:06,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:06,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:06,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:28 [2018-10-27 04:46:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:06,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:06,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 18 [2018-10-27 04:46:06,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 04:46:06,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 04:46:06,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=227, Unknown=2, NotChecked=62, Total=342 [2018-10-27 04:46:06,137 INFO L87 Difference]: Start difference. First operand 337 states and 370 transitions. Second operand 19 states. [2018-10-27 04:46:06,745 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2018-10-27 04:46:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:07,739 INFO L93 Difference]: Finished difference Result 358 states and 393 transitions. [2018-10-27 04:46:07,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 04:46:07,740 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2018-10-27 04:46:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:07,741 INFO L225 Difference]: With dead ends: 358 [2018-10-27 04:46:07,741 INFO L226 Difference]: Without dead ends: 358 [2018-10-27 04:46:07,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=150, Invalid=668, Unknown=2, NotChecked=110, Total=930 [2018-10-27 04:46:07,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-27 04:46:07,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 327. [2018-10-27 04:46:07,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-10-27 04:46:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 355 transitions. [2018-10-27 04:46:07,747 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 355 transitions. Word has length 69 [2018-10-27 04:46:07,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:07,748 INFO L481 AbstractCegarLoop]: Abstraction has 327 states and 355 transitions. [2018-10-27 04:46:07,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 04:46:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 355 transitions. [2018-10-27 04:46:07,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-27 04:46:07,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:07,748 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:07,749 INFO L424 AbstractCegarLoop]: === Iteration 21 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:07,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:07,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1111755549, now seen corresponding path program 1 times [2018-10-27 04:46:07,749 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:07,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:07,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:07,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:07,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:08,366 WARN L179 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-10-27 04:46:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:08,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:08,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:46:08,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:46:08,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:46:08,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:46:08,381 INFO L87 Difference]: Start difference. First operand 327 states and 355 transitions. Second operand 6 states. [2018-10-27 04:46:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:08,897 INFO L93 Difference]: Finished difference Result 324 states and 352 transitions. [2018-10-27 04:46:08,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:46:08,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-10-27 04:46:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:08,899 INFO L225 Difference]: With dead ends: 324 [2018-10-27 04:46:08,899 INFO L226 Difference]: Without dead ends: 324 [2018-10-27 04:46:08,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:46:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-27 04:46:08,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 323. [2018-10-27 04:46:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-27 04:46:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 352 transitions. [2018-10-27 04:46:08,907 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 352 transitions. Word has length 72 [2018-10-27 04:46:08,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:08,907 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 352 transitions. [2018-10-27 04:46:08,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:46:08,908 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 352 transitions. [2018-10-27 04:46:08,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-27 04:46:08,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:08,908 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:08,908 INFO L424 AbstractCegarLoop]: === Iteration 22 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:08,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:08,909 INFO L82 PathProgramCache]: Analyzing trace with hash 104683768, now seen corresponding path program 1 times [2018-10-27 04:46:08,909 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:08,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:08,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:08,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:08,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:09,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:09,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:46:09,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:46:09,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:46:09,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:46:09,128 INFO L87 Difference]: Start difference. First operand 323 states and 352 transitions. Second operand 7 states. [2018-10-27 04:46:09,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:09,307 INFO L93 Difference]: Finished difference Result 337 states and 368 transitions. [2018-10-27 04:46:09,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:46:09,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-10-27 04:46:09,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:09,310 INFO L225 Difference]: With dead ends: 337 [2018-10-27 04:46:09,310 INFO L226 Difference]: Without dead ends: 337 [2018-10-27 04:46:09,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:46:09,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-27 04:46:09,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 322. [2018-10-27 04:46:09,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-10-27 04:46:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 351 transitions. [2018-10-27 04:46:09,315 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 351 transitions. Word has length 73 [2018-10-27 04:46:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:09,316 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 351 transitions. [2018-10-27 04:46:09,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:46:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 351 transitions. [2018-10-27 04:46:09,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-27 04:46:09,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:09,316 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:09,317 INFO L424 AbstractCegarLoop]: === Iteration 23 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:09,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:09,317 INFO L82 PathProgramCache]: Analyzing trace with hash 104683769, now seen corresponding path program 1 times [2018-10-27 04:46:09,317 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:09,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:09,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:09,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:09,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:09,601 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-27 04:46:09,724 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:09,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:09,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 04:46:09,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:46:09,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:46:09,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:46:09,725 INFO L87 Difference]: Start difference. First operand 322 states and 351 transitions. Second operand 9 states. [2018-10-27 04:46:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:09,996 INFO L93 Difference]: Finished difference Result 348 states and 379 transitions. [2018-10-27 04:46:09,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 04:46:09,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2018-10-27 04:46:09,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:09,998 INFO L225 Difference]: With dead ends: 348 [2018-10-27 04:46:09,998 INFO L226 Difference]: Without dead ends: 348 [2018-10-27 04:46:09,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:46:09,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-10-27 04:46:10,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 321. [2018-10-27 04:46:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-27 04:46:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 350 transitions. [2018-10-27 04:46:10,004 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 350 transitions. Word has length 73 [2018-10-27 04:46:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:10,004 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 350 transitions. [2018-10-27 04:46:10,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:46:10,004 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 350 transitions. [2018-10-27 04:46:10,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 04:46:10,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:10,005 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:10,005 INFO L424 AbstractCegarLoop]: === Iteration 24 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:10,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2051074434, now seen corresponding path program 1 times [2018-10-27 04:46:10,006 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:10,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:10,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:10,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:10,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:46:10,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:46:10,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:46:10,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:10,144 INFO L87 Difference]: Start difference. First operand 321 states and 350 transitions. Second operand 5 states. [2018-10-27 04:46:10,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:10,255 INFO L93 Difference]: Finished difference Result 336 states and 367 transitions. [2018-10-27 04:46:10,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:46:10,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-10-27 04:46:10,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:10,257 INFO L225 Difference]: With dead ends: 336 [2018-10-27 04:46:10,257 INFO L226 Difference]: Without dead ends: 336 [2018-10-27 04:46:10,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:46:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-10-27 04:46:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 320. [2018-10-27 04:46:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-27 04:46:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 349 transitions. [2018-10-27 04:46:10,262 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 349 transitions. Word has length 77 [2018-10-27 04:46:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:10,262 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 349 transitions. [2018-10-27 04:46:10,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:46:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 349 transitions. [2018-10-27 04:46:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 04:46:10,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:10,263 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:10,263 INFO L424 AbstractCegarLoop]: === Iteration 25 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:10,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:10,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2051074433, now seen corresponding path program 1 times [2018-10-27 04:46:10,263 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:10,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:10,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:10,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:10,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:10,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:10,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:46:10,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:46:10,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:46:10,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:10,430 INFO L87 Difference]: Start difference. First operand 320 states and 349 transitions. Second operand 5 states. [2018-10-27 04:46:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:10,558 INFO L93 Difference]: Finished difference Result 347 states and 378 transitions. [2018-10-27 04:46:10,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:46:10,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-10-27 04:46:10,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:10,560 INFO L225 Difference]: With dead ends: 347 [2018-10-27 04:46:10,560 INFO L226 Difference]: Without dead ends: 347 [2018-10-27 04:46:10,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:46:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-27 04:46:10,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 319. [2018-10-27 04:46:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-27 04:46:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 348 transitions. [2018-10-27 04:46:10,565 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 348 transitions. Word has length 77 [2018-10-27 04:46:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:10,565 INFO L481 AbstractCegarLoop]: Abstraction has 319 states and 348 transitions. [2018-10-27 04:46:10,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:46:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 348 transitions. [2018-10-27 04:46:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-27 04:46:10,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:10,566 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:10,566 INFO L424 AbstractCegarLoop]: === Iteration 26 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:10,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:10,567 INFO L82 PathProgramCache]: Analyzing trace with hash 841202147, now seen corresponding path program 1 times [2018-10-27 04:46:10,567 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:10,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:10,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:10,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:10,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:10,941 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-27 04:46:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:11,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:11,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-27 04:46:11,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 04:46:11,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 04:46:11,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:46:11,211 INFO L87 Difference]: Start difference. First operand 319 states and 348 transitions. Second operand 16 states. [2018-10-27 04:46:11,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:11,925 INFO L93 Difference]: Finished difference Result 361 states and 399 transitions. [2018-10-27 04:46:11,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-27 04:46:11,926 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 78 [2018-10-27 04:46:11,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:11,927 INFO L225 Difference]: With dead ends: 361 [2018-10-27 04:46:11,927 INFO L226 Difference]: Without dead ends: 361 [2018-10-27 04:46:11,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-10-27 04:46:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-10-27 04:46:11,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 322. [2018-10-27 04:46:11,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-10-27 04:46:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 354 transitions. [2018-10-27 04:46:11,933 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 354 transitions. Word has length 78 [2018-10-27 04:46:11,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:11,934 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 354 transitions. [2018-10-27 04:46:11,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 04:46:11,934 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 354 transitions. [2018-10-27 04:46:11,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-27 04:46:11,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:11,935 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:11,935 INFO L424 AbstractCegarLoop]: === Iteration 27 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:11,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash 841202148, now seen corresponding path program 1 times [2018-10-27 04:46:11,935 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:11,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:11,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:11,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:11,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:12,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:12,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-10-27 04:46:12,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 04:46:12,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 04:46:12,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:46:12,615 INFO L87 Difference]: Start difference. First operand 322 states and 354 transitions. Second operand 18 states. [2018-10-27 04:46:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:13,402 INFO L93 Difference]: Finished difference Result 368 states and 405 transitions. [2018-10-27 04:46:13,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-27 04:46:13,404 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-10-27 04:46:13,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:13,405 INFO L225 Difference]: With dead ends: 368 [2018-10-27 04:46:13,405 INFO L226 Difference]: Without dead ends: 368 [2018-10-27 04:46:13,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2018-10-27 04:46:13,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-27 04:46:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 322. [2018-10-27 04:46:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-10-27 04:46:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 353 transitions. [2018-10-27 04:46:13,411 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 353 transitions. Word has length 78 [2018-10-27 04:46:13,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:13,411 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 353 transitions. [2018-10-27 04:46:13,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 04:46:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 353 transitions. [2018-10-27 04:46:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-27 04:46:13,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:13,412 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:13,412 INFO L424 AbstractCegarLoop]: === Iteration 28 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:13,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:13,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1896548239, now seen corresponding path program 1 times [2018-10-27 04:46:13,413 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:13,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:13,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:13,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:13,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:14,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:14,196 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 04:46:14,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:14,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:14,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:46:14,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:46:14,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:14,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:14,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:14,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-10-27 04:46:14,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-10-27 04:46:14,467 INFO L477 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 26 treesize of output 18 [2018-10-27 04:46:14,468 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:14,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:14,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:14,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:23 [2018-10-27 04:46:14,477 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_7 Int) (create_data_~data~0.base Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse0 v_arrayElimCell_7) 0) (= |c_#valid| (store .cse0 v_arrayElimCell_7 1))))) is different from true [2018-10-27 04:46:14,521 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_7 Int) (create_data_~data~0.base Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= |c_#valid| (store (store .cse0 v_arrayElimCell_7 1) |c_create_data_#t~malloc20.base| 1)) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse0 v_arrayElimCell_7) 0)))) is different from true [2018-10-27 04:46:14,549 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_7 Int) (create_data_~data~0.base Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse0 v_arrayElimCell_7) 0) (= |c_#valid| (store (store .cse0 v_arrayElimCell_7 1) c_create_data_~nextData~0.base 1))))) is different from true [2018-10-27 04:46:14,710 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:14,711 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:14,712 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:14,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 45 [2018-10-27 04:46:14,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-10-27 04:46:14,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-10-27 04:46:14,720 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:14,727 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:14,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:14,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:14,741 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:33 [2018-10-27 04:46:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 17 not checked. [2018-10-27 04:46:14,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:46:14,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-10-27 04:46:14,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 04:46:14,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 04:46:14,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=260, Unknown=5, NotChecked=108, Total=462 [2018-10-27 04:46:14,793 INFO L87 Difference]: Start difference. First operand 322 states and 353 transitions. Second operand 22 states. [2018-10-27 04:46:16,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:16,300 INFO L93 Difference]: Finished difference Result 360 states and 394 transitions. [2018-10-27 04:46:16,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:46:16,301 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 82 [2018-10-27 04:46:16,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:16,302 INFO L225 Difference]: With dead ends: 360 [2018-10-27 04:46:16,302 INFO L226 Difference]: Without dead ends: 360 [2018-10-27 04:46:16,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=172, Invalid=572, Unknown=24, NotChecked=162, Total=930 [2018-10-27 04:46:16,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-10-27 04:46:16,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 342. [2018-10-27 04:46:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-10-27 04:46:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 377 transitions. [2018-10-27 04:46:16,308 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 377 transitions. Word has length 82 [2018-10-27 04:46:16,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:16,308 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 377 transitions. [2018-10-27 04:46:16,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-27 04:46:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 377 transitions. [2018-10-27 04:46:16,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-27 04:46:16,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:16,309 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:16,309 INFO L424 AbstractCegarLoop]: === Iteration 29 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:16,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:16,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1896548240, now seen corresponding path program 1 times [2018-10-27 04:46:16,310 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:16,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:16,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:16,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:16,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 04:46:17,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:17,312 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:17,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:17,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:17,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:46:17,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:46:17,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:17,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:17,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:17,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-10-27 04:46:17,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-10-27 04:46:17,544 INFO L477 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 26 treesize of output 18 [2018-10-27 04:46:17,545 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:17,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:17,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:17,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:23 [2018-10-27 04:46:17,564 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_10 Int)) (and (= (select (store |c_old(#valid)| create_data_~data~0.base 1) v_arrayElimCell_10) 0) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_10 80)))) is different from true [2018-10-27 04:46:17,601 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_10 Int)) (and (= (select (store |c_old(#valid)| create_data_~data~0.base 1) v_arrayElimCell_10) 0) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_10 80) |c_create_data_#t~malloc20.base| 16) |c_#length|))) is different from true [2018-10-27 04:46:17,629 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_10 Int)) (and (= (select (store |c_old(#valid)| create_data_~data~0.base 1) v_arrayElimCell_10) 0) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_10 80) c_create_data_~nextData~0.base 16)))) is different from true [2018-10-27 04:46:18,505 WARN L179 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-10-27 04:46:18,537 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:18,564 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:18,593 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:18,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 04:46:18,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:18,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-10-27 04:46:18,798 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:18,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-10-27 04:46:18,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 46 [2018-10-27 04:46:18,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-27 04:46:18,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:46:18,868 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:46:18,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-10-27 04:46:18,884 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:46, output treesize:72 [2018-10-27 04:46:20,167 WARN L179 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-10-27 04:46:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 17 not checked. [2018-10-27 04:46:20,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:46:20,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2018-10-27 04:46:20,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-27 04:46:20,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-27 04:46:20,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=471, Unknown=7, NotChecked=138, Total=702 [2018-10-27 04:46:20,201 INFO L87 Difference]: Start difference. First operand 342 states and 377 transitions. Second operand 27 states. [2018-10-27 04:46:22,077 WARN L179 SmtUtils]: Spent 531.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-27 04:46:24,141 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-27 04:46:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:24,729 INFO L93 Difference]: Finished difference Result 358 states and 392 transitions. [2018-10-27 04:46:24,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 04:46:24,730 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-10-27 04:46:24,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:24,731 INFO L225 Difference]: With dead ends: 358 [2018-10-27 04:46:24,731 INFO L226 Difference]: Without dead ends: 358 [2018-10-27 04:46:24,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 77 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=198, Invalid=1206, Unknown=14, NotChecked=222, Total=1640 [2018-10-27 04:46:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-27 04:46:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 342. [2018-10-27 04:46:24,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-10-27 04:46:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 375 transitions. [2018-10-27 04:46:24,749 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 375 transitions. Word has length 82 [2018-10-27 04:46:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:24,749 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 375 transitions. [2018-10-27 04:46:24,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-27 04:46:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 375 transitions. [2018-10-27 04:46:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-27 04:46:24,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:24,750 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:24,750 INFO L424 AbstractCegarLoop]: === Iteration 30 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:24,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:24,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1897436211, now seen corresponding path program 1 times [2018-10-27 04:46:24,751 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:24,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:24,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:24,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:24,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:24,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:24,954 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:24,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:24,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:25,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:46:25,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:25,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:25,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-27 04:46:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:25,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:46:25,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-10-27 04:46:25,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:46:25,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:46:25,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:46:25,036 INFO L87 Difference]: Start difference. First operand 342 states and 375 transitions. Second operand 9 states. [2018-10-27 04:46:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:25,189 INFO L93 Difference]: Finished difference Result 343 states and 375 transitions. [2018-10-27 04:46:25,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:46:25,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2018-10-27 04:46:25,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:25,191 INFO L225 Difference]: With dead ends: 343 [2018-10-27 04:46:25,191 INFO L226 Difference]: Without dead ends: 343 [2018-10-27 04:46:25,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:46:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-27 04:46:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-10-27 04:46:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-27 04:46:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 373 transitions. [2018-10-27 04:46:25,196 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 373 transitions. Word has length 82 [2018-10-27 04:46:25,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:25,196 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 373 transitions. [2018-10-27 04:46:25,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:46:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 373 transitions. [2018-10-27 04:46:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-27 04:46:25,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:25,197 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:46:25,197 INFO L424 AbstractCegarLoop]: === Iteration 31 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:25,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:25,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1897436212, now seen corresponding path program 1 times [2018-10-27 04:46:25,198 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:25,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:25,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:25,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:25,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:25,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:25,309 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:25,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:25,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:25,357 INFO L477 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-10-27 04:46:25,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:25,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:25,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:46:25,383 INFO L477 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 14 [2018-10-27 04:46:25,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:25,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:25,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:17 [2018-10-27 04:46:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:25,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:46:25,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 9 [2018-10-27 04:46:25,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:46:25,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:46:25,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:46:25,424 INFO L87 Difference]: Start difference. First operand 341 states and 373 transitions. Second operand 10 states. [2018-10-27 04:46:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:25,638 INFO L93 Difference]: Finished difference Result 337 states and 365 transitions. [2018-10-27 04:46:25,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:46:25,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2018-10-27 04:46:25,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:25,640 INFO L225 Difference]: With dead ends: 337 [2018-10-27 04:46:25,640 INFO L226 Difference]: Without dead ends: 337 [2018-10-27 04:46:25,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:46:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-27 04:46:25,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-10-27 04:46:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-27 04:46:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 365 transitions. [2018-10-27 04:46:25,648 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 365 transitions. Word has length 82 [2018-10-27 04:46:25,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:25,648 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 365 transitions. [2018-10-27 04:46:25,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:46:25,648 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 365 transitions. [2018-10-27 04:46:25,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-27 04:46:25,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:25,649 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:25,649 INFO L424 AbstractCegarLoop]: === Iteration 32 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:25,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:25,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1523131754, now seen corresponding path program 1 times [2018-10-27 04:46:25,650 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:25,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:25,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:25,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:25,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:25,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:25,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:46:25,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:46:25,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:46:25,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:46:25,735 INFO L87 Difference]: Start difference. First operand 337 states and 365 transitions. Second operand 3 states. [2018-10-27 04:46:25,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:25,810 INFO L93 Difference]: Finished difference Result 338 states and 366 transitions. [2018-10-27 04:46:25,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:46:25,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-10-27 04:46:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:25,813 INFO L225 Difference]: With dead ends: 338 [2018-10-27 04:46:25,813 INFO L226 Difference]: Without dead ends: 338 [2018-10-27 04:46:25,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:46:25,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-10-27 04:46:25,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-10-27 04:46:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-27 04:46:25,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 366 transitions. [2018-10-27 04:46:25,822 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 366 transitions. Word has length 84 [2018-10-27 04:46:25,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:25,822 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 366 transitions. [2018-10-27 04:46:25,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:46:25,822 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 366 transitions. [2018-10-27 04:46:25,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-27 04:46:25,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:25,823 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:25,823 INFO L424 AbstractCegarLoop]: === Iteration 33 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:25,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:25,824 INFO L82 PathProgramCache]: Analyzing trace with hash 624489209, now seen corresponding path program 1 times [2018-10-27 04:46:25,824 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:25,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:25,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:25,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:25,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:26,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:26,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:46:26,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:46:26,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:46:26,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:26,084 INFO L87 Difference]: Start difference. First operand 338 states and 366 transitions. Second operand 5 states. [2018-10-27 04:46:26,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:26,107 INFO L93 Difference]: Finished difference Result 395 states and 432 transitions. [2018-10-27 04:46:26,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:46:26,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-10-27 04:46:26,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:26,110 INFO L225 Difference]: With dead ends: 395 [2018-10-27 04:46:26,110 INFO L226 Difference]: Without dead ends: 395 [2018-10-27 04:46:26,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:46:26,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-27 04:46:26,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 341. [2018-10-27 04:46:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-27 04:46:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 369 transitions. [2018-10-27 04:46:26,117 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 369 transitions. Word has length 85 [2018-10-27 04:46:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:26,117 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 369 transitions. [2018-10-27 04:46:26,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:46:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 369 transitions. [2018-10-27 04:46:26,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-27 04:46:26,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:26,118 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:26,118 INFO L424 AbstractCegarLoop]: === Iteration 34 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:26,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:26,118 INFO L82 PathProgramCache]: Analyzing trace with hash 251875608, now seen corresponding path program 1 times [2018-10-27 04:46:26,118 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:26,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:26,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:26,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:26,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:26,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:26,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:46:26,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:46:26,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:46:26,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:26,213 INFO L87 Difference]: Start difference. First operand 341 states and 369 transitions. Second operand 5 states. [2018-10-27 04:46:26,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:26,322 INFO L93 Difference]: Finished difference Result 355 states and 385 transitions. [2018-10-27 04:46:26,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:46:26,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2018-10-27 04:46:26,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:26,324 INFO L225 Difference]: With dead ends: 355 [2018-10-27 04:46:26,324 INFO L226 Difference]: Without dead ends: 355 [2018-10-27 04:46:26,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:46:26,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-10-27 04:46:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 346. [2018-10-27 04:46:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-27 04:46:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 376 transitions. [2018-10-27 04:46:26,333 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 376 transitions. Word has length 84 [2018-10-27 04:46:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:26,333 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 376 transitions. [2018-10-27 04:46:26,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:46:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 376 transitions. [2018-10-27 04:46:26,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-27 04:46:26,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:26,334 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:26,339 INFO L424 AbstractCegarLoop]: === Iteration 35 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:26,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:26,340 INFO L82 PathProgramCache]: Analyzing trace with hash 251875609, now seen corresponding path program 1 times [2018-10-27 04:46:26,340 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:26,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:26,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:26,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:26,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:26,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:26,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-10-27 04:46:26,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 04:46:26,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 04:46:26,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:46:26,901 INFO L87 Difference]: Start difference. First operand 346 states and 376 transitions. Second operand 17 states. [2018-10-27 04:46:27,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:27,701 INFO L93 Difference]: Finished difference Result 389 states and 424 transitions. [2018-10-27 04:46:27,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 04:46:27,702 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-10-27 04:46:27,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:27,703 INFO L225 Difference]: With dead ends: 389 [2018-10-27 04:46:27,703 INFO L226 Difference]: Without dead ends: 389 [2018-10-27 04:46:27,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2018-10-27 04:46:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-10-27 04:46:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 346. [2018-10-27 04:46:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-27 04:46:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 375 transitions. [2018-10-27 04:46:27,708 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 375 transitions. Word has length 84 [2018-10-27 04:46:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:27,708 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 375 transitions. [2018-10-27 04:46:27,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 04:46:27,708 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 375 transitions. [2018-10-27 04:46:27,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-27 04:46:27,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:27,713 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:27,713 INFO L424 AbstractCegarLoop]: === Iteration 36 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:27,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:27,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1516732415, now seen corresponding path program 1 times [2018-10-27 04:46:27,714 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:27,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:27,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:27,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:27,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:28,658 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 04:46:28,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:28,658 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:28,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:28,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:28,745 INFO L477 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-10-27 04:46:28,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:28,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:28,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:46:28,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:46:28,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:28,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:28,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-27 04:46:29,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:46:29,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:46:29,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:29,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:29,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:29,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:50 [2018-10-27 04:46:29,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-10-27 04:46:29,119 INFO L477 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 39 treesize of output 27 [2018-10-27 04:46:29,119 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:29,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:29,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:29,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:32 [2018-10-27 04:46:29,221 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_14 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_14 80) |c_create_data_#t~malloc20.base| 16)) (= 0 (select .cse0 v_arrayElimCell_14)) (= (select (store .cse0 v_arrayElimCell_14 1) |c_create_data_#t~malloc20.base|) 0)))) is different from true [2018-10-27 04:46:29,224 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (create_data_~nextData~0.base Int) (v_arrayElimCell_14 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select (store .cse0 v_arrayElimCell_14 1) create_data_~nextData~0.base) 0) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_14 80) create_data_~nextData~0.base 16)) (= 0 (select .cse0 v_arrayElimCell_14))))) is different from true [2018-10-27 04:46:29,249 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:29,250 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:29,251 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:29,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-10-27 04:46:29,267 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:29,268 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:29,269 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:29,270 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:29,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-10-27 04:46:29,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:29,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:29,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-10-27 04:46:29,292 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:29,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-10-27 04:46:29,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-10-27 04:46:29,300 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:29,310 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:29,315 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:29,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:29,326 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-10-27 04:46:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 3 not checked. [2018-10-27 04:46:29,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:46:29,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2018-10-27 04:46:29,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-27 04:46:29,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-27 04:46:29,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=709, Unknown=4, NotChecked=110, Total=930 [2018-10-27 04:46:29,415 INFO L87 Difference]: Start difference. First operand 346 states and 375 transitions. Second operand 31 states. [2018-10-27 04:46:29,645 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-27 04:46:31,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:31,394 INFO L93 Difference]: Finished difference Result 357 states and 386 transitions. [2018-10-27 04:46:31,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 04:46:31,395 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 84 [2018-10-27 04:46:31,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:31,396 INFO L225 Difference]: With dead ends: 357 [2018-10-27 04:46:31,397 INFO L226 Difference]: Without dead ends: 357 [2018-10-27 04:46:31,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=244, Invalid=1737, Unknown=7, NotChecked=174, Total=2162 [2018-10-27 04:46:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-27 04:46:31,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 349. [2018-10-27 04:46:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-27 04:46:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 379 transitions. [2018-10-27 04:46:31,403 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 379 transitions. Word has length 84 [2018-10-27 04:46:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:31,403 INFO L481 AbstractCegarLoop]: Abstraction has 349 states and 379 transitions. [2018-10-27 04:46:31,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-27 04:46:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 379 transitions. [2018-10-27 04:46:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-27 04:46:31,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:31,404 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:31,404 INFO L424 AbstractCegarLoop]: === Iteration 37 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:31,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:31,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1516732414, now seen corresponding path program 1 times [2018-10-27 04:46:31,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:31,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:31,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:31,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:31,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:31,929 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-27 04:46:32,181 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 04:46:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:32,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:32,727 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:32,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:32,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:32,772 INFO L477 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-10-27 04:46:32,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:32,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:32,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:46:32,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:46:32,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:32,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:32,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-27 04:46:32,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:46:32,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:46:32,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:32,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:32,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:32,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:30 [2018-10-27 04:46:32,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-10-27 04:46:32,944 INFO L477 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 26 treesize of output 18 [2018-10-27 04:46:32,944 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:32,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:32,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:32,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-10-27 04:46:32,993 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_17 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= (select .cse0 v_arrayElimCell_17) 0) (= |c_#valid| (store .cse0 v_arrayElimCell_17 1))))) is different from true [2018-10-27 04:46:33,021 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_17 Int)) (let ((.cse1 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse0 (store .cse1 v_arrayElimCell_17 1))) (and (= |c_#valid| (store .cse0 |c_create_data_#t~malloc20.base| 1)) (= (select .cse1 v_arrayElimCell_17) 0) (= 0 (select .cse0 |c_create_data_#t~malloc20.base|)))))) is different from true [2018-10-27 04:46:33,041 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_17 Int) (create_data_~nextData~0.base Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse1 (store .cse0 v_arrayElimCell_17 1))) (and (= (select .cse0 v_arrayElimCell_17) 0) (= |c_#valid| (store .cse1 create_data_~nextData~0.base 1)) (= (select .cse1 create_data_~nextData~0.base) 0))))) is different from true [2018-10-27 04:46:33,163 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-27 04:46:33,165 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:33,169 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:33,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-10-27 04:46:33,188 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:33,190 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:33,191 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:33,192 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:33,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-10-27 04:46:33,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2018-10-27 04:46:33,200 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:33,209 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:33,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:33,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:33,226 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:37, output treesize:41 [2018-10-27 04:46:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 17 not checked. [2018-10-27 04:46:33,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:46:33,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 23 [2018-10-27 04:46:33,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-27 04:46:33,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-27 04:46:33,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=337, Unknown=3, NotChecked=120, Total=552 [2018-10-27 04:46:33,300 INFO L87 Difference]: Start difference. First operand 349 states and 379 transitions. Second operand 24 states. [2018-10-27 04:46:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:34,759 INFO L93 Difference]: Finished difference Result 363 states and 393 transitions. [2018-10-27 04:46:34,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 04:46:34,760 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 84 [2018-10-27 04:46:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:34,762 INFO L225 Difference]: With dead ends: 363 [2018-10-27 04:46:34,762 INFO L226 Difference]: Without dead ends: 363 [2018-10-27 04:46:34,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=215, Invalid=845, Unknown=8, NotChecked=192, Total=1260 [2018-10-27 04:46:34,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-27 04:46:34,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 352. [2018-10-27 04:46:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-10-27 04:46:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 382 transitions. [2018-10-27 04:46:34,772 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 382 transitions. Word has length 84 [2018-10-27 04:46:34,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:34,772 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 382 transitions. [2018-10-27 04:46:34,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-27 04:46:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 382 transitions. [2018-10-27 04:46:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-27 04:46:34,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:34,780 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:34,780 INFO L424 AbstractCegarLoop]: === Iteration 38 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:34,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:34,780 INFO L82 PathProgramCache]: Analyzing trace with hash 583247795, now seen corresponding path program 1 times [2018-10-27 04:46:34,780 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:34,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:34,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:34,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:34,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:35,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:35,002 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:35,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:35,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:35,082 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:35,084 INFO L477 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-10-27 04:46:35,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:35,093 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:35,093 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:35,094 INFO L477 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-10-27 04:46:35,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:35,099 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-10-27 04:46:35,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-10-27 04:46:35,119 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:35,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:35,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2018-10-27 04:46:35,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 04:46:35,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 04:46:35,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:46:35,136 INFO L87 Difference]: Start difference. First operand 352 states and 382 transitions. Second operand 18 states. [2018-10-27 04:46:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:35,640 INFO L93 Difference]: Finished difference Result 358 states and 385 transitions. [2018-10-27 04:46:35,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:46:35,641 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 89 [2018-10-27 04:46:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:35,642 INFO L225 Difference]: With dead ends: 358 [2018-10-27 04:46:35,642 INFO L226 Difference]: Without dead ends: 358 [2018-10-27 04:46:35,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2018-10-27 04:46:35,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-27 04:46:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 343. [2018-10-27 04:46:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-27 04:46:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 369 transitions. [2018-10-27 04:46:35,647 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 369 transitions. Word has length 89 [2018-10-27 04:46:35,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:35,648 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 369 transitions. [2018-10-27 04:46:35,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 04:46:35,648 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 369 transitions. [2018-10-27 04:46:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-27 04:46:35,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:35,648 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:35,649 INFO L424 AbstractCegarLoop]: === Iteration 39 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:35,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:35,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1689117409, now seen corresponding path program 1 times [2018-10-27 04:46:35,649 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:35,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:35,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:35,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:35,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 04:46:36,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:36,262 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:36,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:36,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:36,448 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (and (= 0 (select (store |c_old(#valid)| |create_data_#t~malloc5.base| 1) |create_data_#t~malloc6.base|)) (= (store (store |c_old(#length)| |create_data_#t~malloc5.base| 16) |create_data_#t~malloc6.base| 80) |c_#length|) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) 0))) is different from true [2018-10-27 04:46:36,487 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:36,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-10-27 04:46:36,507 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:36,508 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:36,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 36 [2018-10-27 04:46:36,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:36,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:36,530 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:36,532 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:36,533 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:36,534 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:36,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 04:46:36,534 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:36,545 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-10-27 04:46:36,545 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:44, output treesize:35 [2018-10-27 04:46:36,605 INFO L477 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-10-27 04:46:36,606 INFO L477 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-10-27 04:46:36,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:36,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:36,619 INFO L477 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-10-27 04:46:36,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:46:36,621 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:36,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:36,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:36,632 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:46, output treesize:43 [2018-10-27 04:46:37,065 INFO L477 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 33 treesize of output 25 [2018-10-27 04:46:37,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-10-27 04:46:37,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:37,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:37,205 INFO L477 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-10-27 04:46:37,207 INFO L477 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-10-27 04:46:37,207 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:37,210 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:37,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:37,217 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:57, output treesize:27 [2018-10-27 04:46:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:37,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:37,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [20] total 33 [2018-10-27 04:46:37,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-27 04:46:37,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-27 04:46:37,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=928, Unknown=7, NotChecked=62, Total=1122 [2018-10-27 04:46:37,286 INFO L87 Difference]: Start difference. First operand 343 states and 369 transitions. Second operand 34 states. [2018-10-27 04:46:40,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:40,921 INFO L93 Difference]: Finished difference Result 505 states and 561 transitions. [2018-10-27 04:46:40,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-27 04:46:40,922 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 88 [2018-10-27 04:46:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:40,924 INFO L225 Difference]: With dead ends: 505 [2018-10-27 04:46:40,924 INFO L226 Difference]: Without dead ends: 505 [2018-10-27 04:46:40,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=463, Invalid=3686, Unknown=15, NotChecked=126, Total=4290 [2018-10-27 04:46:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-10-27 04:46:40,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 363. [2018-10-27 04:46:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-27 04:46:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 395 transitions. [2018-10-27 04:46:40,934 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 395 transitions. Word has length 88 [2018-10-27 04:46:40,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:40,934 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 395 transitions. [2018-10-27 04:46:40,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-27 04:46:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 395 transitions. [2018-10-27 04:46:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-27 04:46:40,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:40,935 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:40,935 INFO L424 AbstractCegarLoop]: === Iteration 40 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:40,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:40,935 INFO L82 PathProgramCache]: Analyzing trace with hash 254887803, now seen corresponding path program 1 times [2018-10-27 04:46:40,935 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:40,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:40,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:40,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:40,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:41,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:41,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 04:46:41,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:46:41,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:46:41,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:46:41,031 INFO L87 Difference]: Start difference. First operand 363 states and 395 transitions. Second operand 8 states. [2018-10-27 04:46:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:41,154 INFO L93 Difference]: Finished difference Result 381 states and 411 transitions. [2018-10-27 04:46:41,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:46:41,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2018-10-27 04:46:41,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:41,156 INFO L225 Difference]: With dead ends: 381 [2018-10-27 04:46:41,156 INFO L226 Difference]: Without dead ends: 381 [2018-10-27 04:46:41,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:46:41,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-27 04:46:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 363. [2018-10-27 04:46:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-27 04:46:41,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 393 transitions. [2018-10-27 04:46:41,161 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 393 transitions. Word has length 90 [2018-10-27 04:46:41,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:41,161 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 393 transitions. [2018-10-27 04:46:41,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:46:41,161 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 393 transitions. [2018-10-27 04:46:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 04:46:41,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:41,162 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:41,162 INFO L424 AbstractCegarLoop]: === Iteration 41 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:41,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:41,162 INFO L82 PathProgramCache]: Analyzing trace with hash -659719760, now seen corresponding path program 1 times [2018-10-27 04:46:41,162 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:41,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:41,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:41,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:41,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:41,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:41,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:46:41,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:46:41,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:46:41,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:46:41,348 INFO L87 Difference]: Start difference. First operand 363 states and 393 transitions. Second operand 5 states. [2018-10-27 04:46:41,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:41,456 INFO L93 Difference]: Finished difference Result 369 states and 399 transitions. [2018-10-27 04:46:41,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:46:41,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-10-27 04:46:41,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:41,458 INFO L225 Difference]: With dead ends: 369 [2018-10-27 04:46:41,458 INFO L226 Difference]: Without dead ends: 369 [2018-10-27 04:46:41,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:46:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-27 04:46:41,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2018-10-27 04:46:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-27 04:46:41,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 397 transitions. [2018-10-27 04:46:41,463 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 397 transitions. Word has length 91 [2018-10-27 04:46:41,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:41,463 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 397 transitions. [2018-10-27 04:46:41,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:46:41,463 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 397 transitions. [2018-10-27 04:46:41,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 04:46:41,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:41,464 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:41,464 INFO L424 AbstractCegarLoop]: === Iteration 42 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:41,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:41,464 INFO L82 PathProgramCache]: Analyzing trace with hash -659719759, now seen corresponding path program 1 times [2018-10-27 04:46:41,464 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:41,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:41,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:41,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:41,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:41,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:41,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-27 04:46:41,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 04:46:41,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 04:46:41,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:46:41,793 INFO L87 Difference]: Start difference. First operand 366 states and 397 transitions. Second operand 12 states. [2018-10-27 04:46:42,259 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-10-27 04:46:42,617 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-10-27 04:46:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:42,697 INFO L93 Difference]: Finished difference Result 394 states and 429 transitions. [2018-10-27 04:46:42,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 04:46:42,699 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-10-27 04:46:42,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:42,700 INFO L225 Difference]: With dead ends: 394 [2018-10-27 04:46:42,700 INFO L226 Difference]: Without dead ends: 394 [2018-10-27 04:46:42,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-10-27 04:46:42,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-27 04:46:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 366. [2018-10-27 04:46:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-27 04:46:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 396 transitions. [2018-10-27 04:46:42,704 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 396 transitions. Word has length 91 [2018-10-27 04:46:42,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:42,707 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 396 transitions. [2018-10-27 04:46:42,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 04:46:42,708 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 396 transitions. [2018-10-27 04:46:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-27 04:46:42,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:42,709 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:42,709 INFO L424 AbstractCegarLoop]: === Iteration 43 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:42,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:42,709 INFO L82 PathProgramCache]: Analyzing trace with hash 59242599, now seen corresponding path program 1 times [2018-10-27 04:46:42,709 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:42,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:42,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:42,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:42,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:43,183 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:43,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:43,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 04:46:43,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:46:43,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:46:43,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:46:43,184 INFO L87 Difference]: Start difference. First operand 366 states and 396 transitions. Second operand 9 states. [2018-10-27 04:46:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:43,425 INFO L93 Difference]: Finished difference Result 393 states and 429 transitions. [2018-10-27 04:46:43,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:46:43,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-10-27 04:46:43,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:43,427 INFO L225 Difference]: With dead ends: 393 [2018-10-27 04:46:43,428 INFO L226 Difference]: Without dead ends: 393 [2018-10-27 04:46:43,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:46:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-27 04:46:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 384. [2018-10-27 04:46:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-10-27 04:46:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 419 transitions. [2018-10-27 04:46:43,432 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 419 transitions. Word has length 94 [2018-10-27 04:46:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:43,433 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 419 transitions. [2018-10-27 04:46:43,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:46:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 419 transitions. [2018-10-27 04:46:43,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-27 04:46:43,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:43,441 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:43,442 INFO L424 AbstractCegarLoop]: === Iteration 44 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:43,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:43,442 INFO L82 PathProgramCache]: Analyzing trace with hash 59242600, now seen corresponding path program 1 times [2018-10-27 04:46:43,442 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:43,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:43,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:43,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:43,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:43,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:43,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-10-27 04:46:43,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 04:46:43,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 04:46:43,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2018-10-27 04:46:43,929 INFO L87 Difference]: Start difference. First operand 384 states and 419 transitions. Second operand 22 states. [2018-10-27 04:46:45,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:45,089 INFO L93 Difference]: Finished difference Result 433 states and 473 transitions. [2018-10-27 04:46:45,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-27 04:46:45,090 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 94 [2018-10-27 04:46:45,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:45,091 INFO L225 Difference]: With dead ends: 433 [2018-10-27 04:46:45,091 INFO L226 Difference]: Without dead ends: 433 [2018-10-27 04:46:45,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=188, Invalid=1704, Unknown=0, NotChecked=0, Total=1892 [2018-10-27 04:46:45,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-27 04:46:45,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 409. [2018-10-27 04:46:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-27 04:46:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 449 transitions. [2018-10-27 04:46:45,100 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 449 transitions. Word has length 94 [2018-10-27 04:46:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:45,100 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 449 transitions. [2018-10-27 04:46:45,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-27 04:46:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 449 transitions. [2018-10-27 04:46:45,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-27 04:46:45,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:45,101 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:45,101 INFO L424 AbstractCegarLoop]: === Iteration 45 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:45,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:45,102 INFO L82 PathProgramCache]: Analyzing trace with hash -517247816, now seen corresponding path program 1 times [2018-10-27 04:46:45,102 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:45,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:45,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:45,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:45,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:45,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:45,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-27 04:46:45,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 04:46:45,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 04:46:45,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:46:45,498 INFO L87 Difference]: Start difference. First operand 409 states and 449 transitions. Second operand 17 states. [2018-10-27 04:46:46,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:46,473 INFO L93 Difference]: Finished difference Result 461 states and 512 transitions. [2018-10-27 04:46:46,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 04:46:46,476 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-10-27 04:46:46,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:46,477 INFO L225 Difference]: With dead ends: 461 [2018-10-27 04:46:46,477 INFO L226 Difference]: Without dead ends: 461 [2018-10-27 04:46:46,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=984, Unknown=0, NotChecked=0, Total=1122 [2018-10-27 04:46:46,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-10-27 04:46:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 420. [2018-10-27 04:46:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-10-27 04:46:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 464 transitions. [2018-10-27 04:46:46,488 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 464 transitions. Word has length 93 [2018-10-27 04:46:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:46,488 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 464 transitions. [2018-10-27 04:46:46,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 04:46:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 464 transitions. [2018-10-27 04:46:46,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-27 04:46:46,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:46,489 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:46,489 INFO L424 AbstractCegarLoop]: === Iteration 46 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:46,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:46,489 INFO L82 PathProgramCache]: Analyzing trace with hash -517247815, now seen corresponding path program 1 times [2018-10-27 04:46:46,489 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:46,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:46,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:46,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:46,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:46,833 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-27 04:46:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:47,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:47,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-10-27 04:46:47,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 04:46:47,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 04:46:47,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:46:47,085 INFO L87 Difference]: Start difference. First operand 420 states and 464 transitions. Second operand 18 states. [2018-10-27 04:46:48,027 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 04:46:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:48,446 INFO L93 Difference]: Finished difference Result 468 states and 519 transitions. [2018-10-27 04:46:48,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-27 04:46:48,448 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2018-10-27 04:46:48,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:48,449 INFO L225 Difference]: With dead ends: 468 [2018-10-27 04:46:48,449 INFO L226 Difference]: Without dead ends: 468 [2018-10-27 04:46:48,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2018-10-27 04:46:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-27 04:46:48,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 420. [2018-10-27 04:46:48,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-10-27 04:46:48,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 463 transitions. [2018-10-27 04:46:48,456 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 463 transitions. Word has length 93 [2018-10-27 04:46:48,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:48,457 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 463 transitions. [2018-10-27 04:46:48,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 04:46:48,457 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 463 transitions. [2018-10-27 04:46:48,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-27 04:46:48,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:48,458 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:48,458 INFO L424 AbstractCegarLoop]: === Iteration 47 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:48,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:48,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1776812932, now seen corresponding path program 1 times [2018-10-27 04:46:48,458 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:48,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:48,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:48,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:48,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:48,737 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 04:46:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:49,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:49,064 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:49,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:49,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:49,314 INFO L477 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-10-27 04:46:49,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:49,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:49,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-10-27 04:46:49,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 37 [2018-10-27 04:46:49,390 INFO L477 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-10-27 04:46:49,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:49,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:49,410 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-10-27 04:46:49,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-10-27 04:46:49,433 INFO L477 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 32 treesize of output 32 [2018-10-27 04:46:49,437 INFO L477 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 24 treesize of output 5 [2018-10-27 04:46:49,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:49,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:49,445 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-10-27 04:46:49,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-10-27 04:46:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:49,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:49,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2018-10-27 04:46:49,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 04:46:49,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 04:46:49,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-10-27 04:46:49,477 INFO L87 Difference]: Start difference. First operand 420 states and 463 transitions. Second operand 21 states. [2018-10-27 04:46:49,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:49,997 INFO L93 Difference]: Finished difference Result 422 states and 468 transitions. [2018-10-27 04:46:49,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 04:46:49,999 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 95 [2018-10-27 04:46:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:50,001 INFO L225 Difference]: With dead ends: 422 [2018-10-27 04:46:50,001 INFO L226 Difference]: Without dead ends: 422 [2018-10-27 04:46:50,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2018-10-27 04:46:50,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-10-27 04:46:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 419. [2018-10-27 04:46:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-10-27 04:46:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 462 transitions. [2018-10-27 04:46:50,006 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 462 transitions. Word has length 95 [2018-10-27 04:46:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:50,006 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 462 transitions. [2018-10-27 04:46:50,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 04:46:50,007 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 462 transitions. [2018-10-27 04:46:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-27 04:46:50,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:50,007 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:50,008 INFO L424 AbstractCegarLoop]: === Iteration 48 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:50,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1776812933, now seen corresponding path program 1 times [2018-10-27 04:46:50,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:50,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:50,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:50,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:50,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:50,609 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-10-27 04:46:51,028 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2018-10-27 04:46:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:51,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:51,155 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:51,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:51,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:51,302 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:51,304 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:51,304 INFO L477 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-10-27 04:46:51,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:51,313 INFO L477 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 22 treesize of output 29 [2018-10-27 04:46:51,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:51,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:51,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:39 [2018-10-27 04:46:51,408 INFO L477 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 40 treesize of output 48 [2018-10-27 04:46:51,411 INFO L477 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 41 treesize of output 40 [2018-10-27 04:46:51,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:51,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:51,638 INFO L477 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 41 treesize of output 49 [2018-10-27 04:46:51,642 INFO L477 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 42 treesize of output 41 [2018-10-27 04:46:51,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:51,665 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:51,673 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-10-27 04:46:51,673 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:62 [2018-10-27 04:46:51,711 INFO L477 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 46 treesize of output 44 [2018-10-27 04:46:51,713 INFO L477 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 40 treesize of output 29 [2018-10-27 04:46:51,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:51,726 INFO L477 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 36 treesize of output 16 [2018-10-27 04:46:51,727 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:51,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:51,747 INFO L477 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 41 treesize of output 39 [2018-10-27 04:46:51,750 INFO L477 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 35 treesize of output 24 [2018-10-27 04:46:51,750 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:51,763 INFO L477 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 15 [2018-10-27 04:46:51,764 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:51,775 INFO L477 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 31 treesize of output 11 [2018-10-27 04:46:51,775 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:51,782 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:51,787 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-10-27 04:46:51,787 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:80, output treesize:20 [2018-10-27 04:46:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:51,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:51,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 26 [2018-10-27 04:46:51,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-27 04:46:51,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-27 04:46:51,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=639, Unknown=1, NotChecked=0, Total=702 [2018-10-27 04:46:51,840 INFO L87 Difference]: Start difference. First operand 419 states and 462 transitions. Second operand 27 states. [2018-10-27 04:46:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:53,280 INFO L93 Difference]: Finished difference Result 440 states and 487 transitions. [2018-10-27 04:46:53,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 04:46:53,281 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 95 [2018-10-27 04:46:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:53,283 INFO L225 Difference]: With dead ends: 440 [2018-10-27 04:46:53,283 INFO L226 Difference]: Without dead ends: 440 [2018-10-27 04:46:53,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=264, Invalid=1456, Unknown=2, NotChecked=0, Total=1722 [2018-10-27 04:46:53,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-27 04:46:53,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 418. [2018-10-27 04:46:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-10-27 04:46:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 461 transitions. [2018-10-27 04:46:53,288 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 461 transitions. Word has length 95 [2018-10-27 04:46:53,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:53,293 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 461 transitions. [2018-10-27 04:46:53,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-27 04:46:53,293 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 461 transitions. [2018-10-27 04:46:53,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-27 04:46:53,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:53,294 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:53,294 INFO L424 AbstractCegarLoop]: === Iteration 49 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:53,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:53,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1836520544, now seen corresponding path program 1 times [2018-10-27 04:46:53,294 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:53,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:53,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:53,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:53,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:53,861 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 04:46:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:54,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:46:54,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-10-27 04:46:54,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 04:46:54,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 04:46:54,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2018-10-27 04:46:54,393 INFO L87 Difference]: Start difference. First operand 418 states and 461 transitions. Second operand 26 states. [2018-10-27 04:46:55,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:46:55,851 INFO L93 Difference]: Finished difference Result 446 states and 491 transitions. [2018-10-27 04:46:55,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-27 04:46:55,852 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 95 [2018-10-27 04:46:55,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:46:55,854 INFO L225 Difference]: With dead ends: 446 [2018-10-27 04:46:55,854 INFO L226 Difference]: Without dead ends: 446 [2018-10-27 04:46:55,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=257, Invalid=2605, Unknown=0, NotChecked=0, Total=2862 [2018-10-27 04:46:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-10-27 04:46:55,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 418. [2018-10-27 04:46:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-10-27 04:46:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 460 transitions. [2018-10-27 04:46:55,862 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 460 transitions. Word has length 95 [2018-10-27 04:46:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:46:55,862 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 460 transitions. [2018-10-27 04:46:55,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-27 04:46:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 460 transitions. [2018-10-27 04:46:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-27 04:46:55,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:46:55,863 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:46:55,863 INFO L424 AbstractCegarLoop]: === Iteration 50 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:46:55,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:46:55,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1097562055, now seen corresponding path program 1 times [2018-10-27 04:46:55,864 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:46:55,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:46:55,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:55,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:55,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:46:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 04:46:56,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:46:56,576 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:46:56,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:46:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:46:56,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:46:56,654 INFO L477 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-10-27 04:46:56,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:46:56,770 INFO L477 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-10-27 04:46:56,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-10-27 04:46:56,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:46:56,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:46:56,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:20 [2018-10-27 04:46:56,835 INFO L477 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 25 treesize of output 20 [2018-10-27 04:46:56,838 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:56,839 INFO L477 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 20 treesize of output 29 [2018-10-27 04:46:56,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-10-27 04:46:56,908 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:56,910 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:56,912 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:56,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-27 04:46:56,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:43 [2018-10-27 04:46:56,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:46:56,967 INFO L477 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-10-27 04:46:56,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-10-27 04:46:56,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:46:56,988 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:56,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:57,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:57,005 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:59 [2018-10-27 04:46:57,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 59 [2018-10-27 04:46:57,135 INFO L477 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 53 treesize of output 52 [2018-10-27 04:46:57,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:57,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 42 [2018-10-27 04:46:57,167 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:46:57,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:46:57,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-10-27 04:46:57,222 INFO L477 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-10-27 04:46:57,222 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:57,245 INFO L477 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 2 case distinctions, treesize of input 17 treesize of output 22 [2018-10-27 04:46:57,245 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 04:46:57,259 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:46:57,285 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 3 xjuncts. [2018-10-27 04:46:57,285 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:189 [2018-10-27 04:46:57,366 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:57,368 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:46:57,369 INFO L477 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 109 treesize of output 103 [2018-10-27 04:46:57,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:57,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:57,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:158, output treesize:103 [2018-10-27 04:46:57,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 104 [2018-10-27 04:46:57,558 INFO L477 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 3 [2018-10-27 04:46:57,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:57,569 INFO L477 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 82 treesize of output 72 [2018-10-27 04:46:57,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:57,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:57,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:46:57,585 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:130, output treesize:83 [2018-10-27 04:46:57,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 48 [2018-10-27 04:46:57,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:46:57,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:57,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-10-27 04:46:57,714 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:57,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2018-10-27 04:46:57,720 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:46:57,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:57,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:46:57,724 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:5 [2018-10-27 04:46:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:46:57,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:46:57,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [25] total 42 [2018-10-27 04:46:57,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-27 04:46:57,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-27 04:46:57,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1673, Unknown=0, NotChecked=0, Total=1806 [2018-10-27 04:46:57,771 INFO L87 Difference]: Start difference. First operand 418 states and 460 transitions. Second operand 43 states. [2018-10-27 04:46:59,877 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-27 04:47:01,010 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-27 04:47:02,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:02,419 INFO L93 Difference]: Finished difference Result 435 states and 481 transitions. [2018-10-27 04:47:02,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-27 04:47:02,421 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 96 [2018-10-27 04:47:02,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:02,422 INFO L225 Difference]: With dead ends: 435 [2018-10-27 04:47:02,422 INFO L226 Difference]: Without dead ends: 435 [2018-10-27 04:47:02,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 76 SyntacticMatches, 8 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=375, Invalid=4455, Unknown=0, NotChecked=0, Total=4830 [2018-10-27 04:47:02,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-10-27 04:47:02,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 418. [2018-10-27 04:47:02,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-10-27 04:47:02,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 459 transitions. [2018-10-27 04:47:02,428 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 459 transitions. Word has length 96 [2018-10-27 04:47:02,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:02,430 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 459 transitions. [2018-10-27 04:47:02,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-27 04:47:02,430 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 459 transitions. [2018-10-27 04:47:02,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-27 04:47:02,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:02,431 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:47:02,432 INFO L424 AbstractCegarLoop]: === Iteration 51 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:47:02,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:02,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1744076093, now seen corresponding path program 1 times [2018-10-27 04:47:02,436 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:47:02,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:47:02,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:02,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:02,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:47:02,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:02,940 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:02,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:02,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:03,002 INFO L477 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-10-27 04:47:03,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:47:03,104 INFO L477 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-10-27 04:47:03,106 INFO L477 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-10-27 04:47:03,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-10-27 04:47:03,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-10-27 04:47:03,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-10-27 04:47:03,166 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:47:03,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 04:47:03,186 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:47:03,214 INFO L477 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-10-27 04:47:03,216 INFO L477 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-10-27 04:47:03,217 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,220 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,233 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 2 xjuncts. [2018-10-27 04:47:03,233 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:37, output treesize:53 [2018-10-27 04:47:03,321 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:03,345 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:03,347 INFO L477 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 35 treesize of output 29 [2018-10-27 04:47:03,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:29 [2018-10-27 04:47:03,596 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:03,599 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:03,601 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:03,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2018-10-27 04:47:03,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:67 [2018-10-27 04:47:03,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 79 [2018-10-27 04:47:03,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-10-27 04:47:03,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 59 [2018-10-27 04:47:03,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-10-27 04:47:03,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,851 INFO L477 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 48 treesize of output 47 [2018-10-27 04:47:03,852 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,872 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-10-27 04:47:03,872 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:98, output treesize:90 [2018-10-27 04:47:03,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 54 [2018-10-27 04:47:03,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2018-10-27 04:47:03,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-10-27 04:47:03,943 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,956 INFO L477 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 46 treesize of output 26 [2018-10-27 04:47:03,957 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:03,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:03,975 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:108, output treesize:78 [2018-10-27 04:47:04,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 76 [2018-10-27 04:47:04,079 INFO L477 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 67 treesize of output 58 [2018-10-27 04:47:04,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:04,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-10-27 04:47:04,101 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:04,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 26 [2018-10-27 04:47:04,123 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:04,140 INFO L477 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 44 treesize of output 33 [2018-10-27 04:47:04,141 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:04,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-10-27 04:47:04,156 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:04,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 04:47:04,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-10-27 04:47:04,186 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:82, output treesize:49 [2018-10-27 04:47:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:47:04,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:47:04,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 43 [2018-10-27 04:47:04,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-27 04:47:04,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-27 04:47:04,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1774, Unknown=1, NotChecked=0, Total=1892 [2018-10-27 04:47:04,344 INFO L87 Difference]: Start difference. First operand 418 states and 459 transitions. Second operand 44 states. [2018-10-27 04:47:07,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:07,914 INFO L93 Difference]: Finished difference Result 713 states and 796 transitions. [2018-10-27 04:47:07,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-27 04:47:07,915 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 99 [2018-10-27 04:47:07,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:07,917 INFO L225 Difference]: With dead ends: 713 [2018-10-27 04:47:07,917 INFO L226 Difference]: Without dead ends: 713 [2018-10-27 04:47:07,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1868 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=579, Invalid=7076, Unknown=1, NotChecked=0, Total=7656 [2018-10-27 04:47:07,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2018-10-27 04:47:07,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 534. [2018-10-27 04:47:07,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-10-27 04:47:07,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 592 transitions. [2018-10-27 04:47:07,928 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 592 transitions. Word has length 99 [2018-10-27 04:47:07,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:07,929 INFO L481 AbstractCegarLoop]: Abstraction has 534 states and 592 transitions. [2018-10-27 04:47:07,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-27 04:47:07,929 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 592 transitions. [2018-10-27 04:47:07,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-27 04:47:07,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:07,930 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:47:07,930 INFO L424 AbstractCegarLoop]: === Iteration 52 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:47:07,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:07,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1744076094, now seen corresponding path program 1 times [2018-10-27 04:47:07,930 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:47:07,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:47:07,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:07,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:07,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:47:08,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:08,685 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:08,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:08,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:08,746 INFO L477 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-10-27 04:47:08,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:47:08,939 INFO L477 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-10-27 04:47:08,941 INFO L477 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-10-27 04:47:08,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,954 INFO L477 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-10-27 04:47:08,956 INFO L477 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-10-27 04:47:08,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:08,966 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-10-27 04:47:09,018 INFO L477 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 30 treesize of output 40 [2018-10-27 04:47:09,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2018-10-27 04:47:09,027 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:47:09,050 INFO L477 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 27 treesize of output 26 [2018-10-27 04:47:09,050 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:09,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:47:09,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-10-27 04:47:09,095 INFO L477 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-10-27 04:47:09,096 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:09,116 INFO L477 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 2 case distinctions, treesize of input 17 treesize of output 22 [2018-10-27 04:47:09,117 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:09,130 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:47:09,151 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 4 xjuncts. [2018-10-27 04:47:09,152 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:53, output treesize:165 [2018-10-27 04:47:09,232 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:09,233 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:09,233 INFO L477 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 67 treesize of output 61 [2018-10-27 04:47:09,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:09,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:09,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:106, output treesize:61 [2018-10-27 04:47:09,467 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:09,469 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:09,469 INFO L477 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 24 treesize of output 57 [2018-10-27 04:47:09,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:09,483 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:09,485 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:09,486 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:09,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-27 04:47:09,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:09,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:09,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:57 [2018-10-27 04:47:09,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 74 [2018-10-27 04:47:09,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 60 [2018-10-27 04:47:09,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:09,675 INFO L477 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 47 treesize of output 46 [2018-10-27 04:47:09,675 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:09,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:09,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 73 [2018-10-27 04:47:09,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66 [2018-10-27 04:47:09,714 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:09,745 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:09,754 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-10-27 04:47:09,754 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:88, output treesize:80 [2018-10-27 04:47:09,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 103 [2018-10-27 04:47:09,897 INFO L477 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 94 treesize of output 90 [2018-10-27 04:47:09,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:09,924 INFO L477 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 63 treesize of output 58 [2018-10-27 04:47:09,924 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:09,943 INFO L477 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 76 treesize of output 72 [2018-10-27 04:47:09,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:09,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2018-10-27 04:47:09,963 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:09,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 41 [2018-10-27 04:47:09,982 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:09,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 04:47:10,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2018-10-27 04:47:10,023 INFO L477 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 7 [2018-10-27 04:47:10,023 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,032 INFO L477 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 15 treesize of output 11 [2018-10-27 04:47:10,032 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:10,041 INFO L477 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-10-27 04:47:10,042 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,048 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2018-10-27 04:47:10,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2018-10-27 04:47:10,059 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,079 INFO L477 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 39 treesize of output 26 [2018-10-27 04:47:10,079 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,097 INFO L477 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 21 [2018-10-27 04:47:10,097 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,114 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-10-27 04:47:10,114 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,129 INFO L267 ElimStorePlain]: Start of recursive call 12: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:10,143 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-10-27 04:47:10,144 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 5 variables, input treesize:118, output treesize:14 [2018-10-27 04:47:10,293 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:47:10,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:47:10,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 52 [2018-10-27 04:47:10,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-27 04:47:10,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-27 04:47:10,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2613, Unknown=0, NotChecked=0, Total=2756 [2018-10-27 04:47:10,311 INFO L87 Difference]: Start difference. First operand 534 states and 592 transitions. Second operand 53 states. [2018-10-27 04:47:14,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:14,910 INFO L93 Difference]: Finished difference Result 614 states and 689 transitions. [2018-10-27 04:47:14,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-27 04:47:14,912 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 99 [2018-10-27 04:47:14,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:14,914 INFO L225 Difference]: With dead ends: 614 [2018-10-27 04:47:14,914 INFO L226 Difference]: Without dead ends: 614 [2018-10-27 04:47:14,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=782, Invalid=10774, Unknown=0, NotChecked=0, Total=11556 [2018-10-27 04:47:14,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-10-27 04:47:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 534. [2018-10-27 04:47:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-10-27 04:47:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 590 transitions. [2018-10-27 04:47:14,921 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 590 transitions. Word has length 99 [2018-10-27 04:47:14,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:14,921 INFO L481 AbstractCegarLoop]: Abstraction has 534 states and 590 transitions. [2018-10-27 04:47:14,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-27 04:47:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 590 transitions. [2018-10-27 04:47:14,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-27 04:47:14,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:14,922 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:14,923 INFO L424 AbstractCegarLoop]: === Iteration 53 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:47:14,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:14,923 INFO L82 PathProgramCache]: Analyzing trace with hash 480462820, now seen corresponding path program 2 times [2018-10-27 04:47:14,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:47:14,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:47:14,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:14,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:14,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:47:16,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:16,223 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:16,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 04:47:16,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 04:47:16,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:16,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:16,338 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse1 (store .cse0 |create_data_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse1 |c_create_data_#t~malloc20.base|) 0) (= |c_#valid| (store .cse1 |c_create_data_#t~malloc20.base| 1)) (= 1 (select .cse1 create_data_~data~0.base)))))) is different from true [2018-10-27 04:47:16,341 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (create_data_~nextData~0.base Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse1 (store .cse0 |create_data_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= 0 (select .cse1 create_data_~nextData~0.base)) (= |c_#valid| (store .cse1 create_data_~nextData~0.base 1)) (= 1 (select .cse1 create_data_~data~0.base)))))) is different from true [2018-10-27 04:47:16,348 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (create_data_~nextData~0.base Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse1 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse0 (store .cse1 |create_data_#t~malloc6.base| 1))) (and (= |c_#valid| (store (store .cse0 create_data_~nextData~0.base 1) |c_create_data_#t~malloc20.base| 1)) (= 0 (select .cse1 |create_data_#t~malloc6.base|)) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= 0 (select .cse0 create_data_~nextData~0.base)) (= 1 (select .cse0 create_data_~data~0.base)))))) is different from true [2018-10-27 04:47:16,351 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_subst_1 Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse1 (store .cse0 |create_data_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= (store (store .cse1 v_subst_1 1) c_create_data_~nextData~0.base 1) |c_#valid|) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= 0 (select .cse1 v_subst_1)) (= 1 (select .cse1 create_data_~data~0.base)))))) is different from true [2018-10-27 04:47:16,437 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,439 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,441 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 54 [2018-10-27 04:47:16,469 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,471 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,472 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,474 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:16,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 62 [2018-10-27 04:47:16,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 57 [2018-10-27 04:47:16,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 50 [2018-10-27 04:47:16,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,509 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:16,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:16,531 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:61, output treesize:50 [2018-10-27 04:47:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 18 not checked. [2018-10-27 04:47:16,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:47:16,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2018-10-27 04:47:16,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 04:47:16,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 04:47:16,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=336, Unknown=4, NotChecked=172, Total=650 [2018-10-27 04:47:16,601 INFO L87 Difference]: Start difference. First operand 534 states and 590 transitions. Second operand 26 states. [2018-10-27 04:47:20,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:20,040 INFO L93 Difference]: Finished difference Result 618 states and 686 transitions. [2018-10-27 04:47:20,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 04:47:20,041 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 97 [2018-10-27 04:47:20,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:20,042 INFO L225 Difference]: With dead ends: 618 [2018-10-27 04:47:20,043 INFO L226 Difference]: Without dead ends: 618 [2018-10-27 04:47:20,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=307, Invalid=1022, Unknown=19, NotChecked=292, Total=1640 [2018-10-27 04:47:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-10-27 04:47:20,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 590. [2018-10-27 04:47:20,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-10-27 04:47:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 651 transitions. [2018-10-27 04:47:20,053 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 651 transitions. Word has length 97 [2018-10-27 04:47:20,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:20,053 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 651 transitions. [2018-10-27 04:47:20,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-27 04:47:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 651 transitions. [2018-10-27 04:47:20,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-27 04:47:20,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:20,054 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:20,055 INFO L424 AbstractCegarLoop]: === Iteration 54 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:47:20,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:20,055 INFO L82 PathProgramCache]: Analyzing trace with hash 480462821, now seen corresponding path program 2 times [2018-10-27 04:47:20,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:47:20,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:47:20,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:20,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:20,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:20,317 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 04:47:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:47:21,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:21,556 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:21,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 04:47:21,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 04:47:21,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:21,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:21,613 INFO L477 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-10-27 04:47:21,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:21,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:21,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:47:21,756 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse1 (store .cse0 |create_data_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base 16) |create_data_#t~malloc6.base| 80) |c_create_data_#t~malloc20.base| 16)) (= (select .cse1 |c_create_data_#t~malloc20.base|) 0) (= 1 (select .cse1 create_data_~data~0.base)))))) is different from true [2018-10-27 04:47:21,759 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (create_data_~nextData~0.base Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse1 (store .cse0 |create_data_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= 0 (select .cse1 create_data_~nextData~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base 16) |create_data_#t~malloc6.base| 80) create_data_~nextData~0.base 16)) (= 1 (select .cse1 create_data_~data~0.base)))))) is different from true [2018-10-27 04:47:21,768 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (create_data_~nextData~0.base Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse1 (store .cse0 |create_data_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= 0 (select .cse1 create_data_~nextData~0.base)) (= (store (store (store (store |c_old(#length)| create_data_~data~0.base 16) |create_data_#t~malloc6.base| 80) create_data_~nextData~0.base 16) |c_create_data_#t~malloc20.base| 16) |c_#length|) (= 1 (select .cse1 create_data_~data~0.base)))))) is different from true [2018-10-27 04:47:21,771 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_subst_2 Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse1 (store .cse0 |create_data_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= 0 (select .cse1 v_subst_2)) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store (store |c_old(#length)| create_data_~data~0.base 16) |create_data_#t~malloc6.base| 80) v_subst_2 16) c_create_data_~nextData~0.base 16)) (= 1 (select .cse1 create_data_~data~0.base)))))) is different from true [2018-10-27 04:47:21,835 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,837 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-10-27 04:47:21,840 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,842 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,843 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 55 [2018-10-27 04:47:21,846 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,847 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,848 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 69 [2018-10-27 04:47:21,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 58 [2018-10-27 04:47:21,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-27 04:47:21,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:21,935 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:21,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:21,984 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,985 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,987 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:21,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-10-27 04:47:22,003 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,004 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,005 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,007 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:22,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-10-27 04:47:22,008 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,015 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:22,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-10-27 04:47:22,041 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:69, output treesize:138 [2018-10-27 04:47:23,676 WARN L179 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2018-10-27 04:47:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 18 not checked. [2018-10-27 04:47:23,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:47:23,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-10-27 04:47:23,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-27 04:47:23,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-27 04:47:23,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=448, Unknown=4, NotChecked=188, Total=756 [2018-10-27 04:47:23,725 INFO L87 Difference]: Start difference. First operand 590 states and 651 transitions. Second operand 28 states. [2018-10-27 04:47:24,711 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-10-27 04:47:25,341 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2018-10-27 04:47:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:27,542 INFO L93 Difference]: Finished difference Result 669 states and 750 transitions. [2018-10-27 04:47:27,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 04:47:27,549 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 97 [2018-10-27 04:47:27,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:27,551 INFO L225 Difference]: With dead ends: 669 [2018-10-27 04:47:27,551 INFO L226 Difference]: Without dead ends: 669 [2018-10-27 04:47:27,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 100 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=225, Invalid=1036, Unknown=15, NotChecked=284, Total=1560 [2018-10-27 04:47:27,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2018-10-27 04:47:27,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 590. [2018-10-27 04:47:27,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-10-27 04:47:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 649 transitions. [2018-10-27 04:47:27,557 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 649 transitions. Word has length 97 [2018-10-27 04:47:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:27,558 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 649 transitions. [2018-10-27 04:47:27,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-27 04:47:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 649 transitions. [2018-10-27 04:47:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-27 04:47:27,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:27,559 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:47:27,559 INFO L424 AbstractCegarLoop]: === Iteration 55 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:47:27,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:27,559 INFO L82 PathProgramCache]: Analyzing trace with hash 736037482, now seen corresponding path program 1 times [2018-10-27 04:47:27,559 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:47:27,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:47:27,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:27,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:27,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:47:28,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:28,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-10-27 04:47:28,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 04:47:28,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 04:47:28,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2018-10-27 04:47:28,178 INFO L87 Difference]: Start difference. First operand 590 states and 649 transitions. Second operand 26 states. [2018-10-27 04:47:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:29,611 INFO L93 Difference]: Finished difference Result 610 states and 669 transitions. [2018-10-27 04:47:29,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-27 04:47:29,614 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 100 [2018-10-27 04:47:29,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:29,615 INFO L225 Difference]: With dead ends: 610 [2018-10-27 04:47:29,615 INFO L226 Difference]: Without dead ends: 610 [2018-10-27 04:47:29,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=263, Invalid=2817, Unknown=0, NotChecked=0, Total=3080 [2018-10-27 04:47:29,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-10-27 04:47:29,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 590. [2018-10-27 04:47:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-10-27 04:47:29,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 648 transitions. [2018-10-27 04:47:29,622 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 648 transitions. Word has length 100 [2018-10-27 04:47:29,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:29,622 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 648 transitions. [2018-10-27 04:47:29,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-27 04:47:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 648 transitions. [2018-10-27 04:47:29,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-27 04:47:29,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:29,623 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:47:29,623 INFO L424 AbstractCegarLoop]: === Iteration 56 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:47:29,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:29,624 INFO L82 PathProgramCache]: Analyzing trace with hash 898420782, now seen corresponding path program 1 times [2018-10-27 04:47:29,624 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:47:29,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:47:29,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:29,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:29,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:47:29,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:29,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-10-27 04:47:29,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 04:47:29,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 04:47:29,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:47:29,888 INFO L87 Difference]: Start difference. First operand 590 states and 648 transitions. Second operand 18 states. [2018-10-27 04:47:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:30,697 INFO L93 Difference]: Finished difference Result 630 states and 692 transitions. [2018-10-27 04:47:30,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 04:47:30,699 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 99 [2018-10-27 04:47:30,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:30,701 INFO L225 Difference]: With dead ends: 630 [2018-10-27 04:47:30,701 INFO L226 Difference]: Without dead ends: 630 [2018-10-27 04:47:30,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2018-10-27 04:47:30,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-10-27 04:47:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 590. [2018-10-27 04:47:30,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-10-27 04:47:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 647 transitions. [2018-10-27 04:47:30,708 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 647 transitions. Word has length 99 [2018-10-27 04:47:30,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:30,708 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 647 transitions. [2018-10-27 04:47:30,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 04:47:30,708 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 647 transitions. [2018-10-27 04:47:30,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-27 04:47:30,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:30,710 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:30,710 INFO L424 AbstractCegarLoop]: === Iteration 57 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:47:30,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:30,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1003347013, now seen corresponding path program 1 times [2018-10-27 04:47:30,711 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:47:30,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:47:30,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:30,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:30,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-10-27 04:47:30,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:30,899 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:30,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:30,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:31,485 INFO L477 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-10-27 04:47:31,495 INFO L477 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-10-27 04:47:31,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-10-27 04:47:31,625 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:31,627 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:31,628 INFO L477 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-10-27 04:47:31,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-10-27 04:47:31,665 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-10-27 04:47:31,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:47:31,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:12 [2018-10-27 04:47:31,692 INFO L477 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-10-27 04:47:31,694 INFO L477 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-10-27 04:47:31,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:31,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-10-27 04:47:31,720 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 114 proven. 7 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-27 04:47:31,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:47:31,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 24 [2018-10-27 04:47:31,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-27 04:47:31,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-27 04:47:31,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-10-27 04:47:31,737 INFO L87 Difference]: Start difference. First operand 590 states and 647 transitions. Second operand 24 states. [2018-10-27 04:47:32,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:32,595 INFO L93 Difference]: Finished difference Result 603 states and 654 transitions. [2018-10-27 04:47:32,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 04:47:32,597 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 174 [2018-10-27 04:47:32,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:32,598 INFO L225 Difference]: With dead ends: 603 [2018-10-27 04:47:32,599 INFO L226 Difference]: Without dead ends: 603 [2018-10-27 04:47:32,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 168 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2018-10-27 04:47:32,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-10-27 04:47:32,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 590. [2018-10-27 04:47:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-10-27 04:47:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 641 transitions. [2018-10-27 04:47:32,605 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 641 transitions. Word has length 174 [2018-10-27 04:47:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:32,605 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 641 transitions. [2018-10-27 04:47:32,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-27 04:47:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 641 transitions. [2018-10-27 04:47:32,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-27 04:47:32,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:32,606 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:32,606 INFO L424 AbstractCegarLoop]: === Iteration 58 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:47:32,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:32,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2131689708, now seen corresponding path program 2 times [2018-10-27 04:47:32,606 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:47:32,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:47:32,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:32,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:32,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:47:33,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:33,806 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:33,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 04:47:33,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 04:47:33,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:33,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:34,003 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (and (= 0 (select (store |c_old(#valid)| |create_data_#t~malloc5.base| 1) |create_data_#t~malloc6.base|)) (= (store (store |c_old(#length)| |create_data_#t~malloc5.base| 16) |create_data_#t~malloc6.base| 80) |c_#length|))) is different from true [2018-10-27 04:47:34,030 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (and (= 0 (select (store |c_old(#valid)| |create_data_#t~malloc5.base| 1) |create_data_#t~malloc6.base|)) (= |c_#length| (store (store (store |c_old(#length)| |create_data_#t~malloc5.base| 16) |create_data_#t~malloc6.base| 80) |c_create_data_#t~malloc20.base| 16)))) is different from true [2018-10-27 04:47:34,032 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~nextData~0.base Int) (|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (and (= 0 (select (store |c_old(#valid)| |create_data_#t~malloc5.base| 1) |create_data_#t~malloc6.base|)) (= (store (store (store |c_old(#length)| |create_data_#t~malloc5.base| 16) |create_data_#t~malloc6.base| 80) create_data_~nextData~0.base 16) |c_#length|))) is different from true [2018-10-27 04:47:34,039 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~nextData~0.base Int) (|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (and (= (store (store (store (store |c_old(#length)| |create_data_#t~malloc5.base| 16) |create_data_#t~malloc6.base| 80) create_data_~nextData~0.base 16) |c_create_data_#t~malloc20.base| 16) |c_#length|) (= 0 (select (store |c_old(#valid)| |create_data_#t~malloc5.base| 1) |create_data_#t~malloc6.base|)))) is different from true [2018-10-27 04:47:34,042 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int) (v_subst_3 Int) (|create_data_#t~malloc6.base| Int)) (and (= 0 (select (store |c_old(#valid)| |create_data_#t~malloc5.base| 1) |create_data_#t~malloc6.base|)) (= |c_#length| (store (store (store (store |c_old(#length)| |create_data_#t~malloc5.base| 16) |create_data_#t~malloc6.base| 80) v_subst_3 16) c_create_data_~nextData~0.base 16)))) is different from true [2018-10-27 04:47:34,120 INFO L477 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 32 [2018-10-27 04:47:34,122 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-10-27 04:47:34,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 30 [2018-10-27 04:47:34,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-10-27 04:47:34,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:34,151 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,153 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 33 [2018-10-27 04:47:34,159 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:34,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:34,196 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:34,223 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,228 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 41 [2018-10-27 04:47:34,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 56 [2018-10-27 04:47:34,253 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,257 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 63 [2018-10-27 04:47:34,272 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-10-27 04:47:34,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 45 [2018-10-27 04:47:34,372 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:34,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2018-10-27 04:47:34,524 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:34,606 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 36 [2018-10-27 04:47:34,613 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:34,665 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,668 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 42 [2018-10-27 04:47:34,674 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-10-27 04:47:34,706 INFO L267 ElimStorePlain]: Start of recursive call 8: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:34,728 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:34,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:47:34,778 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,780 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:34,780 INFO L477 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 11 treesize of output 4 [2018-10-27 04:47:34,781 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:34,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-10-27 04:47:34,805 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:44, output treesize:108 [2018-10-27 04:47:36,403 WARN L179 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2018-10-27 04:47:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 21 not checked. [2018-10-27 04:47:36,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:47:36,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2018-10-27 04:47:36,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-27 04:47:36,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-27 04:47:36,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=493, Unknown=22, NotChecked=250, Total=870 [2018-10-27 04:47:36,449 INFO L87 Difference]: Start difference. First operand 590 states and 641 transitions. Second operand 30 states. [2018-10-27 04:47:37,185 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2018-10-27 04:47:37,380 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-10-27 04:47:37,601 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2018-10-27 04:47:37,967 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-10-27 04:47:38,146 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2018-10-27 04:47:38,687 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-10-27 04:47:38,954 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2018-10-27 04:47:40,840 WARN L179 SmtUtils]: Spent 541.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-10-27 04:47:42,254 WARN L179 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-10-27 04:47:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:43,048 INFO L93 Difference]: Finished difference Result 777 states and 849 transitions. [2018-10-27 04:47:43,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-27 04:47:43,049 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 99 [2018-10-27 04:47:43,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:43,051 INFO L225 Difference]: With dead ends: 777 [2018-10-27 04:47:43,051 INFO L226 Difference]: Without dead ends: 777 [2018-10-27 04:47:43,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=388, Invalid=2192, Unknown=92, NotChecked=520, Total=3192 [2018-10-27 04:47:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2018-10-27 04:47:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 594. [2018-10-27 04:47:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-10-27 04:47:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 647 transitions. [2018-10-27 04:47:43,063 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 647 transitions. Word has length 99 [2018-10-27 04:47:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:43,063 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 647 transitions. [2018-10-27 04:47:43,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-27 04:47:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 647 transitions. [2018-10-27 04:47:43,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-27 04:47:43,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:43,064 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:47:43,064 INFO L424 AbstractCegarLoop]: === Iteration 59 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:47:43,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:43,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2131689709, now seen corresponding path program 2 times [2018-10-27 04:47:43,064 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:47:43,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:47:43,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:43,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:43,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:44,415 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:47:44,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:44,415 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:44,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 04:47:44,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 04:47:44,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:47:44,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:44,771 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse1 (store .cse0 |create_data_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= |c_#valid| (store .cse1 |c_create_data_#t~malloc20.base| 1)) (= 1 (select .cse1 create_data_~data~0.base)))))) is different from true [2018-10-27 04:47:44,774 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse1 (store .cse0 |create_data_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= |c_#valid| (store .cse1 c_create_data_~nextData~0.base 1)) (= 1 (select .cse1 create_data_~data~0.base)))))) is different from true [2018-10-27 04:47:44,809 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_subst_4 Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_4 1))) (let ((.cse1 (store .cse0 |create_data_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= (store .cse1 c_create_data_~data~0.base 1) |c_#valid|) (= 1 (select .cse1 v_subst_4)))))) is different from true [2018-10-27 04:47:44,837 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_subst_4 Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_4 1))) (let ((.cse1 (store .cse0 |create_data_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= |c_#valid| (store (store .cse1 c_create_data_~data~0.base 1) |c_create_data_#t~malloc20.base| 1)) (= 1 (select .cse1 v_subst_4)))))) is different from true [2018-10-27 04:47:44,839 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_subst_4 Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_4 1))) (let ((.cse1 (store .cse0 |create_data_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= |c_#valid| (store (store .cse1 c_create_data_~data~0.base 1) c_create_data_~nextData~0.base 1)) (= 1 (select .cse1 v_subst_4)))))) is different from true [2018-10-27 04:47:44,929 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:44,931 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:44,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2018-10-27 04:47:44,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-10-27 04:47:44,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2018-10-27 04:47:44,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2018-10-27 04:47:44,985 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:44,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:45,000 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:45,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:45,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:45,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2018-10-27 04:47:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 3 times theorem prover too weak. 27 trivial. 18 not checked. [2018-10-27 04:47:45,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:47:45,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-10-27 04:47:45,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-27 04:47:45,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-27 04:47:45,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=372, Unknown=27, NotChecked=230, Total=756 [2018-10-27 04:47:45,083 INFO L87 Difference]: Start difference. First operand 594 states and 647 transitions. Second operand 28 states. [2018-10-27 04:47:45,750 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2018-10-27 04:47:46,098 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2018-10-27 04:47:46,344 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2018-10-27 04:47:46,990 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2018-10-27 04:47:47,349 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2018-10-27 04:47:47,945 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 78 [2018-10-27 04:47:48,549 WARN L179 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2018-10-27 04:47:49,191 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2018-10-27 04:47:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:50,468 INFO L93 Difference]: Finished difference Result 614 states and 668 transitions. [2018-10-27 04:47:50,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 04:47:50,469 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 99 [2018-10-27 04:47:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:50,471 INFO L225 Difference]: With dead ends: 614 [2018-10-27 04:47:50,471 INFO L226 Difference]: Without dead ends: 614 [2018-10-27 04:47:50,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 102 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=283, Invalid=895, Unknown=102, NotChecked=360, Total=1640 [2018-10-27 04:47:50,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-10-27 04:47:50,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 579. [2018-10-27 04:47:50,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-10-27 04:47:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 630 transitions. [2018-10-27 04:47:50,485 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 630 transitions. Word has length 99 [2018-10-27 04:47:50,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:50,485 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 630 transitions. [2018-10-27 04:47:50,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-27 04:47:50,486 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 630 transitions. [2018-10-27 04:47:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-27 04:47:50,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:50,492 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:47:50,493 INFO L424 AbstractCegarLoop]: === Iteration 60 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:47:50,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:50,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1412172212, now seen corresponding path program 1 times [2018-10-27 04:47:50,493 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:47:50,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:47:50,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:50,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:47:50,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 04:47:51,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:47:51,295 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:47:51,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:51,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:47:51,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:47:51,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:47:51,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:50 [2018-10-27 04:47:51,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-10-27 04:47:51,531 INFO L477 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 39 treesize of output 27 [2018-10-27 04:47:51,532 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:51,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:51,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:51,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:32 [2018-10-27 04:47:51,595 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_105 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_105 80) |c_create_data_#t~malloc20.base| 16)) (= (select .cse0 v_arrayElimCell_105) 0) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= 0 (select (store .cse0 v_arrayElimCell_105 1) |c_create_data_#t~malloc20.base|))))) is different from true [2018-10-27 04:47:51,598 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (create_data_~nextData~0.base Int) (v_arrayElimCell_105 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= (select .cse0 v_arrayElimCell_105) 0) (= 0 (select (store .cse0 v_arrayElimCell_105 1) create_data_~nextData~0.base)) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_105 80) create_data_~nextData~0.base 16) |c_#length|)))) is different from true [2018-10-27 04:47:51,618 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:51,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-10-27 04:47:51,622 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:51,623 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:51,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-10-27 04:47:51,628 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:51,630 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:51,631 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:51,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-10-27 04:47:51,634 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,646 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,668 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:51,669 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:51,670 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:51,672 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:51,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-10-27 04:47:51,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:51,690 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:51,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:51,693 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:51,695 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:47:51,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-10-27 04:47:51,696 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,702 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:51,715 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:58, output treesize:48 [2018-10-27 04:47:51,785 INFO L477 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-10-27 04:47:51,787 INFO L477 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-10-27 04:47:51,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,803 INFO L477 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-10-27 04:47:51,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 04:47:51,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:51,819 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:59, output treesize:60 [2018-10-27 04:47:51,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-10-27 04:47:51,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 18 [2018-10-27 04:47:51,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:51,995 INFO L477 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-10-27 04:47:51,997 INFO L477 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-10-27 04:47:51,998 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:47:52,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:47:52,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:47:52,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:74, output treesize:40 [2018-10-27 04:47:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 3 not checked. [2018-10-27 04:47:52,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:47:52,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 38 [2018-10-27 04:47:52,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-27 04:47:52,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-27 04:47:52,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1171, Unknown=6, NotChecked=142, Total=1482 [2018-10-27 04:47:52,100 INFO L87 Difference]: Start difference. First operand 579 states and 630 transitions. Second operand 39 states. [2018-10-27 04:47:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:54,808 INFO L93 Difference]: Finished difference Result 695 states and 762 transitions. [2018-10-27 04:47:54,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-27 04:47:54,809 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 103 [2018-10-27 04:47:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:54,811 INFO L225 Difference]: With dead ends: 695 [2018-10-27 04:47:54,811 INFO L226 Difference]: Without dead ends: 695 [2018-10-27 04:47:54,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=527, Invalid=4030, Unknown=7, NotChecked=266, Total=4830 [2018-10-27 04:47:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-10-27 04:47:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 594. [2018-10-27 04:47:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-10-27 04:47:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 645 transitions. [2018-10-27 04:47:54,818 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 645 transitions. Word has length 103 [2018-10-27 04:47:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:54,818 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 645 transitions. [2018-10-27 04:47:54,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-27 04:47:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 645 transitions. [2018-10-27 04:47:54,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-27 04:47:54,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:54,819 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:47:54,820 INFO L424 AbstractCegarLoop]: === Iteration 61 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:47:54,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:54,820 INFO L82 PathProgramCache]: Analyzing trace with hash 796629227, now seen corresponding path program 1 times [2018-10-27 04:47:54,820 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:47:54,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:47:54,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:54,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:54,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:55,293 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-10-27 04:47:55,593 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-10-27 04:47:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:47:56,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:56,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-10-27 04:47:56,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 04:47:56,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 04:47:56,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-10-27 04:47:56,436 INFO L87 Difference]: Start difference. First operand 594 states and 645 transitions. Second operand 26 states. [2018-10-27 04:47:57,037 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-10-27 04:47:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:58,157 INFO L93 Difference]: Finished difference Result 616 states and 668 transitions. [2018-10-27 04:47:58,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-27 04:47:58,160 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 105 [2018-10-27 04:47:58,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:58,162 INFO L225 Difference]: With dead ends: 616 [2018-10-27 04:47:58,162 INFO L226 Difference]: Without dead ends: 616 [2018-10-27 04:47:58,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=174, Invalid=1548, Unknown=0, NotChecked=0, Total=1722 [2018-10-27 04:47:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-10-27 04:47:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 596. [2018-10-27 04:47:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-10-27 04:47:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 647 transitions. [2018-10-27 04:47:58,170 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 647 transitions. Word has length 105 [2018-10-27 04:47:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:58,170 INFO L481 AbstractCegarLoop]: Abstraction has 596 states and 647 transitions. [2018-10-27 04:47:58,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-27 04:47:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 647 transitions. [2018-10-27 04:47:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-27 04:47:58,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:58,171 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:47:58,171 INFO L424 AbstractCegarLoop]: === Iteration 62 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:47:58,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1074297525, now seen corresponding path program 1 times [2018-10-27 04:47:58,171 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:47:58,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:47:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:58,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:58,345 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:47:58,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:58,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:47:58,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:47:58,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:47:58,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:47:58,346 INFO L87 Difference]: Start difference. First operand 596 states and 647 transitions. Second operand 8 states. [2018-10-27 04:47:58,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:47:58,470 INFO L93 Difference]: Finished difference Result 608 states and 659 transitions. [2018-10-27 04:47:58,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:47:58,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 106 [2018-10-27 04:47:58,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:47:58,474 INFO L225 Difference]: With dead ends: 608 [2018-10-27 04:47:58,474 INFO L226 Difference]: Without dead ends: 608 [2018-10-27 04:47:58,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:47:58,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-27 04:47:58,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 600. [2018-10-27 04:47:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-10-27 04:47:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 653 transitions. [2018-10-27 04:47:58,482 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 653 transitions. Word has length 106 [2018-10-27 04:47:58,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:47:58,482 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 653 transitions. [2018-10-27 04:47:58,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:47:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 653 transitions. [2018-10-27 04:47:58,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-27 04:47:58,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:47:58,483 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:47:58,484 INFO L424 AbstractCegarLoop]: === Iteration 63 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:47:58,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:47:58,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1056515371, now seen corresponding path program 1 times [2018-10-27 04:47:58,484 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:47:58,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:47:58,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:58,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:47:58,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:47:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:47:58,737 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-27 04:47:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:47:59,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:47:59,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2018-10-27 04:47:59,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-27 04:47:59,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-27 04:47:59,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-10-27 04:47:59,439 INFO L87 Difference]: Start difference. First operand 600 states and 653 transitions. Second operand 28 states. [2018-10-27 04:48:00,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:00,937 INFO L93 Difference]: Finished difference Result 618 states and 672 transitions. [2018-10-27 04:48:00,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-27 04:48:00,939 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 107 [2018-10-27 04:48:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:00,941 INFO L225 Difference]: With dead ends: 618 [2018-10-27 04:48:00,941 INFO L226 Difference]: Without dead ends: 618 [2018-10-27 04:48:00,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=173, Invalid=1719, Unknown=0, NotChecked=0, Total=1892 [2018-10-27 04:48:00,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-10-27 04:48:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 602. [2018-10-27 04:48:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-27 04:48:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 655 transitions. [2018-10-27 04:48:00,947 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 655 transitions. Word has length 107 [2018-10-27 04:48:00,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:00,948 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 655 transitions. [2018-10-27 04:48:00,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-27 04:48:00,948 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 655 transitions. [2018-10-27 04:48:00,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-27 04:48:00,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:00,949 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:48:00,949 INFO L424 AbstractCegarLoop]: === Iteration 64 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:48:00,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:00,949 INFO L82 PathProgramCache]: Analyzing trace with hash -29269699, now seen corresponding path program 1 times [2018-10-27 04:48:00,949 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:48:00,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:48:00,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:48:00,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:00,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:48:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:01,300 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:48:01,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:01,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-10-27 04:48:01,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 04:48:01,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 04:48:01,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-10-27 04:48:01,301 INFO L87 Difference]: Start difference. First operand 602 states and 655 transitions. Second operand 23 states. [2018-10-27 04:48:02,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:02,506 INFO L93 Difference]: Finished difference Result 671 states and 728 transitions. [2018-10-27 04:48:02,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-27 04:48:02,509 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 109 [2018-10-27 04:48:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:02,510 INFO L225 Difference]: With dead ends: 671 [2018-10-27 04:48:02,511 INFO L226 Difference]: Without dead ends: 671 [2018-10-27 04:48:02,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=1871, Unknown=0, NotChecked=0, Total=2070 [2018-10-27 04:48:02,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-10-27 04:48:02,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 637. [2018-10-27 04:48:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2018-10-27 04:48:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 698 transitions. [2018-10-27 04:48:02,518 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 698 transitions. Word has length 109 [2018-10-27 04:48:02,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:02,518 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 698 transitions. [2018-10-27 04:48:02,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 04:48:02,518 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 698 transitions. [2018-10-27 04:48:02,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-27 04:48:02,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:02,519 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:48:02,519 INFO L424 AbstractCegarLoop]: === Iteration 65 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:48:02,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:02,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1129349455, now seen corresponding path program 1 times [2018-10-27 04:48:02,519 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:48:02,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:48:02,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:48:02,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:02,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:48:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:48:02,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:48:02,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 04:48:02,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:48:02,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:48:02,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:48:02,834 INFO L87 Difference]: Start difference. First operand 637 states and 698 transitions. Second operand 10 states. [2018-10-27 04:48:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:48:03,075 INFO L93 Difference]: Finished difference Result 648 states and 707 transitions. [2018-10-27 04:48:03,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:48:03,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2018-10-27 04:48:03,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:48:03,078 INFO L225 Difference]: With dead ends: 648 [2018-10-27 04:48:03,079 INFO L226 Difference]: Without dead ends: 648 [2018-10-27 04:48:03,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:48:03,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-10-27 04:48:03,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 641. [2018-10-27 04:48:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-10-27 04:48:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 703 transitions. [2018-10-27 04:48:03,085 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 703 transitions. Word has length 110 [2018-10-27 04:48:03,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:48:03,085 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 703 transitions. [2018-10-27 04:48:03,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:48:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 703 transitions. [2018-10-27 04:48:03,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-27 04:48:03,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:48:03,086 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:48:03,086 INFO L424 AbstractCegarLoop]: === Iteration 66 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:48:03,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:48:03,087 INFO L82 PathProgramCache]: Analyzing trace with hash -907360725, now seen corresponding path program 1 times [2018-10-27 04:48:03,087 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:48:03,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:48:03,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:48:03,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:03,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:48:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 04:48:03,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:48:03,991 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:48:04,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:48:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:48:04,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:48:04,056 INFO L477 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-10-27 04:48:04,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:04,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:04,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:48:04,238 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc6.base| Int)) (= |c_#valid| (store (store |c_old(#valid)| c_create_data_~data~0.base 1) |create_data_#t~malloc6.base| 1))) is different from true [2018-10-27 04:48:05,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:48:05,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:48:05,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:05,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:05,677 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-10-27 04:48:05,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2018-10-27 04:48:06,666 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:06,670 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-10-27 04:48:06,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:48:06,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:06,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:06,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:06,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2018-10-27 04:48:06,740 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:06,745 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-10-27 04:48:06,748 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:06,748 INFO L477 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 18 treesize of output 27 [2018-10-27 04:48:06,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:06,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:06,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:06,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:42 [2018-10-27 04:48:06,991 INFO L477 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-10-27 04:48:06,993 INFO L477 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-10-27 04:48:06,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:06,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:07,013 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:07,015 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:07,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 63 [2018-10-27 04:48:07,033 INFO L477 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 52 treesize of output 51 [2018-10-27 04:48:07,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:07,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:07,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:07,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:71, output treesize:68 [2018-10-27 04:48:07,188 INFO L477 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 52 treesize of output 60 [2018-10-27 04:48:07,191 INFO L477 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 53 treesize of output 52 [2018-10-27 04:48:07,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:07,225 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:07,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2018-10-27 04:48:07,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:48:07,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:48:07,285 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:07,288 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:07,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 99 [2018-10-27 04:48:07,308 INFO L477 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 84 treesize of output 78 [2018-10-27 04:48:07,308 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:07,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 79 [2018-10-27 04:48:07,387 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:07,438 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:48:07,441 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:07,442 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:07,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 147 [2018-10-27 04:48:07,484 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 04:48:07,493 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:48:07,493 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:07,837 INFO L477 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 76 treesize of output 75 [2018-10-27 04:48:07,837 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:07,986 INFO L477 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 2 case distinctions, treesize of input 85 treesize of output 92 [2018-10-27 04:48:07,987 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:08,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 82 [2018-10-27 04:48:08,120 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-10-27 04:48:08,234 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:08,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 91 [2018-10-27 04:48:08,244 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-10-27 04:48:08,475 INFO L267 ElimStorePlain]: Start of recursive call 8: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:48:08,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 16 dim-0 vars, and 6 xjuncts. [2018-10-27 04:48:08,566 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:84, output treesize:491 [2018-10-27 04:48:41,600 WARN L179 SmtUtils]: Spent 32.91 s on a formula simplification. DAG size of input: 123 DAG size of output: 103 [2018-10-27 04:48:41,608 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:41,610 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:41,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 117 [2018-10-27 04:48:41,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 48 [2018-10-27 04:48:41,624 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:41,625 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:41,627 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:41,630 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:41,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 61 [2018-10-27 04:48:41,631 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:41,639 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:41,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:41,718 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:41,719 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:41,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 108 [2018-10-27 04:48:41,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-10-27 04:48:41,748 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:41,750 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:41,752 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:48:41,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2018-10-27 04:48:41,753 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:41,760 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:41,772 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:41,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 04:48:41,865 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 17 variables, input treesize:470, output treesize:228 [2018-10-27 04:48:57,957 WARN L179 SmtUtils]: Spent 16.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2018-10-27 04:48:58,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 95 [2018-10-27 04:48:58,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-10-27 04:48:58,157 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:58,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 23 [2018-10-27 04:48:58,169 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:58,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:58,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:48:58,186 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:128, output treesize:49 [2018-10-27 04:48:58,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-10-27 04:48:58,386 INFO L477 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 5 [2018-10-27 04:48:58,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:58,396 INFO L477 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 16 treesize of output 3 [2018-10-27 04:48:58,396 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:48:58,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:58,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:48:58,408 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:55, output treesize:3 [2018-10-27 04:48:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:48:58,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:48:58,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 55 [2018-10-27 04:48:58,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-27 04:48:58,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-27 04:48:58,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2804, Unknown=9, NotChecked=106, Total=3080 [2018-10-27 04:48:58,502 INFO L87 Difference]: Start difference. First operand 641 states and 703 transitions. Second operand 56 states. [2018-10-27 04:49:00,276 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 04:49:00,543 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-27 04:49:34,150 WARN L179 SmtUtils]: Spent 32.54 s on a formula simplification. DAG size of input: 136 DAG size of output: 136 [2018-10-27 04:49:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:36,538 INFO L93 Difference]: Finished difference Result 708 states and 776 transitions. [2018-10-27 04:49:36,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-27 04:49:36,540 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-10-27 04:49:36,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:36,542 INFO L225 Difference]: With dead ends: 708 [2018-10-27 04:49:36,542 INFO L226 Difference]: Without dead ends: 708 [2018-10-27 04:49:36,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 87 SyntacticMatches, 8 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2003 ImplicationChecksByTransitivity, 87.9s TimeCoverageRelationStatistics Valid=492, Invalid=7689, Unknown=13, NotChecked=178, Total=8372 [2018-10-27 04:49:36,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-10-27 04:49:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 656. [2018-10-27 04:49:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-10-27 04:49:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 720 transitions. [2018-10-27 04:49:36,549 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 720 transitions. Word has length 110 [2018-10-27 04:49:36,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:36,550 INFO L481 AbstractCegarLoop]: Abstraction has 656 states and 720 transitions. [2018-10-27 04:49:36,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-27 04:49:36,550 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 720 transitions. [2018-10-27 04:49:36,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-27 04:49:36,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:36,551 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:49:36,551 INFO L424 AbstractCegarLoop]: === Iteration 67 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:49:36,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:36,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1936588636, now seen corresponding path program 1 times [2018-10-27 04:49:36,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:49:36,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:49:36,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:49:36,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:36,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:49:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 04:49:37,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:49:37,502 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:49:37,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:37,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:37,559 INFO L477 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-10-27 04:49:37,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:37,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:37,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:49:38,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:49:38,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:49:38,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,124 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-10-27 04:49:38,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:32 [2018-10-27 04:49:38,256 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:38,260 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-10-27 04:49:38,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:49:38,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:38,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:41 [2018-10-27 04:49:38,333 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:38,337 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-10-27 04:49:38,340 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:38,340 INFO L477 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 18 treesize of output 27 [2018-10-27 04:49:38,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:38,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:50 [2018-10-27 04:49:38,538 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:38,541 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:38,543 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:38,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 47 [2018-10-27 04:49:38,563 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:38,565 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:38,566 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:38,570 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:38,572 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:38,573 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:38,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-10-27 04:49:38,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:38,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:50 [2018-10-27 04:49:38,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 75 [2018-10-27 04:49:38,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2018-10-27 04:49:38,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70 [2018-10-27 04:49:38,721 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 04:49:38,754 INFO L477 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-10-27 04:49:38,754 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,759 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:38,772 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-10-27 04:49:38,772 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:96, output treesize:88 [2018-10-27 04:49:38,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 81 treesize of output 95 [2018-10-27 04:49:38,895 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 69 [2018-10-27 04:49:38,896 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-10-27 04:49:39,071 INFO L477 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 74 treesize of output 73 [2018-10-27 04:49:39,071 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,190 INFO L477 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 2 case distinctions, treesize of input 61 treesize of output 68 [2018-10-27 04:49:39,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,275 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:39,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 84 [2018-10-27 04:49:39,282 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-10-27 04:49:39,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-10-27 04:49:39,411 INFO L477 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-10-27 04:49:39,412 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,434 INFO L477 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 2 case distinctions, treesize of input 17 treesize of output 22 [2018-10-27 04:49:39,435 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,449 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:39,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-10-27 04:49:39,505 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:104, output treesize:515 [2018-10-27 04:49:39,686 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:39,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:39,688 INFO L477 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 107 treesize of output 101 [2018-10-27 04:49:39,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:39,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:154, output treesize:101 [2018-10-27 04:49:40,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 102 [2018-10-27 04:49:40,060 INFO L477 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 94 treesize of output 80 [2018-10-27 04:49:40,061 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:40,074 INFO L477 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-10-27 04:49:40,074 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:40,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:40,091 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:128, output treesize:81 [2018-10-27 04:49:40,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 46 [2018-10-27 04:49:40,254 INFO L477 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 16 treesize of output 3 [2018-10-27 04:49:40,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 04:49:40,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-10-27 04:49:40,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:40,274 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:3 [2018-10-27 04:49:40,346 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:49:40,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:49:40,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 54 [2018-10-27 04:49:40,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-27 04:49:40,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-27 04:49:40,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2802, Unknown=11, NotChecked=0, Total=2970 [2018-10-27 04:49:40,364 INFO L87 Difference]: Start difference. First operand 656 states and 720 transitions. Second operand 55 states. [2018-10-27 04:49:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:44,214 INFO L93 Difference]: Finished difference Result 704 states and 772 transitions. [2018-10-27 04:49:44,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-27 04:49:44,217 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 111 [2018-10-27 04:49:44,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:44,219 INFO L225 Difference]: With dead ends: 704 [2018-10-27 04:49:44,219 INFO L226 Difference]: Without dead ends: 704 [2018-10-27 04:49:44,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1959 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=468, Invalid=7177, Unknown=11, NotChecked=0, Total=7656 [2018-10-27 04:49:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-10-27 04:49:44,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 656. [2018-10-27 04:49:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-10-27 04:49:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 719 transitions. [2018-10-27 04:49:44,229 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 719 transitions. Word has length 111 [2018-10-27 04:49:44,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:44,229 INFO L481 AbstractCegarLoop]: Abstraction has 656 states and 719 transitions. [2018-10-27 04:49:44,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-27 04:49:44,229 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 719 transitions. [2018-10-27 04:49:44,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-27 04:49:44,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:44,230 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:49:44,230 INFO L424 AbstractCegarLoop]: === Iteration 68 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:49:44,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:44,231 INFO L82 PathProgramCache]: Analyzing trace with hash 475287944, now seen corresponding path program 1 times [2018-10-27 04:49:44,231 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:49:44,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:49:44,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:49:44,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:44,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:49:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:44,541 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 04:49:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 04:49:45,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:49:45,026 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:49:45,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:45,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:45,105 INFO L477 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-10-27 04:49:45,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:49:45,311 INFO L477 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-10-27 04:49:45,313 INFO L477 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-10-27 04:49:45,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-10-27 04:49:45,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-10-27 04:49:45,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-27 04:49:45,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-10-27 04:49:45,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:45,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:45,417 INFO L477 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-10-27 04:49:45,419 INFO L477 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-10-27 04:49:45,420 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,424 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,436 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 2 xjuncts. [2018-10-27 04:49:45,436 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:37, output treesize:53 [2018-10-27 04:49:45,480 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:49:45,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,511 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:45,513 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:45,513 INFO L477 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-10-27 04:49:45,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:29 [2018-10-27 04:49:45,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:45,683 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:45,684 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:45,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2018-10-27 04:49:45,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:67 [2018-10-27 04:49:45,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 59 [2018-10-27 04:49:45,841 INFO L477 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 52 treesize of output 51 [2018-10-27 04:49:45,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 79 [2018-10-27 04:49:45,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-10-27 04:49:45,889 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:45,928 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-10-27 04:49:45,928 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:98, output treesize:90 [2018-10-27 04:49:46,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 54 [2018-10-27 04:49:46,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-10-27 04:49:46,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 30 [2018-10-27 04:49:46,041 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,054 INFO L477 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 46 treesize of output 26 [2018-10-27 04:49:46,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:46,072 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:108, output treesize:78 [2018-10-27 04:49:46,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 76 [2018-10-27 04:49:46,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 42 [2018-10-27 04:49:46,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2018-10-27 04:49:46,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:46,205 INFO L477 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 32 treesize of output 23 [2018-10-27 04:49:46,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-10-27 04:49:46,223 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:46,239 INFO L477 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 36 treesize of output 27 [2018-10-27 04:49:46,239 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:46,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:46,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:46,271 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:82, output treesize:49 [2018-10-27 04:49:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:49:46,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:49:46,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 46 [2018-10-27 04:49:46,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-27 04:49:46,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-27 04:49:46,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=2033, Unknown=1, NotChecked=0, Total=2162 [2018-10-27 04:49:46,483 INFO L87 Difference]: Start difference. First operand 656 states and 719 transitions. Second operand 47 states. [2018-10-27 04:49:47,685 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-27 04:49:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:51,115 INFO L93 Difference]: Finished difference Result 959 states and 1047 transitions. [2018-10-27 04:49:51,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-27 04:49:51,117 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 114 [2018-10-27 04:49:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:51,119 INFO L225 Difference]: With dead ends: 959 [2018-10-27 04:49:51,119 INFO L226 Difference]: Without dead ends: 959 [2018-10-27 04:49:51,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2929 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=758, Invalid=9747, Unknown=1, NotChecked=0, Total=10506 [2018-10-27 04:49:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2018-10-27 04:49:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 787. [2018-10-27 04:49:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-10-27 04:49:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 865 transitions. [2018-10-27 04:49:51,135 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 865 transitions. Word has length 114 [2018-10-27 04:49:51,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:51,136 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 865 transitions. [2018-10-27 04:49:51,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-27 04:49:51,136 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 865 transitions. [2018-10-27 04:49:51,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-27 04:49:51,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:51,137 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:49:51,137 INFO L424 AbstractCegarLoop]: === Iteration 69 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:49:51,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:51,137 INFO L82 PathProgramCache]: Analyzing trace with hash 475287945, now seen corresponding path program 1 times [2018-10-27 04:49:51,137 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:49:51,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:49:51,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:49:51,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:51,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:49:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:49:52,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:49:52,124 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:49:52,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:49:52,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:49:52,199 INFO L477 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-10-27 04:49:52,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:49:52,733 INFO L477 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-10-27 04:49:52,735 INFO L477 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-10-27 04:49:52,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,748 INFO L477 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-10-27 04:49:52,750 INFO L477 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-10-27 04:49:52,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,763 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-10-27 04:49:52,819 INFO L477 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 30 treesize of output 40 [2018-10-27 04:49:52,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2018-10-27 04:49:52,833 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:52,856 INFO L477 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 27 treesize of output 26 [2018-10-27 04:49:52,856 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:52,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-10-27 04:49:52,903 INFO L477 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-10-27 04:49:52,903 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:52,926 INFO L477 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 2 case distinctions, treesize of input 17 treesize of output 22 [2018-10-27 04:49:52,927 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 04:49:52,944 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:49:52,969 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 4 xjuncts. [2018-10-27 04:49:52,969 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:53, output treesize:165 [2018-10-27 04:49:53,101 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:53,129 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:53,131 INFO L477 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 67 treesize of output 61 [2018-10-27 04:49:53,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:106, output treesize:61 [2018-10-27 04:49:53,692 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:53,694 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:53,695 INFO L477 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 24 treesize of output 57 [2018-10-27 04:49:53,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,711 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:53,714 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:53,715 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:49:53,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-27 04:49:53,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:57 [2018-10-27 04:49:53,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 73 [2018-10-27 04:49:53,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66 [2018-10-27 04:49:53,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 76 [2018-10-27 04:49:53,960 INFO L477 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 69 treesize of output 68 [2018-10-27 04:49:53,961 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:53,992 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-10-27 04:49:53,992 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:88, output treesize:82 [2018-10-27 04:49:54,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 105 [2018-10-27 04:49:54,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 66 [2018-10-27 04:49:54,184 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:54,206 INFO L477 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 82 treesize of output 75 [2018-10-27 04:49:54,206 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,225 INFO L477 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 75 treesize of output 71 [2018-10-27 04:49:54,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2018-10-27 04:49:54,245 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:49:54,262 INFO L477 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 55 treesize of output 51 [2018-10-27 04:49:54,263 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 04:49:54,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2018-10-27 04:49:54,303 INFO L477 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 17 treesize of output 13 [2018-10-27 04:49:54,303 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,313 INFO L477 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 9 treesize of output 1 [2018-10-27 04:49:54,313 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,326 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2018-10-27 04:49:54,361 INFO L477 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 39 treesize of output 35 [2018-10-27 04:49:54,361 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,384 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-10-27 04:49:54,384 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,406 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:49:54,420 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-10-27 04:49:54,420 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:120, output treesize:14 [2018-10-27 04:49:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:49:54,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:49:54,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 55 [2018-10-27 04:49:54,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-27 04:49:54,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-27 04:49:54,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2936, Unknown=0, NotChecked=0, Total=3080 [2018-10-27 04:49:54,606 INFO L87 Difference]: Start difference. First operand 787 states and 865 transitions. Second operand 56 states. [2018-10-27 04:49:59,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:49:59,129 INFO L93 Difference]: Finished difference Result 952 states and 1040 transitions. [2018-10-27 04:49:59,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-27 04:49:59,132 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 114 [2018-10-27 04:49:59,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:49:59,134 INFO L225 Difference]: With dead ends: 952 [2018-10-27 04:49:59,135 INFO L226 Difference]: Without dead ends: 952 [2018-10-27 04:49:59,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1864 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=557, Invalid=7815, Unknown=0, NotChecked=0, Total=8372 [2018-10-27 04:49:59,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-10-27 04:49:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 787. [2018-10-27 04:49:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-10-27 04:49:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 865 transitions. [2018-10-27 04:49:59,144 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 865 transitions. Word has length 114 [2018-10-27 04:49:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:49:59,144 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 865 transitions. [2018-10-27 04:49:59,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-27 04:49:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 865 transitions. [2018-10-27 04:49:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-27 04:49:59,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:49:59,145 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:49:59,146 INFO L424 AbstractCegarLoop]: === Iteration 70 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:49:59,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:49:59,146 INFO L82 PathProgramCache]: Analyzing trace with hash 720483055, now seen corresponding path program 3 times [2018-10-27 04:49:59,146 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:49:59,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:49:59,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:49:59,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:49:59,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:49:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:01,229 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2018-10-27 04:50:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:50:01,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:50:01,444 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:50:01,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:50:01,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 04:50:01,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:50:01,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:01,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:01,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:01,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-10-27 04:50:01,919 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| |create_data_#t~malloc5.base| 1))) (and (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= 0 (select |c_old(#valid)| |create_data_#t~malloc5.base|)) (= |c_#valid| (store .cse0 |create_data_#t~malloc6.base| 1))))) is different from true [2018-10-27 04:50:01,939 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| |create_data_#t~malloc5.base| 1))) (and (= |c_#valid| (store (store .cse0 |create_data_#t~malloc6.base| 1) |c_create_data_#t~malloc20.base| 1)) (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= 0 (select |c_old(#valid)| |create_data_#t~malloc5.base|))))) is different from true [2018-10-27 04:50:01,945 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| |create_data_#t~malloc5.base| 1))) (and (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= |c_#valid| (store (store .cse0 |create_data_#t~malloc6.base| 1) c_create_data_~nextData~0.base 1)) (= 0 (select |c_old(#valid)| |create_data_#t~malloc5.base|))))) is different from true [2018-10-27 04:50:01,956 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| |create_data_#t~malloc5.base| 1))) (and (= |c_#valid| (store (store .cse0 |create_data_#t~malloc6.base| 1) c_create_data_~data~0.base 1)) (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= 0 (select |c_old(#valid)| |create_data_#t~malloc5.base|))))) is different from true [2018-10-27 04:50:01,965 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| |create_data_#t~malloc5.base| 1))) (and (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= 0 (select |c_old(#valid)| |create_data_#t~malloc5.base|)) (= |c_#valid| (store (store (store .cse0 |create_data_#t~malloc6.base| 1) c_create_data_~data~0.base 1) |c_create_data_#t~malloc20.base| 1))))) is different from true [2018-10-27 04:50:01,973 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| |create_data_#t~malloc5.base| 1))) (and (= 0 (select .cse0 |create_data_#t~malloc6.base|)) (= 0 (select |c_old(#valid)| |create_data_#t~malloc5.base|)) (= |c_#valid| (store (store (store .cse0 |create_data_#t~malloc6.base| 1) c_create_data_~data~0.base 1) c_create_data_~nextData~0.base 1))))) is different from true [2018-10-27 04:50:02,417 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_subst_7 Int) (|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse1 (store |c_old(#valid)| |create_data_#t~malloc5.base| 1))) (let ((.cse0 (store (store (store .cse1 |create_data_#t~malloc6.base| 1) v_subst_7 1) c_create_data_~data~0.base 1))) (and (= 1 (select .cse0 v_subst_7)) (= 0 (select .cse1 |create_data_#t~malloc6.base|)) (= 0 (select |c_old(#valid)| |create_data_#t~malloc5.base|)) (= (store .cse0 |c_create_data_#t~malloc20.base| 1) |c_#valid|))))) is different from true [2018-10-27 04:50:02,446 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_subst_7 Int) (|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse1 (store |c_old(#valid)| |create_data_#t~malloc5.base| 1))) (let ((.cse0 (store (store (store .cse1 |create_data_#t~malloc6.base| 1) v_subst_7 1) c_create_data_~data~0.base 1))) (and (= 1 (select .cse0 v_subst_7)) (= |c_#valid| (store .cse0 c_create_data_~nextData~0.base 1)) (= 0 (select .cse1 |create_data_#t~malloc6.base|)) (= 0 (select |c_old(#valid)| |create_data_#t~malloc5.base|)))))) is different from true [2018-10-27 04:50:02,959 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:02,962 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:02,964 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:02,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-10-27 04:50:02,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-10-27 04:50:02,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2018-10-27 04:50:02,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 44 [2018-10-27 04:50:03,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 43 [2018-10-27 04:50:03,002 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:03,014 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:03,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:03,036 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:03,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:03,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:03,061 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:64, output treesize:43 [2018-10-27 04:50:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 11 times theorem prover too weak. 27 trivial. 43 not checked. [2018-10-27 04:50:03,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:50:03,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2018-10-27 04:50:03,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-27 04:50:03,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-27 04:50:03,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=451, Unknown=21, NotChecked=424, Total=1056 [2018-10-27 04:50:03,242 INFO L87 Difference]: Start difference. First operand 787 states and 865 transitions. Second operand 33 states. [2018-10-27 04:50:04,759 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-10-27 04:50:05,754 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-10-27 04:50:07,215 WARN L179 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 84 [2018-10-27 04:50:08,311 WARN L179 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 76 [2018-10-27 04:50:09,890 WARN L179 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 84 [2018-10-27 04:50:10,368 WARN L179 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2018-10-27 04:50:11,639 WARN L179 SmtUtils]: Spent 866.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 89 [2018-10-27 04:50:12,562 WARN L179 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2018-10-27 04:50:14,625 WARN L179 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2018-10-27 04:50:16,254 WARN L179 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2018-10-27 04:50:17,254 WARN L179 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 93 [2018-10-27 04:50:18,359 WARN L179 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2018-10-27 04:50:19,384 WARN L179 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-10-27 04:50:21,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:21,595 INFO L93 Difference]: Finished difference Result 1230 states and 1382 transitions. [2018-10-27 04:50:21,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-27 04:50:21,597 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 112 [2018-10-27 04:50:21,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:21,600 INFO L225 Difference]: With dead ends: 1230 [2018-10-27 04:50:21,600 INFO L226 Difference]: Without dead ends: 1230 [2018-10-27 04:50:21,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 129 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=607, Invalid=1854, Unknown=121, NotChecked=840, Total=3422 [2018-10-27 04:50:21,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2018-10-27 04:50:21,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 861. [2018-10-27 04:50:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-10-27 04:50:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 945 transitions. [2018-10-27 04:50:21,611 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 945 transitions. Word has length 112 [2018-10-27 04:50:21,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:21,611 INFO L481 AbstractCegarLoop]: Abstraction has 861 states and 945 transitions. [2018-10-27 04:50:21,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-27 04:50:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 945 transitions. [2018-10-27 04:50:21,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-27 04:50:21,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:21,612 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:50:21,612 INFO L424 AbstractCegarLoop]: === Iteration 71 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:50:21,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:21,612 INFO L82 PathProgramCache]: Analyzing trace with hash 720483056, now seen corresponding path program 3 times [2018-10-27 04:50:21,612 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:50:21,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:50:21,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:50:21,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:50:21,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:50:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:22,229 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 04:50:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:50:24,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:50:24,402 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:50:24,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:50:24,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 04:50:24,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:50:24,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:24,821 INFO L477 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-10-27 04:50:24,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:24,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:50:25,087 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (and (= 0 (select (store |c_old(#valid)| |create_data_#t~malloc5.base| 1) |create_data_#t~malloc6.base|)) (= (store (store |c_old(#length)| |create_data_#t~malloc5.base| 16) |create_data_#t~malloc6.base| 80) |c_#length|) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) 0))) is different from true [2018-10-27 04:50:25,103 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (and (= 0 (select (store |c_old(#valid)| |create_data_#t~malloc5.base| 1) |create_data_#t~malloc6.base|)) (= |c_#length| (store (store (store |c_old(#length)| |create_data_#t~malloc5.base| 16) |create_data_#t~malloc6.base| 80) |c_create_data_#t~malloc20.base| 16)) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) 0))) is different from true [2018-10-27 04:50:25,110 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~nextData~0.base Int) (|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (and (= 0 (select (store |c_old(#valid)| |create_data_#t~malloc5.base| 1) |create_data_#t~malloc6.base|)) (= (store (store (store |c_old(#length)| |create_data_#t~malloc5.base| 16) |create_data_#t~malloc6.base| 80) create_data_~nextData~0.base 16) |c_#length|) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) 0))) is different from true [2018-10-27 04:50:25,121 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~nextData~0.base Int) (|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (and (= (store (store (store (store |c_old(#length)| |create_data_#t~malloc5.base| 16) |create_data_#t~malloc6.base| 80) create_data_~nextData~0.base 16) |c_create_data_#t~malloc20.base| 16) |c_#length|) (= 0 (select (store |c_old(#valid)| |create_data_#t~malloc5.base| 1) |create_data_#t~malloc6.base|)) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) 0))) is different from true [2018-10-27 04:50:25,129 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_subst_8 Int) (|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (and (= 0 (select (store |c_old(#valid)| |create_data_#t~malloc5.base| 1) |create_data_#t~malloc6.base|)) (= |c_#length| (store (store (store (store |c_old(#length)| |create_data_#t~malloc5.base| 16) |create_data_#t~malloc6.base| 80) v_subst_8 16) c_create_data_~nextData~0.base 16)) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) 0))) is different from true [2018-10-27 04:50:25,244 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,247 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,247 INFO L477 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-10-27 04:50:25,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:25,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-10-27 04:50:25,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:36 [2018-10-27 04:50:25,268 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_subst_8 Int) (create_data_~nextData~0.base Int) (|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (and (= 0 (select (store |c_old(#valid)| |create_data_#t~malloc5.base| 1) |create_data_#t~malloc6.base|)) (= |c_#length| (store (store (store (store (store |c_old(#length)| |create_data_#t~malloc5.base| 16) |create_data_#t~malloc6.base| 80) v_subst_8 16) create_data_~nextData~0.base 16) |c_create_data_#t~malloc20.base| 16)) (not (= create_data_~nextData~0.base |c_create_data_#t~malloc20.base|)) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) 0))) is different from true [2018-10-27 04:50:25,276 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_subst_9 Int) (v_subst_8 Int) (|create_data_#t~malloc5.base| Int) (|create_data_#t~malloc6.base| Int)) (and (= 0 (select (store |c_old(#valid)| |create_data_#t~malloc5.base| 1) |create_data_#t~malloc6.base|)) (not (= c_create_data_~nextData~0.base v_subst_9)) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) 0) (= (store (store (store (store (store |c_old(#length)| |create_data_#t~malloc5.base| 16) |create_data_#t~malloc6.base| 80) v_subst_8 16) v_subst_9 16) c_create_data_~nextData~0.base 16) |c_#length|))) is different from true [2018-10-27 04:50:25,389 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,391 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-10-27 04:50:25,395 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,397 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,399 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 58 [2018-10-27 04:50:25,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 50 [2018-10-27 04:50:25,416 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,418 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,422 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,423 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,426 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 60 [2018-10-27 04:50:25,437 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:50:25,437 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:25,480 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,484 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 67 [2018-10-27 04:50:25,490 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:25,556 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,558 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,560 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,562 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,566 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,568 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,570 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 83 [2018-10-27 04:50:25,581 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-10-27 04:50:25,672 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,676 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 67 [2018-10-27 04:50:25,682 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:25,783 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-27 04:50:25,993 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:25,994 INFO L303 Elim1Store]: Index analysis took 117 ms [2018-10-27 04:50:26,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 46 [2018-10-27 04:50:26,005 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:26,008 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:26,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 59 [2018-10-27 04:50:26,014 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:26,060 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:26,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 43 [2018-10-27 04:50:26,063 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:26,091 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:26,187 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:26,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 46 [2018-10-27 04:50:26,200 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:26,204 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:26,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 59 [2018-10-27 04:50:26,210 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-10-27 04:50:26,256 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:26,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 43 [2018-10-27 04:50:26,259 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:26,286 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:26,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-10-27 04:50:26,577 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-10-27 04:50:26,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-10-27 04:50:26,780 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:26,781 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:26,783 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:26,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 04:50:26,784 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:26,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 44 dim-0 vars, and 12 xjuncts. [2018-10-27 04:50:26,889 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:54, output treesize:517 [2018-10-27 04:50:27,166 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 294 DAG size of output: 62 [2018-10-27 04:50:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 50 not checked. [2018-10-27 04:50:27,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:50:27,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-10-27 04:50:27,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-27 04:50:27,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-27 04:50:27,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=553, Unknown=26, NotChecked=392, Total=1122 [2018-10-27 04:50:27,223 INFO L87 Difference]: Start difference. First operand 861 states and 945 transitions. Second operand 34 states. [2018-10-27 04:50:28,284 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2018-10-27 04:50:28,505 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2018-10-27 04:50:28,755 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2018-10-27 04:50:28,974 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2018-10-27 04:50:30,098 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2018-10-27 04:50:30,473 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2018-10-27 04:50:30,754 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2018-10-27 04:50:31,421 WARN L179 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2018-10-27 04:50:32,089 WARN L179 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2018-10-27 04:50:32,537 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2018-10-27 04:50:33,540 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2018-10-27 04:50:37,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:37,659 INFO L93 Difference]: Finished difference Result 1230 states and 1368 transitions. [2018-10-27 04:50:37,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-27 04:50:37,662 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 112 [2018-10-27 04:50:37,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:37,665 INFO L225 Difference]: With dead ends: 1230 [2018-10-27 04:50:37,665 INFO L226 Difference]: Without dead ends: 1230 [2018-10-27 04:50:37,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 119 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=394, Invalid=1976, Unknown=108, NotChecked=714, Total=3192 [2018-10-27 04:50:37,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2018-10-27 04:50:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 861. [2018-10-27 04:50:37,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-10-27 04:50:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 943 transitions. [2018-10-27 04:50:37,676 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 943 transitions. Word has length 112 [2018-10-27 04:50:37,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:37,676 INFO L481 AbstractCegarLoop]: Abstraction has 861 states and 943 transitions. [2018-10-27 04:50:37,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-27 04:50:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 943 transitions. [2018-10-27 04:50:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-27 04:50:37,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:37,677 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:50:37,677 INFO L424 AbstractCegarLoop]: === Iteration 72 === [create_dataErr8REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, freeDataErr0REQUIRES_VIOLATION, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION]=== [2018-10-27 04:50:37,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:37,678 INFO L82 PathProgramCache]: Analyzing trace with hash 21693910, now seen corresponding path program 1 times [2018-10-27 04:50:37,678 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:50:37,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:50:37,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:50:37,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:50:37,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:50:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:38,217 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 04:50:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-27 04:50:39,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:50:39,105 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:50:39,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:39,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:39,197 INFO L477 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-10-27 04:50:39,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:39,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:39,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:50:39,336 INFO L477 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-10-27 04:50:39,338 INFO L477 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-10-27 04:50:39,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:39,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:39,350 INFO L477 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-10-27 04:50:39,353 INFO L477 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-10-27 04:50:39,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:39,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:39,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:39,363 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-10-27 04:50:39,615 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|create_data_#t~malloc6.offset| Int)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| c_create_data_~data~0.base (store (select |c_old(#memory_$Pointer$.offset)| c_create_data_~data~0.base) (+ c_create_data_~data~0.offset 4) |create_data_#t~malloc6.offset|)))) (exists ((|create_data_#t~malloc6.base| Int)) (= (store |c_old(#memory_$Pointer$.base)| c_create_data_~data~0.base (store (select |c_old(#memory_$Pointer$.base)| c_create_data_~data~0.base) (+ c_create_data_~data~0.offset 4) |create_data_#t~malloc6.base|)) |c_#memory_$Pointer$.base|))) is different from true [2018-10-27 04:50:39,669 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc6.offset| Int) (create_data_~data~0.offset Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (+ create_data_~data~0.offset 4)) (.cse1 (+ create_data_~data~0.offset 12))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| c_create_data_~data~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| c_create_data_~data~0.base) .cse0 |create_data_#t~malloc6.offset|) .cse1 0))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| c_create_data_~data~0.base (store (store (select |c_old(#memory_$Pointer$.base)| c_create_data_~data~0.base) .cse0 |create_data_#t~malloc6.base|) .cse1 0)))))) is different from true [2018-10-27 04:50:39,701 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc6.offset| Int) (create_data_~data~0.offset Int) (|create_data_#t~malloc6.base| Int)) (let ((.cse0 (+ create_data_~data~0.offset 4)) (.cse1 (+ create_data_~data~0.offset 12))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_create_data_#res.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_create_data_#res.base|) .cse0 |create_data_#t~malloc6.offset|) .cse1 0))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_create_data_#res.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_create_data_#res.base|) .cse0 |create_data_#t~malloc6.base|) .cse1 0)))))) is different from true [2018-10-27 04:50:40,213 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:40,218 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:40,219 INFO L477 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 11 treesize of output 4 [2018-10-27 04:50:40,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:40,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 111 [2018-10-27 04:50:40,325 INFO L477 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 12 treesize of output 11 [2018-10-27 04:50:40,325 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:40,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 82 [2018-10-27 04:50:40,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 75 [2018-10-27 04:50:40,466 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:40,471 INFO L477 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 18 treesize of output 27 [2018-10-27 04:50:40,471 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:40,505 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:40,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 78 [2018-10-27 04:50:40,710 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:40,714 INFO L477 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 64 treesize of output 73 [2018-10-27 04:50:40,714 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:40,791 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:40,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 75 [2018-10-27 04:50:40,799 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:40,872 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:41,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2018-10-27 04:50:41,148 INFO L477 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 21 treesize of output 26 [2018-10-27 04:50:41,149 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:41,183 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:41,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 61 [2018-10-27 04:50:41,189 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:41,191 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:41,193 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:50:41,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 44 [2018-10-27 04:50:41,198 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:41,220 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:41,238 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:41,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2018-10-27 04:50:41,259 INFO L477 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 23 treesize of output 26 [2018-10-27 04:50:41,260 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:41,288 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:41,291 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:41,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 65 [2018-10-27 04:50:41,298 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:41,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 110 [2018-10-27 04:50:41,330 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 6 xjuncts. [2018-10-27 04:50:41,420 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:41,485 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:50:41,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 61 [2018-10-27 04:50:41,732 INFO L477 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 18 treesize of output 19 [2018-10-27 04:50:41,732 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:41,772 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:41,775 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:41,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 83 [2018-10-27 04:50:41,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 94 [2018-10-27 04:50:41,813 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:41,818 INFO L477 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 80 treesize of output 89 [2018-10-27 04:50:41,818 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:41,899 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:41,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 63 [2018-10-27 04:50:41,909 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:41,962 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:50:42,258 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:50:42,259 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_205 term size 31 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-27 04:50:42,263 INFO L168 Benchmark]: Toolchain (without parser) took 298109.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.1 MB). Free memory was 955.3 MB in the beginning and 1.1 GB in the end (delta: -137.5 MB). Peak memory consumption was 156.6 MB. Max. memory is 11.5 GB. [2018-10-27 04:50:42,264 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:50:42,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.67 ms. Allocated memory is still 1.0 GB. Free memory was 955.3 MB in the beginning and 931.2 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-27 04:50:42,264 INFO L168 Benchmark]: Boogie Preprocessor took 119.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -216.3 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-27 04:50:42,264 INFO L168 Benchmark]: RCFGBuilder took 1623.77 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: 75.6 MB). Peak memory consumption was 75.6 MB. Max. memory is 11.5 GB. [2018-10-27 04:50:42,265 INFO L168 Benchmark]: TraceAbstraction took 295965.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 140.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.9 MB). Peak memory consumption was 119.6 MB. Max. memory is 11.5 GB. [2018-10-27 04:50:42,266 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 396.67 ms. Allocated memory is still 1.0 GB. Free memory was 955.3 MB in the beginning and 931.2 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 119.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -216.3 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1623.77 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: 75.6 MB). Peak memory consumption was 75.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 295965.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 140.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.9 MB). Peak memory consumption was 119.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_205 term size 31 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_205 term size 31: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-27 04:50:44,037 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:50:44,040 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:50:44,051 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:50:44,052 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:50:44,052 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:50:44,053 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:50:44,054 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:50:44,055 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:50:44,056 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:50:44,056 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:50:44,056 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:50:44,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:50:44,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:50:44,060 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:50:44,060 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:50:44,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:50:44,062 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:50:44,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:50:44,063 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:50:44,064 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:50:44,064 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:50:44,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:50:44,073 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:50:44,074 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:50:44,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:50:44,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:50:44,075 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:50:44,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:50:44,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:50:44,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:50:44,081 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:50:44,081 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:50:44,081 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:50:44,082 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:50:44,082 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:50:44,083 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-10-27 04:50:44,097 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:50:44,097 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:50:44,098 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 04:50:44,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 04:50:44,098 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 04:50:44,099 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:50:44,099 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 04:50:44,099 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 04:50:44,099 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:50:44,099 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 04:50:44,099 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:50:44,100 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-27 04:50:44,100 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-27 04:50:44,100 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-27 04:50:44,100 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:50:44,100 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-27 04:50:44,100 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-27 04:50:44,100 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 04:50:44,102 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:50:44,102 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:50:44,103 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:50:44,103 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:50:44,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:50:44,103 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:50:44,103 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:50:44,103 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-10-27 04:50:44,103 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:50:44,104 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-27 04:50:44,104 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_0293f65a-a5ad-4f02-8144-f324403cffc3/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 -> 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c [2018-10-27 04:50:44,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:50:44,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:50:44,153 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:50:44,154 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:50:44,154 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:50:44,156 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i [2018-10-27 04:50:44,206 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/data/3b1134a41/8103ee4479444218a9eea5f96fd5f321/FLAGed42fd8ab [2018-10-27 04:50:44,659 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:50:44,660 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i [2018-10-27 04:50:44,674 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/data/3b1134a41/8103ee4479444218a9eea5f96fd5f321/FLAGed42fd8ab [2018-10-27 04:50:44,685 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/data/3b1134a41/8103ee4479444218a9eea5f96fd5f321 [2018-10-27 04:50:44,688 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:50:44,689 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 04:50:44,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:50:44,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:50:44,694 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:50:44,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:50:44" (1/1) ... [2018-10-27 04:50:44,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df2c4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:50:44, skipping insertion in model container [2018-10-27 04:50:44,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:50:44" (1/1) ... [2018-10-27 04:50:44,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:50:44,750 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:50:45,091 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:50:45,104 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:50:45,151 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:50:45,196 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:50:45,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:50:45 WrapperNode [2018-10-27 04:50:45,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:50:45,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:50:45,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:50:45,198 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:50:45,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:50:45" (1/1) ... [2018-10-27 04:50:45,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:50:45" (1/1) ... [2018-10-27 04:50:45,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:50:45" (1/1) ... [2018-10-27 04:50:45,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:50:45" (1/1) ... [2018-10-27 04:50:45,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:50:45" (1/1) ... [2018-10-27 04:50:45,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:50:45" (1/1) ... [2018-10-27 04:50:45,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:50:45" (1/1) ... [2018-10-27 04:50:45,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:50:45,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:50:45,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:50:45,366 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:50:45,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:50:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/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-10-27 04:50:45,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:50:45,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:50:45,437 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-10-27 04:50:45,437 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-10-27 04:50:45,437 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2018-10-27 04:50:45,438 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2018-10-27 04:50:45,438 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-10-27 04:50:45,438 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:50:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-27 04:50:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-10-27 04:50:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-10-27 04:50:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-10-27 04:50:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-10-27 04:50:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-10-27 04:50:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-10-27 04:50:45,440 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-10-27 04:50:45,440 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-10-27 04:50:45,440 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-10-27 04:50:45,440 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-10-27 04:50:45,440 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-10-27 04:50:45,440 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-10-27 04:50:45,440 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-10-27 04:50:45,441 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-10-27 04:50:45,441 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-10-27 04:50:45,441 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-10-27 04:50:45,441 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-10-27 04:50:45,441 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-10-27 04:50:45,441 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-10-27 04:50:45,441 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-10-27 04:50:45,442 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-10-27 04:50:45,442 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-10-27 04:50:45,442 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-10-27 04:50:45,442 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-10-27 04:50:45,442 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-10-27 04:50:45,442 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-10-27 04:50:45,442 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-10-27 04:50:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-10-27 04:50:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-10-27 04:50:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-10-27 04:50:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-10-27 04:50:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-10-27 04:50:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-10-27 04:50:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-10-27 04:50:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-10-27 04:50:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-10-27 04:50:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-10-27 04:50:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-10-27 04:50:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-10-27 04:50:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-10-27 04:50:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-10-27 04:50:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-10-27 04:50:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-10-27 04:50:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-10-27 04:50:45,451 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-10-27 04:50:45,451 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-10-27 04:50:45,451 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-10-27 04:50:45,452 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-10-27 04:50:45,452 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-10-27 04:50:45,452 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-10-27 04:50:45,452 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-10-27 04:50:45,452 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-10-27 04:50:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-27 04:50:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-10-27 04:50:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-10-27 04:50:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-10-27 04:50:45,454 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-10-27 04:50:45,454 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-10-27 04:50:45,454 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-10-27 04:50:45,454 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-10-27 04:50:45,454 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-10-27 04:50:45,454 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-10-27 04:50:45,454 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-10-27 04:50:45,454 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-10-27 04:50:45,454 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-10-27 04:50:45,455 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-27 04:50:45,455 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-10-27 04:50:45,455 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-10-27 04:50:45,455 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-10-27 04:50:45,455 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-10-27 04:50:45,455 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-10-27 04:50:45,455 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-10-27 04:50:45,455 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-10-27 04:50:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-10-27 04:50:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-10-27 04:50:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-10-27 04:50:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-10-27 04:50:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-10-27 04:50:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-10-27 04:50:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-10-27 04:50:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-10-27 04:50:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-10-27 04:50:45,461 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-10-27 04:50:45,461 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-10-27 04:50:45,461 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-10-27 04:50:45,461 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-10-27 04:50:45,461 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-10-27 04:50:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-10-27 04:50:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-10-27 04:50:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-10-27 04:50:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-10-27 04:50:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-10-27 04:50:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-10-27 04:50:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-10-27 04:50:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-10-27 04:50:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-10-27 04:50:45,463 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-10-27 04:50:45,463 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-10-27 04:50:45,463 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-10-27 04:50:45,463 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-10-27 04:50:45,463 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-10-27 04:50:45,463 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-10-27 04:50:45,463 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-10-27 04:50:45,463 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-10-27 04:50:45,463 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-10-27 04:50:45,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-27 04:50:45,464 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2018-10-27 04:50:45,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-27 04:50:45,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-10-27 04:50:45,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-27 04:50:45,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-27 04:50:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-10-27 04:50:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2018-10-27 04:50:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-27 04:50:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-10-27 04:50:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:50:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:50:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:50:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-10-27 04:50:47,152 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:50:47,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:50:47 BoogieIcfgContainer [2018-10-27 04:50:47,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:50:47,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:50:47,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:50:47,160 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:50:47,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:50:44" (1/3) ... [2018-10-27 04:50:47,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bcd5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:50:47, skipping insertion in model container [2018-10-27 04:50:47,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:50:45" (2/3) ... [2018-10-27 04:50:47,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bcd5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:50:47, skipping insertion in model container [2018-10-27 04:50:47,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:50:47" (3/3) ... [2018-10-27 04:50:47,163 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02_false-valid-memtrack.i [2018-10-27 04:50:47,173 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:50:47,180 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations. [2018-10-27 04:50:47,197 INFO L257 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2018-10-27 04:50:47,224 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 04:50:47,225 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:50:47,225 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-27 04:50:47,226 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:50:47,226 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:50:47,226 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:50:47,226 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:50:47,226 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:50:47,227 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:50:47,250 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-10-27 04:50:47,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-27 04:50:47,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:47,260 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:50:47,263 INFO L424 AbstractCegarLoop]: === Iteration 1 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:50:47,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:47,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2046890897, now seen corresponding path program 1 times [2018-10-27 04:50:47,277 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:47,278 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:47,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:47,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:47,389 INFO L477 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-10-27 04:50:47,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:47,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:47,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:50:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:47,469 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:50:47,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:50:47,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:50:47,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:50:47,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:50:47,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:50:47,486 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-10-27 04:50:48,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:48,335 INFO L93 Difference]: Finished difference Result 211 states and 222 transitions. [2018-10-27 04:50:48,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:50:48,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-27 04:50:48,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:48,344 INFO L225 Difference]: With dead ends: 211 [2018-10-27 04:50:48,344 INFO L226 Difference]: Without dead ends: 208 [2018-10-27 04:50:48,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-27 04:50:48,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-27 04:50:48,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-10-27 04:50:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-27 04:50:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 219 transitions. [2018-10-27 04:50:48,390 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 219 transitions. Word has length 7 [2018-10-27 04:50:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:48,391 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 219 transitions. [2018-10-27 04:50:48,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:50:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 219 transitions. [2018-10-27 04:50:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-27 04:50:48,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:48,392 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:50:48,393 INFO L424 AbstractCegarLoop]: === Iteration 2 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:50:48,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:48,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2046890896, now seen corresponding path program 1 times [2018-10-27 04:50:48,394 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:48,394 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:48,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:48,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:48,436 INFO L477 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-10-27 04:50:48,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:48,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:48,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:50:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:48,449 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:50:48,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:50:48,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:50:48,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:50:48,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:50:48,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:50:48,453 INFO L87 Difference]: Start difference. First operand 208 states and 219 transitions. Second operand 3 states. [2018-10-27 04:50:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:48,917 INFO L93 Difference]: Finished difference Result 209 states and 221 transitions. [2018-10-27 04:50:48,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:50:48,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-27 04:50:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:48,922 INFO L225 Difference]: With dead ends: 209 [2018-10-27 04:50:48,922 INFO L226 Difference]: Without dead ends: 209 [2018-10-27 04:50:48,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-27 04:50:48,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-27 04:50:48,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-10-27 04:50:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-27 04:50:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 218 transitions. [2018-10-27 04:50:48,938 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 218 transitions. Word has length 7 [2018-10-27 04:50:48,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:48,938 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 218 transitions. [2018-10-27 04:50:48,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:50:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 218 transitions. [2018-10-27 04:50:48,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 04:50:48,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:48,939 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:50:48,939 INFO L424 AbstractCegarLoop]: === Iteration 3 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:50:48,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:48,940 INFO L82 PathProgramCache]: Analyzing trace with hash 411503353, now seen corresponding path program 1 times [2018-10-27 04:50:48,943 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:48,943 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:48,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:49,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:49,011 INFO L477 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-10-27 04:50:49,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:49,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:49,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:50:49,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:50:49,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:49,087 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-10-27 04:50:49,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-10-27 04:50:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:49,108 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:50:49,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:50:49,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:50:49,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:50:49,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:50:49,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:50:49,112 INFO L87 Difference]: Start difference. First operand 207 states and 218 transitions. Second operand 5 states. [2018-10-27 04:50:49,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:49,572 INFO L93 Difference]: Finished difference Result 205 states and 216 transitions. [2018-10-27 04:50:49,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:50:49,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-27 04:50:49,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:49,574 INFO L225 Difference]: With dead ends: 205 [2018-10-27 04:50:49,574 INFO L226 Difference]: Without dead ends: 205 [2018-10-27 04:50:49,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:50:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-27 04:50:49,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-10-27 04:50:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-27 04:50:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 216 transitions. [2018-10-27 04:50:49,587 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 216 transitions. Word has length 14 [2018-10-27 04:50:49,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:49,587 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 216 transitions. [2018-10-27 04:50:49,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:50:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 216 transitions. [2018-10-27 04:50:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 04:50:49,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:49,588 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:50:49,588 INFO L424 AbstractCegarLoop]: === Iteration 4 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:50:49,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:49,592 INFO L82 PathProgramCache]: Analyzing trace with hash 411503354, now seen corresponding path program 1 times [2018-10-27 04:50:49,592 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:49,592 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:49,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:49,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:49,643 INFO L477 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-10-27 04:50:49,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:49,733 INFO L477 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-10-27 04:50:49,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:49,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:49,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:50:49,850 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:49,851 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:49,852 INFO L477 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-10-27 04:50:49,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:49,862 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:49,863 INFO L477 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-10-27 04:50:49,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:49,872 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-10-27 04:50:49,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-10-27 04:50:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:49,915 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:50:49,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:50:49,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:50:49,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:50:49,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:50:49,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:50:49,919 INFO L87 Difference]: Start difference. First operand 205 states and 216 transitions. Second operand 6 states. [2018-10-27 04:50:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:50,977 INFO L93 Difference]: Finished difference Result 225 states and 240 transitions. [2018-10-27 04:50:50,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:50:50,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-10-27 04:50:50,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:50,980 INFO L225 Difference]: With dead ends: 225 [2018-10-27 04:50:50,980 INFO L226 Difference]: Without dead ends: 225 [2018-10-27 04:50:50,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:50:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-27 04:50:50,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 214. [2018-10-27 04:50:50,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-27 04:50:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 228 transitions. [2018-10-27 04:50:50,991 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 228 transitions. Word has length 14 [2018-10-27 04:50:50,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:50,991 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 228 transitions. [2018-10-27 04:50:50,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:50:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 228 transitions. [2018-10-27 04:50:50,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 04:50:50,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:50,992 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:50:50,992 INFO L424 AbstractCegarLoop]: === Iteration 5 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:50:50,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:50,992 INFO L82 PathProgramCache]: Analyzing trace with hash -128297712, now seen corresponding path program 1 times [2018-10-27 04:50:50,996 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:50,996 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:51,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:51,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:51,099 INFO L477 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-10-27 04:50:51,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:51,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:51,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:50:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:51,138 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:50:51,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:50:51,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:50:51,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:50:51,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:50:51,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:50:51,140 INFO L87 Difference]: Start difference. First operand 214 states and 228 transitions. Second operand 4 states. [2018-10-27 04:50:51,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:51,437 INFO L93 Difference]: Finished difference Result 212 states and 225 transitions. [2018-10-27 04:50:51,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:50:51,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-27 04:50:51,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:51,439 INFO L225 Difference]: With dead ends: 212 [2018-10-27 04:50:51,439 INFO L226 Difference]: Without dead ends: 212 [2018-10-27 04:50:51,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:50:51,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-27 04:50:51,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-10-27 04:50:51,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-27 04:50:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 225 transitions. [2018-10-27 04:50:51,452 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 225 transitions. Word has length 15 [2018-10-27 04:50:51,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:51,452 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 225 transitions. [2018-10-27 04:50:51,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:50:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 225 transitions. [2018-10-27 04:50:51,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 04:50:51,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:51,457 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:50:51,457 INFO L424 AbstractCegarLoop]: === Iteration 6 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:50:51,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:51,457 INFO L82 PathProgramCache]: Analyzing trace with hash -128297711, now seen corresponding path program 1 times [2018-10-27 04:50:51,458 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:51,458 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:51,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:51,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:51,511 INFO L477 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-10-27 04:50:51,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:51,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:51,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:50:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:51,534 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:50:51,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:50:51,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:50:51,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:50:51,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:50:51,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:50:51,537 INFO L87 Difference]: Start difference. First operand 212 states and 225 transitions. Second operand 4 states. [2018-10-27 04:50:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:51,908 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2018-10-27 04:50:51,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:50:51,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-27 04:50:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:51,911 INFO L225 Difference]: With dead ends: 210 [2018-10-27 04:50:51,911 INFO L226 Difference]: Without dead ends: 210 [2018-10-27 04:50:51,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:50:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-27 04:50:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-10-27 04:50:51,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-27 04:50:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 222 transitions. [2018-10-27 04:50:51,916 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 222 transitions. Word has length 15 [2018-10-27 04:50:51,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:51,918 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 222 transitions. [2018-10-27 04:50:51,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:50:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 222 transitions. [2018-10-27 04:50:51,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 04:50:51,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:51,919 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:50:51,919 INFO L424 AbstractCegarLoop]: === Iteration 7 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:50:51,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:51,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1686995403, now seen corresponding path program 1 times [2018-10-27 04:50:51,920 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:51,920 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:51,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:51,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:52,007 INFO L477 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-10-27 04:50:52,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:50:52,055 INFO L477 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-10-27 04:50:52,065 INFO L477 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-10-27 04:50:52,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,087 INFO L477 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-10-27 04:50:52,089 INFO L477 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-10-27 04:50:52,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,101 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2018-10-27 04:50:52,144 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:52,145 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:52,146 INFO L477 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-10-27 04:50:52,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-10-27 04:50:52,204 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 04:50:52,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:50:52,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,246 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-27 04:50:52,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:50:52,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,279 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:48, output treesize:18 [2018-10-27 04:50:52,300 INFO L477 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-10-27 04:50:52,304 INFO L477 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-10-27 04:50:52,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,311 INFO L477 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-10-27 04:50:52,313 INFO L477 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-10-27 04:50:52,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,315 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:52,318 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-10-27 04:50:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:52,333 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:50:52,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:50:52,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 04:50:52,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:50:52,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:50:52,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:50:52,336 INFO L87 Difference]: Start difference. First operand 210 states and 222 transitions. Second operand 10 states. [2018-10-27 04:50:53,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:53,739 INFO L93 Difference]: Finished difference Result 212 states and 225 transitions. [2018-10-27 04:50:53,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:50:53,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-10-27 04:50:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:53,741 INFO L225 Difference]: With dead ends: 212 [2018-10-27 04:50:53,741 INFO L226 Difference]: Without dead ends: 212 [2018-10-27 04:50:53,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:50:53,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-27 04:50:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2018-10-27 04:50:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-27 04:50:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 223 transitions. [2018-10-27 04:50:53,747 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 223 transitions. Word has length 20 [2018-10-27 04:50:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:53,750 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 223 transitions. [2018-10-27 04:50:53,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:50:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 223 transitions. [2018-10-27 04:50:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-27 04:50:53,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:53,751 INFO L375 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] [2018-10-27 04:50:53,751 INFO L424 AbstractCegarLoop]: === Iteration 8 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:50:53,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:53,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1993909062, now seen corresponding path program 1 times [2018-10-27 04:50:53,752 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:53,752 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:53,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:53,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:53,834 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:50:53,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:50:53,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:50:53,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:50:53,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:50:53,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:50:53,836 INFO L87 Difference]: Start difference. First operand 211 states and 223 transitions. Second operand 4 states. [2018-10-27 04:50:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:53,888 INFO L93 Difference]: Finished difference Result 296 states and 312 transitions. [2018-10-27 04:50:53,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:50:53,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-10-27 04:50:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:53,890 INFO L225 Difference]: With dead ends: 296 [2018-10-27 04:50:53,890 INFO L226 Difference]: Without dead ends: 296 [2018-10-27 04:50:53,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:50:53,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-27 04:50:53,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 260. [2018-10-27 04:50:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-27 04:50:53,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 312 transitions. [2018-10-27 04:50:53,899 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 312 transitions. Word has length 22 [2018-10-27 04:50:53,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:53,899 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 312 transitions. [2018-10-27 04:50:53,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:50:53,899 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 312 transitions. [2018-10-27 04:50:53,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 04:50:53,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:53,900 INFO L375 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-10-27 04:50:53,900 INFO L424 AbstractCegarLoop]: === Iteration 9 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:50:53,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:53,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1387277136, now seen corresponding path program 1 times [2018-10-27 04:50:53,900 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:53,900 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:53,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:53,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:53,982 INFO L477 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-10-27 04:50:53,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:53,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:53,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:50:54,041 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:54,065 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:54,066 INFO L477 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-10-27 04:50:54,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:54,158 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-10-27 04:50:54,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2018-10-27 04:50:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:54,168 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:50:54,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:50:54,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:50:54,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:50:54,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:50:54,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:50:54,170 INFO L87 Difference]: Start difference. First operand 260 states and 312 transitions. Second operand 5 states. [2018-10-27 04:50:54,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:54,520 INFO L93 Difference]: Finished difference Result 296 states and 350 transitions. [2018-10-27 04:50:54,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:50:54,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-10-27 04:50:54,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:54,522 INFO L225 Difference]: With dead ends: 296 [2018-10-27 04:50:54,522 INFO L226 Difference]: Without dead ends: 296 [2018-10-27 04:50:54,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:50:54,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-27 04:50:54,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 260. [2018-10-27 04:50:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-27 04:50:54,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 308 transitions. [2018-10-27 04:50:54,528 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 308 transitions. Word has length 26 [2018-10-27 04:50:54,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:54,530 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 308 transitions. [2018-10-27 04:50:54,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:50:54,530 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 308 transitions. [2018-10-27 04:50:54,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 04:50:54,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:54,531 INFO L375 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-10-27 04:50:54,531 INFO L424 AbstractCegarLoop]: === Iteration 10 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:50:54,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:54,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1387277137, now seen corresponding path program 1 times [2018-10-27 04:50:54,531 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:54,532 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:54,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:54,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:54,629 INFO L477 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-10-27 04:50:54,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:54,642 INFO L477 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-10-27 04:50:54,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:54,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:54,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:50:54,673 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:54,674 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:54,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-10-27 04:50:54,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:54,687 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:54,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:50:54,688 INFO L477 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-10-27 04:50:54,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:54,695 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-10-27 04:50:54,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:16 [2018-10-27 04:50:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:54,708 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:50:54,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:50:54,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:50:54,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:50:54,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:50:54,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:50:54,712 INFO L87 Difference]: Start difference. First operand 260 states and 308 transitions. Second operand 5 states. [2018-10-27 04:50:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:55,290 INFO L93 Difference]: Finished difference Result 283 states and 324 transitions. [2018-10-27 04:50:55,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:50:55,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-10-27 04:50:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:55,293 INFO L225 Difference]: With dead ends: 283 [2018-10-27 04:50:55,293 INFO L226 Difference]: Without dead ends: 283 [2018-10-27 04:50:55,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:50:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-27 04:50:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 261. [2018-10-27 04:50:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-27 04:50:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 302 transitions. [2018-10-27 04:50:55,300 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 302 transitions. Word has length 26 [2018-10-27 04:50:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:55,300 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 302 transitions. [2018-10-27 04:50:55,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:50:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 302 transitions. [2018-10-27 04:50:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 04:50:55,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:55,301 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:50:55,301 INFO L424 AbstractCegarLoop]: === Iteration 11 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:50:55,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:55,302 INFO L82 PathProgramCache]: Analyzing trace with hash -988625017, now seen corresponding path program 1 times [2018-10-27 04:50:55,302 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:55,302 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:55,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:55,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:55,411 INFO L477 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-10-27 04:50:55,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:50:55,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:50:55,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:50:55,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-10-27 04:50:55,556 INFO L477 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 21 treesize of output 17 [2018-10-27 04:50:55,559 INFO L477 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 5 [2018-10-27 04:50:55,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:55,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-10-27 04:50:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:55,567 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:50:55,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:50:55,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:50:55,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:50:55,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:50:55,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:50:55,570 INFO L87 Difference]: Start difference. First operand 261 states and 302 transitions. Second operand 5 states. [2018-10-27 04:50:56,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:56,176 INFO L93 Difference]: Finished difference Result 270 states and 308 transitions. [2018-10-27 04:50:56,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:50:56,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-10-27 04:50:56,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:56,179 INFO L225 Difference]: With dead ends: 270 [2018-10-27 04:50:56,179 INFO L226 Difference]: Without dead ends: 270 [2018-10-27 04:50:56,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:50:56,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-27 04:50:56,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 260. [2018-10-27 04:50:56,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-27 04:50:56,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 300 transitions. [2018-10-27 04:50:56,186 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 300 transitions. Word has length 31 [2018-10-27 04:50:56,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:56,186 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 300 transitions. [2018-10-27 04:50:56,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:50:56,187 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 300 transitions. [2018-10-27 04:50:56,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 04:50:56,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:56,187 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:50:56,187 INFO L424 AbstractCegarLoop]: === Iteration 12 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:50:56,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:56,188 INFO L82 PathProgramCache]: Analyzing trace with hash -988625016, now seen corresponding path program 1 times [2018-10-27 04:50:56,188 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:56,188 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:56,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:56,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:56,288 INFO L477 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-10-27 04:50:56,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:50:56,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:50:56,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:50:56,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:50:56,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:50:56,352 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,364 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2018-10-27 04:50:56,402 INFO L477 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-10-27 04:50:56,407 INFO L477 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 3 [2018-10-27 04:50:56,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,422 INFO L477 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 23 treesize of output 19 [2018-10-27 04:50:56,429 INFO L477 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 7 [2018-10-27 04:50:56,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,431 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:56,436 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2018-10-27 04:50:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:56,448 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:50:56,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:50:56,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:50:56,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:50:56,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:50:56,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:50:56,450 INFO L87 Difference]: Start difference. First operand 260 states and 300 transitions. Second operand 6 states. [2018-10-27 04:50:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:50:56,934 INFO L93 Difference]: Finished difference Result 278 states and 318 transitions. [2018-10-27 04:50:56,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:50:56,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-10-27 04:50:56,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:50:56,937 INFO L225 Difference]: With dead ends: 278 [2018-10-27 04:50:56,937 INFO L226 Difference]: Without dead ends: 278 [2018-10-27 04:50:56,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:50:56,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-27 04:50:56,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 268. [2018-10-27 04:50:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-27 04:50:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 308 transitions. [2018-10-27 04:50:56,948 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 308 transitions. Word has length 31 [2018-10-27 04:50:56,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:50:56,948 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 308 transitions. [2018-10-27 04:50:56,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:50:56,948 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 308 transitions. [2018-10-27 04:50:56,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 04:50:56,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:50:56,950 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:50:56,950 INFO L424 AbstractCegarLoop]: === Iteration 13 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:50:56,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:50:56,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1137379698, now seen corresponding path program 1 times [2018-10-27 04:50:56,951 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:50:56,953 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:50:56,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:50:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:50:57,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:50:57,049 INFO L477 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-10-27 04:50:57,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:57,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:57,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:50:57,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:50:57,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:50:57,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:57,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:57,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:50:57,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:50:57,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:57,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:57,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:57,126 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2018-10-27 04:50:57,207 INFO L477 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-10-27 04:50:57,210 INFO L477 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 3 [2018-10-27 04:50:57,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:57,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:57,224 INFO L477 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 23 treesize of output 19 [2018-10-27 04:50:57,237 INFO L477 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 7 [2018-10-27 04:50:57,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:50:57,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:57,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:50:57,244 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2018-10-27 04:50:57,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:57,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:50:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:50:57,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:50:57,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-10-27 04:50:57,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 04:50:57,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 04:50:57,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:50:57,889 INFO L87 Difference]: Start difference. First operand 268 states and 308 transitions. Second operand 15 states. [2018-10-27 04:50:58,733 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-10-27 04:51:01,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:01,990 INFO L93 Difference]: Finished difference Result 432 states and 494 transitions. [2018-10-27 04:51:01,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:51:01,991 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-10-27 04:51:01,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:01,993 INFO L225 Difference]: With dead ends: 432 [2018-10-27 04:51:01,993 INFO L226 Difference]: Without dead ends: 432 [2018-10-27 04:51:01,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=194, Invalid=456, Unknown=0, NotChecked=0, Total=650 [2018-10-27 04:51:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-10-27 04:51:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 304. [2018-10-27 04:51:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-10-27 04:51:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 348 transitions. [2018-10-27 04:51:02,005 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 348 transitions. Word has length 37 [2018-10-27 04:51:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:02,005 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 348 transitions. [2018-10-27 04:51:02,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 04:51:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 348 transitions. [2018-10-27 04:51:02,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-27 04:51:02,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:02,007 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 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-10-27 04:51:02,007 INFO L424 AbstractCegarLoop]: === Iteration 14 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:02,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:02,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1670725072, now seen corresponding path program 2 times [2018-10-27 04:51:02,008 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:02,008 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:02,037 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-27 04:51:02,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 04:51:02,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:51:02,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 26 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:51:02,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:51:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 26 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 04:51:02,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:51:02,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-10-27 04:51:02,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:51:02,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:51:02,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:51:02,332 INFO L87 Difference]: Start difference. First operand 304 states and 348 transitions. Second operand 10 states. [2018-10-27 04:51:02,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:02,385 INFO L93 Difference]: Finished difference Result 289 states and 326 transitions. [2018-10-27 04:51:02,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:51:02,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-10-27 04:51:02,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:02,390 INFO L225 Difference]: With dead ends: 289 [2018-10-27 04:51:02,391 INFO L226 Difference]: Without dead ends: 289 [2018-10-27 04:51:02,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:51:02,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-27 04:51:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2018-10-27 04:51:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-27 04:51:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 324 transitions. [2018-10-27 04:51:02,401 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 324 transitions. Word has length 55 [2018-10-27 04:51:02,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:02,401 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 324 transitions. [2018-10-27 04:51:02,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:51:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 324 transitions. [2018-10-27 04:51:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-27 04:51:02,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:02,407 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:02,407 INFO L424 AbstractCegarLoop]: === Iteration 15 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:02,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:02,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1357775280, now seen corresponding path program 1 times [2018-10-27 04:51:02,408 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:02,408 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:02,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:51:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:02,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:02,620 INFO L477 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-10-27 04:51:02,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:02,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:02,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:51:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:02,767 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:02,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:02,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:51:02,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:51:02,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:51:02,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:51:02,771 INFO L87 Difference]: Start difference. First operand 287 states and 324 transitions. Second operand 4 states. [2018-10-27 04:51:03,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:03,749 INFO L93 Difference]: Finished difference Result 289 states and 318 transitions. [2018-10-27 04:51:03,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:51:03,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-10-27 04:51:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:03,752 INFO L225 Difference]: With dead ends: 289 [2018-10-27 04:51:03,752 INFO L226 Difference]: Without dead ends: 289 [2018-10-27 04:51:03,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:51:03,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-27 04:51:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 283. [2018-10-27 04:51:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-27 04:51:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 312 transitions. [2018-10-27 04:51:03,758 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 312 transitions. Word has length 62 [2018-10-27 04:51:03,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:03,759 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 312 transitions. [2018-10-27 04:51:03,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:51:03,759 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 312 transitions. [2018-10-27 04:51:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-27 04:51:03,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:03,760 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:03,760 INFO L424 AbstractCegarLoop]: === Iteration 16 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:03,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:03,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1357775279, now seen corresponding path program 1 times [2018-10-27 04:51:03,761 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:03,761 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:03,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:03,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:03,913 INFO L477 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-10-27 04:51:03,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:03,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:03,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:51:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:03,961 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:03,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:03,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:51:03,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:51:03,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:51:03,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:51:03,970 INFO L87 Difference]: Start difference. First operand 283 states and 312 transitions. Second operand 4 states. [2018-10-27 04:51:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:05,085 INFO L93 Difference]: Finished difference Result 285 states and 306 transitions. [2018-10-27 04:51:05,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:51:05,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-10-27 04:51:05,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:05,087 INFO L225 Difference]: With dead ends: 285 [2018-10-27 04:51:05,087 INFO L226 Difference]: Without dead ends: 285 [2018-10-27 04:51:05,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:51:05,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-27 04:51:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 279. [2018-10-27 04:51:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-27 04:51:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 300 transitions. [2018-10-27 04:51:05,092 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 300 transitions. Word has length 62 [2018-10-27 04:51:05,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:05,092 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 300 transitions. [2018-10-27 04:51:05,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:51:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 300 transitions. [2018-10-27 04:51:05,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-27 04:51:05,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:05,098 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:05,099 INFO L424 AbstractCegarLoop]: === Iteration 17 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:05,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:05,099 INFO L82 PathProgramCache]: Analyzing trace with hash 857751188, now seen corresponding path program 1 times [2018-10-27 04:51:05,099 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:05,099 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:05,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:05,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:05,332 INFO L477 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-10-27 04:51:05,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:05,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:05,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:51:05,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2018-10-27 04:51:05,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 16 [2018-10-27 04:51:05,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:05,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:05,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:05,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:18 [2018-10-27 04:51:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:05,578 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:05,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:05,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 04:51:05,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:51:05,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:51:05,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=52, Unknown=4, NotChecked=0, Total=72 [2018-10-27 04:51:05,581 INFO L87 Difference]: Start difference. First operand 279 states and 300 transitions. Second operand 9 states. [2018-10-27 04:51:06,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:06,362 INFO L93 Difference]: Finished difference Result 298 states and 320 transitions. [2018-10-27 04:51:06,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:51:06,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-10-27 04:51:06,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:06,364 INFO L225 Difference]: With dead ends: 298 [2018-10-27 04:51:06,364 INFO L226 Difference]: Without dead ends: 298 [2018-10-27 04:51:06,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=80, Unknown=6, NotChecked=0, Total=110 [2018-10-27 04:51:06,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-27 04:51:06,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 287. [2018-10-27 04:51:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-27 04:51:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 310 transitions. [2018-10-27 04:51:06,370 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 310 transitions. Word has length 63 [2018-10-27 04:51:06,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:06,370 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 310 transitions. [2018-10-27 04:51:06,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:51:06,370 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 310 transitions. [2018-10-27 04:51:06,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-27 04:51:06,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:06,371 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:06,371 INFO L424 AbstractCegarLoop]: === Iteration 18 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:06,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:06,371 INFO L82 PathProgramCache]: Analyzing trace with hash 857751189, now seen corresponding path program 1 times [2018-10-27 04:51:06,372 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:06,372 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:06,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:06,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:06,539 INFO L477 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-10-27 04:51:06,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:06,555 INFO L477 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-10-27 04:51:06,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:06,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:06,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:51:06,617 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32))) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)))) is different from true [2018-10-27 04:51:06,645 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32)) |c_create_data_#t~malloc6.base| (_ bv80 32))) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)))) is different from true [2018-10-27 04:51:06,657 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| (_ BitVec 32)) (|create_data_#t~malloc6.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32)) |create_data_#t~malloc6.base| (_ bv80 32))) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)))) is different from true [2018-10-27 04:51:06,697 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:06,698 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:06,699 INFO L477 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-10-27 04:51:06,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:06,715 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:06,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-10-27 04:51:06,776 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:06,777 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:06,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 28 [2018-10-27 04:51:06,790 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-27 04:51:06,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:51:06,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-10-27 04:51:06,846 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:48 [2018-10-27 04:51:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:06,906 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:06,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:06,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 04:51:06,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:51:06,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:51:06,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=24, Unknown=3, NotChecked=30, Total=72 [2018-10-27 04:51:06,922 INFO L87 Difference]: Start difference. First operand 287 states and 310 transitions. Second operand 9 states. [2018-10-27 04:51:07,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:07,525 INFO L93 Difference]: Finished difference Result 329 states and 361 transitions. [2018-10-27 04:51:07,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:51:07,525 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-10-27 04:51:07,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:07,526 INFO L225 Difference]: With dead ends: 329 [2018-10-27 04:51:07,526 INFO L226 Difference]: Without dead ends: 329 [2018-10-27 04:51:07,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=32, Unknown=3, NotChecked=36, Total=90 [2018-10-27 04:51:07,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-27 04:51:07,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 308. [2018-10-27 04:51:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-27 04:51:07,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 337 transitions. [2018-10-27 04:51:07,531 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 337 transitions. Word has length 63 [2018-10-27 04:51:07,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:07,532 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 337 transitions. [2018-10-27 04:51:07,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:51:07,532 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 337 transitions. [2018-10-27 04:51:07,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-27 04:51:07,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:07,535 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:07,535 INFO L424 AbstractCegarLoop]: === Iteration 19 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:07,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:07,535 INFO L82 PathProgramCache]: Analyzing trace with hash -334821245, now seen corresponding path program 1 times [2018-10-27 04:51:07,536 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:07,536 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:07,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:07,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:07,716 INFO L477 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-10-27 04:51:07,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:07,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:07,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-10-27 04:51:07,723 INFO L477 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-10-27 04:51:07,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:07,729 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-10-27 04:51:07,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:5 [2018-10-27 04:51:07,877 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc6.base| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |c_create_data_#res.base| (_ bv1 1)))) (and (= (select .cse0 |create_data_#t~malloc6.base|) (_ bv0 1)) (= |c_#valid| (store .cse0 |create_data_#t~malloc6.base| (_ bv1 1)))))) is different from true [2018-10-27 04:51:07,890 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:07,892 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:07,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 36 [2018-10-27 04:51:07,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-10-27 04:51:07,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:08,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:08,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:08,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-10-27 04:51:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:08,302 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:08,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:08,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 04:51:08,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:51:08,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:51:08,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=64, Unknown=3, NotChecked=16, Total=110 [2018-10-27 04:51:08,304 INFO L87 Difference]: Start difference. First operand 308 states and 337 transitions. Second operand 11 states. [2018-10-27 04:51:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:10,276 INFO L93 Difference]: Finished difference Result 316 states and 344 transitions. [2018-10-27 04:51:10,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:51:10,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-10-27 04:51:10,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:10,278 INFO L225 Difference]: With dead ends: 316 [2018-10-27 04:51:10,278 INFO L226 Difference]: Without dead ends: 316 [2018-10-27 04:51:10,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=113, Unknown=6, NotChecked=22, Total=182 [2018-10-27 04:51:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-10-27 04:51:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 311. [2018-10-27 04:51:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-27 04:51:10,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 341 transitions. [2018-10-27 04:51:10,284 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 341 transitions. Word has length 65 [2018-10-27 04:51:10,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:10,284 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 341 transitions. [2018-10-27 04:51:10,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:51:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 341 transitions. [2018-10-27 04:51:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-27 04:51:10,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:10,287 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:10,287 INFO L424 AbstractCegarLoop]: === Iteration 20 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:10,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:10,287 INFO L82 PathProgramCache]: Analyzing trace with hash -334821244, now seen corresponding path program 1 times [2018-10-27 04:51:10,288 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:10,288 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:10,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:10,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:10,523 INFO L477 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-10-27 04:51:10,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:10,529 INFO L477 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-10-27 04:51:10,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:10,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:10,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:51:10,695 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 04:51:10,841 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:10,842 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:10,843 INFO L477 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-10-27 04:51:10,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:10,855 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:10,856 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:10,857 INFO L477 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-10-27 04:51:10,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:10,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:10,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2018-10-27 04:51:11,165 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,167 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,170 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-10-27 04:51:11,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:11,196 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,199 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,201 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,202 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 46 [2018-10-27 04:51:11,218 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,221 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,222 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,223 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,224 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 75 [2018-10-27 04:51:11,235 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 04:51:11,314 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,315 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,316 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:11,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 51 [2018-10-27 04:51:11,317 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:11,352 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:51:11,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-10-27 04:51:11,391 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:43, output treesize:65 [2018-10-27 04:51:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:11,472 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:11,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:11,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-27 04:51:11,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 04:51:11,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 04:51:11,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=178, Unknown=1, NotChecked=0, Total=210 [2018-10-27 04:51:11,483 INFO L87 Difference]: Start difference. First operand 311 states and 341 transitions. Second operand 15 states. [2018-10-27 04:51:14,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:14,484 INFO L93 Difference]: Finished difference Result 319 states and 352 transitions. [2018-10-27 04:51:14,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 04:51:14,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-10-27 04:51:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:14,487 INFO L225 Difference]: With dead ends: 319 [2018-10-27 04:51:14,487 INFO L226 Difference]: Without dead ends: 319 [2018-10-27 04:51:14,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=357, Unknown=2, NotChecked=0, Total=420 [2018-10-27 04:51:14,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-27 04:51:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 318. [2018-10-27 04:51:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-27 04:51:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 352 transitions. [2018-10-27 04:51:14,492 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 352 transitions. Word has length 65 [2018-10-27 04:51:14,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:14,494 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 352 transitions. [2018-10-27 04:51:14,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 04:51:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 352 transitions. [2018-10-27 04:51:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-27 04:51:14,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:14,495 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:14,496 INFO L424 AbstractCegarLoop]: === Iteration 21 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:14,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:14,496 INFO L82 PathProgramCache]: Analyzing trace with hash 556447960, now seen corresponding path program 1 times [2018-10-27 04:51:14,496 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:14,496 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:14,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:14,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:14,567 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:14,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:14,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:51:14,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:51:14,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:51:14,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:51:14,570 INFO L87 Difference]: Start difference. First operand 318 states and 352 transitions. Second operand 4 states. [2018-10-27 04:51:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:14,590 INFO L93 Difference]: Finished difference Result 326 states and 358 transitions. [2018-10-27 04:51:14,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:51:14,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-10-27 04:51:14,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:14,592 INFO L225 Difference]: With dead ends: 326 [2018-10-27 04:51:14,592 INFO L226 Difference]: Without dead ends: 326 [2018-10-27 04:51:14,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:51:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-27 04:51:14,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2018-10-27 04:51:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-10-27 04:51:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 356 transitions. [2018-10-27 04:51:14,598 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 356 transitions. Word has length 65 [2018-10-27 04:51:14,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:14,598 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 356 transitions. [2018-10-27 04:51:14,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:51:14,598 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 356 transitions. [2018-10-27 04:51:14,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-27 04:51:14,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:14,599 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:14,599 INFO L424 AbstractCegarLoop]: === Iteration 22 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:14,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:14,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1350081736, now seen corresponding path program 1 times [2018-10-27 04:51:14,600 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:14,600 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:14,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:14,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:14,733 INFO L477 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-10-27 04:51:14,735 INFO L477 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-10-27 04:51:14,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:14,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:14,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:14,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 04:51:14,749 INFO L477 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-10-27 04:51:14,751 INFO L477 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-10-27 04:51:14,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:14,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:14,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:14,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-27 04:51:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:14,766 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:14,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:14,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:51:14,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:51:14,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:51:14,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:51:14,770 INFO L87 Difference]: Start difference. First operand 324 states and 356 transitions. Second operand 6 states. [2018-10-27 04:51:14,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:14,909 INFO L93 Difference]: Finished difference Result 372 states and 410 transitions. [2018-10-27 04:51:14,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 04:51:14,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-10-27 04:51:14,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:14,912 INFO L225 Difference]: With dead ends: 372 [2018-10-27 04:51:14,912 INFO L226 Difference]: Without dead ends: 372 [2018-10-27 04:51:14,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:51:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-10-27 04:51:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 335. [2018-10-27 04:51:14,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-27 04:51:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 368 transitions. [2018-10-27 04:51:14,916 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 368 transitions. Word has length 65 [2018-10-27 04:51:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:14,917 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 368 transitions. [2018-10-27 04:51:14,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:51:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 368 transitions. [2018-10-27 04:51:14,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-27 04:51:14,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:14,918 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:14,919 INFO L424 AbstractCegarLoop]: === Iteration 23 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:14,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:14,919 INFO L82 PathProgramCache]: Analyzing trace with hash 542851259, now seen corresponding path program 1 times [2018-10-27 04:51:14,919 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:14,919 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:14,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:15,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:15,095 INFO L477 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-10-27 04:51:15,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:15,113 INFO L477 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-10-27 04:51:15,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:15,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:15,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:51:15,151 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32))) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)))) is different from true [2018-10-27 04:51:15,181 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32)) |c_create_data_#t~malloc6.base| (_ bv80 32))) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)))) is different from true [2018-10-27 04:51:15,209 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| (_ BitVec 32)) (|create_data_#t~malloc6.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32)) |create_data_#t~malloc6.base| (_ bv80 32))) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)))) is different from true [2018-10-27 04:51:15,285 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:15,309 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:15,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-10-27 04:51:15,383 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:15,384 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:15,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 28 [2018-10-27 04:51:15,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-10-27 04:51:15,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:51:15,559 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:15,560 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:15,561 INFO L477 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-10-27 04:51:15,561 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:15,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-10-27 04:51:15,587 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:48 [2018-10-27 04:51:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:15,635 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:15,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:15,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 04:51:15,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:51:15,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:51:15,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=24, Unknown=3, NotChecked=30, Total=72 [2018-10-27 04:51:15,637 INFO L87 Difference]: Start difference. First operand 335 states and 368 transitions. Second operand 9 states. [2018-10-27 04:51:16,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:16,233 INFO L93 Difference]: Finished difference Result 368 states and 404 transitions. [2018-10-27 04:51:16,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:51:16,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-10-27 04:51:16,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:16,235 INFO L225 Difference]: With dead ends: 368 [2018-10-27 04:51:16,235 INFO L226 Difference]: Without dead ends: 368 [2018-10-27 04:51:16,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=32, Unknown=3, NotChecked=36, Total=90 [2018-10-27 04:51:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-27 04:51:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 348. [2018-10-27 04:51:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-27 04:51:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 385 transitions. [2018-10-27 04:51:16,241 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 385 transitions. Word has length 67 [2018-10-27 04:51:16,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:16,241 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 385 transitions. [2018-10-27 04:51:16,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:51:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 385 transitions. [2018-10-27 04:51:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-27 04:51:16,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:16,242 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:16,242 INFO L424 AbstractCegarLoop]: === Iteration 24 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:16,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:16,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1745385399, now seen corresponding path program 1 times [2018-10-27 04:51:16,243 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:16,243 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:16,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:16,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:16,365 INFO L477 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-10-27 04:51:16,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:16,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:16,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-10-27 04:51:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:16,394 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:16,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:16,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:51:16,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:51:16,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:51:16,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:51:16,399 INFO L87 Difference]: Start difference. First operand 348 states and 385 transitions. Second operand 5 states. [2018-10-27 04:51:16,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:16,647 INFO L93 Difference]: Finished difference Result 347 states and 384 transitions. [2018-10-27 04:51:16,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:51:16,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-10-27 04:51:16,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:16,648 INFO L225 Difference]: With dead ends: 347 [2018-10-27 04:51:16,648 INFO L226 Difference]: Without dead ends: 347 [2018-10-27 04:51:16,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 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-10-27 04:51:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-27 04:51:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-10-27 04:51:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-27 04:51:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 384 transitions. [2018-10-27 04:51:16,654 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 384 transitions. Word has length 68 [2018-10-27 04:51:16,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:16,654 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 384 transitions. [2018-10-27 04:51:16,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:51:16,654 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 384 transitions. [2018-10-27 04:51:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-27 04:51:16,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:16,655 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:16,655 INFO L424 AbstractCegarLoop]: === Iteration 25 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:16,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:16,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1745385398, now seen corresponding path program 1 times [2018-10-27 04:51:16,656 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:16,656 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:16,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:16,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:17,341 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:17,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:17,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:51:17,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:51:17,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:51:17,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:51:17,344 INFO L87 Difference]: Start difference. First operand 347 states and 384 transitions. Second operand 6 states. [2018-10-27 04:51:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:18,009 INFO L93 Difference]: Finished difference Result 340 states and 377 transitions. [2018-10-27 04:51:18,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:51:18,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-10-27 04:51:18,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:18,011 INFO L225 Difference]: With dead ends: 340 [2018-10-27 04:51:18,011 INFO L226 Difference]: Without dead ends: 340 [2018-10-27 04:51:18,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:51:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-27 04:51:18,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-27 04:51:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-27 04:51:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 377 transitions. [2018-10-27 04:51:18,018 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 377 transitions. Word has length 68 [2018-10-27 04:51:18,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:18,018 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 377 transitions. [2018-10-27 04:51:18,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:51:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 377 transitions. [2018-10-27 04:51:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-27 04:51:18,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:18,019 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:18,020 INFO L424 AbstractCegarLoop]: === Iteration 26 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:18,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:18,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1727627624, now seen corresponding path program 1 times [2018-10-27 04:51:18,020 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:18,020 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:18,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:18,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:18,149 INFO L477 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-10-27 04:51:18,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:18,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:18,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-10-27 04:51:18,172 INFO L477 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-10-27 04:51:18,174 INFO L477 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-10-27 04:51:18,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:18,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:18,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:18,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-10-27 04:51:18,198 INFO L477 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-10-27 04:51:18,199 INFO L477 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-10-27 04:51:18,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:18,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:18,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:18,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-10-27 04:51:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:18,212 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:18,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:18,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:51:18,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:51:18,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:51:18,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:51:18,216 INFO L87 Difference]: Start difference. First operand 340 states and 377 transitions. Second operand 8 states. [2018-10-27 04:51:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:18,722 INFO L93 Difference]: Finished difference Result 354 states and 393 transitions. [2018-10-27 04:51:18,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:51:18,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-10-27 04:51:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:18,726 INFO L225 Difference]: With dead ends: 354 [2018-10-27 04:51:18,726 INFO L226 Difference]: Without dead ends: 354 [2018-10-27 04:51:18,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:51:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-27 04:51:18,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 339. [2018-10-27 04:51:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-27 04:51:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 376 transitions. [2018-10-27 04:51:18,732 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 376 transitions. Word has length 69 [2018-10-27 04:51:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:18,732 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 376 transitions. [2018-10-27 04:51:18,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:51:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 376 transitions. [2018-10-27 04:51:18,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-27 04:51:18,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:18,736 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:18,736 INFO L424 AbstractCegarLoop]: === Iteration 27 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:18,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:18,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1727627625, now seen corresponding path program 1 times [2018-10-27 04:51:18,736 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:18,736 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:18,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:18,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:19,358 INFO L477 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-10-27 04:51:19,372 INFO L477 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-10-27 04:51:19,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:19,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:19,488 INFO L477 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-10-27 04:51:19,490 INFO L477 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-10-27 04:51:19,491 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:19,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:19,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:19,501 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-10-27 04:51:19,536 INFO L477 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-10-27 04:51:19,538 INFO L477 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-10-27 04:51:19,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:19,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:19,549 INFO L477 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-10-27 04:51:19,550 INFO L477 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-10-27 04:51:19,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:19,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:19,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:19,557 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-10-27 04:51:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:19,575 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:19,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:19,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 04:51:19,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:51:19,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:51:19,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:51:19,578 INFO L87 Difference]: Start difference. First operand 339 states and 376 transitions. Second operand 10 states. [2018-10-27 04:51:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:20,343 INFO L93 Difference]: Finished difference Result 365 states and 404 transitions. [2018-10-27 04:51:20,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 04:51:20,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2018-10-27 04:51:20,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:20,346 INFO L225 Difference]: With dead ends: 365 [2018-10-27 04:51:20,346 INFO L226 Difference]: Without dead ends: 365 [2018-10-27 04:51:20,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:51:20,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-27 04:51:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 338. [2018-10-27 04:51:20,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-27 04:51:20,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 375 transitions. [2018-10-27 04:51:20,355 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 375 transitions. Word has length 69 [2018-10-27 04:51:20,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:20,356 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 375 transitions. [2018-10-27 04:51:20,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:51:20,356 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 375 transitions. [2018-10-27 04:51:20,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-27 04:51:20,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:20,357 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:20,357 INFO L424 AbstractCegarLoop]: === Iteration 28 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:20,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:20,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1649417774, now seen corresponding path program 1 times [2018-10-27 04:51:20,358 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:20,358 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:20,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:20,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:20,498 INFO L477 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-10-27 04:51:20,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:20,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:20,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-10-27 04:51:20,537 INFO L477 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-10-27 04:51:20,539 INFO L477 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-10-27 04:51:20,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:20,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:20,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:20,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-10-27 04:51:20,569 INFO L477 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-10-27 04:51:20,571 INFO L477 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-10-27 04:51:20,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:20,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:20,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:20,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-10-27 04:51:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:20,586 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:20,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:20,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:51:20,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:51:20,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:51:20,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:51:20,588 INFO L87 Difference]: Start difference. First operand 338 states and 375 transitions. Second operand 8 states. [2018-10-27 04:51:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:21,091 INFO L93 Difference]: Finished difference Result 353 states and 392 transitions. [2018-10-27 04:51:21,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:51:21,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-10-27 04:51:21,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:21,095 INFO L225 Difference]: With dead ends: 353 [2018-10-27 04:51:21,095 INFO L226 Difference]: Without dead ends: 353 [2018-10-27 04:51:21,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:51:21,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-10-27 04:51:21,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 337. [2018-10-27 04:51:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-27 04:51:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 374 transitions. [2018-10-27 04:51:21,100 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 374 transitions. Word has length 73 [2018-10-27 04:51:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:21,100 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 374 transitions. [2018-10-27 04:51:21,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:51:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 374 transitions. [2018-10-27 04:51:21,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-27 04:51:21,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:21,101 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:21,101 INFO L424 AbstractCegarLoop]: === Iteration 29 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:21,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:21,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1649417775, now seen corresponding path program 1 times [2018-10-27 04:51:21,102 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:21,102 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:21,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:21,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:21,283 INFO L477 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-10-27 04:51:21,285 INFO L477 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-10-27 04:51:21,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:21,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:21,296 INFO L477 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-10-27 04:51:21,297 INFO L477 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-10-27 04:51:21,298 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:21,300 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:21,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:21,305 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2018-10-27 04:51:21,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-10-27 04:51:21,382 INFO L477 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 15 [2018-10-27 04:51:21,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:21,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:21,397 INFO L477 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-10-27 04:51:21,399 INFO L477 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-10-27 04:51:21,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:21,402 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:21,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:21,407 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-10-27 04:51:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:21,428 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:21,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:21,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 04:51:21,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:51:21,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:51:21,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:51:21,431 INFO L87 Difference]: Start difference. First operand 337 states and 374 transitions. Second operand 11 states. [2018-10-27 04:51:22,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:22,117 INFO L93 Difference]: Finished difference Result 364 states and 403 transitions. [2018-10-27 04:51:22,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 04:51:22,118 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-10-27 04:51:22,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:22,119 INFO L225 Difference]: With dead ends: 364 [2018-10-27 04:51:22,119 INFO L226 Difference]: Without dead ends: 364 [2018-10-27 04:51:22,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:51:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-10-27 04:51:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 336. [2018-10-27 04:51:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-10-27 04:51:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 373 transitions. [2018-10-27 04:51:22,126 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 373 transitions. Word has length 73 [2018-10-27 04:51:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:22,126 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 373 transitions. [2018-10-27 04:51:22,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:51:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 373 transitions. [2018-10-27 04:51:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-27 04:51:22,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:22,127 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:22,127 INFO L424 AbstractCegarLoop]: === Iteration 30 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:22,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:22,128 INFO L82 PathProgramCache]: Analyzing trace with hash -407656400, now seen corresponding path program 1 times [2018-10-27 04:51:22,128 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:22,128 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:22,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:22,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:22,343 INFO L477 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-10-27 04:51:22,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:51:22,415 INFO L477 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-10-27 04:51:22,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:51:22,434 INFO L477 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 14 treesize of output 11 [2018-10-27 04:51:22,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:11 [2018-10-27 04:51:22,527 INFO L477 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-10-27 04:51:22,530 INFO L477 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-10-27 04:51:22,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:23 [2018-10-27 04:51:22,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-10-27 04:51:22,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-10-27 04:51:22,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-10-27 04:51:22,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:51:22,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:51:22,677 INFO L477 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-10-27 04:51:22,681 INFO L477 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-10-27 04:51:22,681 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,684 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,704 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 2 xjuncts. [2018-10-27 04:51:22,704 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:39, output treesize:57 [2018-10-27 04:51:22,747 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:22,748 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:22,749 INFO L477 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 39 treesize of output 31 [2018-10-27 04:51:22,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:31 [2018-10-27 04:51:22,800 INFO L477 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-10-27 04:51:22,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 04:51:22,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:22,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2018-10-27 04:51:22,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-10-27 04:51:22,924 INFO L477 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-10-27 04:51:22,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-10-27 04:51:22,943 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:22,946 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:33, output treesize:5 [2018-10-27 04:51:22,972 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:22,973 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:22,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:22,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-27 04:51:22,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 04:51:22,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 04:51:22,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:51:22,975 INFO L87 Difference]: Start difference. First operand 336 states and 373 transitions. Second operand 17 states. [2018-10-27 04:51:24,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:24,643 INFO L93 Difference]: Finished difference Result 379 states and 423 transitions. [2018-10-27 04:51:24,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 04:51:24,644 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2018-10-27 04:51:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:24,645 INFO L225 Difference]: With dead ends: 379 [2018-10-27 04:51:24,645 INFO L226 Difference]: Without dead ends: 379 [2018-10-27 04:51:24,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2018-10-27 04:51:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-27 04:51:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 341. [2018-10-27 04:51:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-27 04:51:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 382 transitions. [2018-10-27 04:51:24,652 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 382 transitions. Word has length 74 [2018-10-27 04:51:24,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:24,652 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 382 transitions. [2018-10-27 04:51:24,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 04:51:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 382 transitions. [2018-10-27 04:51:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-27 04:51:24,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:24,655 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:24,655 INFO L424 AbstractCegarLoop]: === Iteration 31 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:24,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:24,655 INFO L82 PathProgramCache]: Analyzing trace with hash -407656399, now seen corresponding path program 1 times [2018-10-27 04:51:24,656 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:24,656 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:24,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:24,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:24,973 INFO L477 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-10-27 04:51:24,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:25,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:25,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:51:25,176 INFO L477 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-10-27 04:51:25,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:25,182 INFO L477 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-10-27 04:51:25,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:25,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:25,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:51:25,215 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:25,216 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:25,217 INFO L477 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-10-27 04:51:25,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:25,226 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:25,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-10-27 04:51:25,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:25,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:25,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-10-27 04:51:25,402 INFO L477 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-10-27 04:51:25,405 INFO L477 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-10-27 04:51:25,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:25,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:25,429 INFO L477 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-10-27 04:51:25,432 INFO L477 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-10-27 04:51:25,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:25,435 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:25,453 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-10-27 04:51:25,453 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:37 [2018-10-27 04:51:25,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-10-27 04:51:25,601 INFO L477 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-10-27 04:51:25,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:25,649 INFO L477 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 2 case distinctions, treesize of input 17 treesize of output 22 [2018-10-27 04:51:25,650 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 04:51:25,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:51:25,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-10-27 04:51:25,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-10-27 04:51:25,768 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:51:25,815 INFO L477 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-10-27 04:51:25,815 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:25,842 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:51:25,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-10-27 04:51:25,893 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:53, output treesize:161 [2018-10-27 04:51:26,458 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2018-10-27 04:51:26,481 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:51:26,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:26,549 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:26,550 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:26,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-27 04:51:26,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:26,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:26,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:102, output treesize:51 [2018-10-27 04:51:26,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2018-10-27 04:51:26,662 INFO L477 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 3 [2018-10-27 04:51:26,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:26,672 INFO L477 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 29 treesize of output 25 [2018-10-27 04:51:26,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:26,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:26,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-10-27 04:51:26,697 INFO L477 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-10-27 04:51:26,697 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:26,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-10-27 04:51:26,704 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:26,706 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:26,712 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-10-27 04:51:26,712 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:78, output treesize:16 [2018-10-27 04:51:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:26,761 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:26,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:26,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-10-27 04:51:26,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 04:51:26,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 04:51:26,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-10-27 04:51:26,763 INFO L87 Difference]: Start difference. First operand 341 states and 382 transitions. Second operand 18 states. [2018-10-27 04:51:29,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:29,662 INFO L93 Difference]: Finished difference Result 392 states and 434 transitions. [2018-10-27 04:51:29,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 04:51:29,664 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2018-10-27 04:51:29,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:29,665 INFO L225 Difference]: With dead ends: 392 [2018-10-27 04:51:29,665 INFO L226 Difference]: Without dead ends: 392 [2018-10-27 04:51:29,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=106, Invalid=705, Unknown=1, NotChecked=0, Total=812 [2018-10-27 04:51:29,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-10-27 04:51:29,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 341. [2018-10-27 04:51:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-27 04:51:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 381 transitions. [2018-10-27 04:51:29,671 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 381 transitions. Word has length 74 [2018-10-27 04:51:29,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:29,671 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 381 transitions. [2018-10-27 04:51:29,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 04:51:29,671 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 381 transitions. [2018-10-27 04:51:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-27 04:51:29,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:29,672 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:51:29,672 INFO L424 AbstractCegarLoop]: === Iteration 32 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:29,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:29,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2142402517, now seen corresponding path program 1 times [2018-10-27 04:51:29,677 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:29,678 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:29,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:29,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:29,896 INFO L477 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-10-27 04:51:29,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:29,908 INFO L477 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-10-27 04:51:29,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:29,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:29,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:51:29,944 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32))) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)))) is different from true [2018-10-27 04:51:29,947 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32)) |c_create_data_#t~malloc6.base| (_ bv80 32))) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)))) is different from true [2018-10-27 04:51:29,950 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| (_ BitVec 32)) (|create_data_#t~malloc6.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32)) |create_data_#t~malloc6.base| (_ bv80 32))) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)))) is different from true [2018-10-27 04:51:29,973 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:29,974 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:29,975 INFO L477 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-10-27 04:51:29,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:29,986 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:29,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-10-27 04:51:29,991 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:29,992 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:30,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 28 [2018-10-27 04:51:30,234 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-27 04:51:30,266 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:51:30,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-10-27 04:51:30,292 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:48 [2018-10-27 04:51:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 04:51:30,342 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:30,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:30,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 04:51:30,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:51:30,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:51:30,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=24, Unknown=3, NotChecked=30, Total=72 [2018-10-27 04:51:30,345 INFO L87 Difference]: Start difference. First operand 341 states and 381 transitions. Second operand 9 states. [2018-10-27 04:51:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:30,875 INFO L93 Difference]: Finished difference Result 344 states and 379 transitions. [2018-10-27 04:51:30,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:51:30,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2018-10-27 04:51:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:30,877 INFO L225 Difference]: With dead ends: 344 [2018-10-27 04:51:30,878 INFO L226 Difference]: Without dead ends: 344 [2018-10-27 04:51:30,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=32, Unknown=3, NotChecked=36, Total=90 [2018-10-27 04:51:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-27 04:51:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 326. [2018-10-27 04:51:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-27 04:51:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 361 transitions. [2018-10-27 04:51:30,886 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 361 transitions. Word has length 76 [2018-10-27 04:51:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:30,887 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 361 transitions. [2018-10-27 04:51:30,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:51:30,887 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 361 transitions. [2018-10-27 04:51:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 04:51:30,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:30,888 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:51:30,888 INFO L424 AbstractCegarLoop]: === Iteration 33 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:30,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:30,888 INFO L82 PathProgramCache]: Analyzing trace with hash 675345198, now seen corresponding path program 1 times [2018-10-27 04:51:30,888 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:30,889 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:30,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:31,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:31,129 INFO L477 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 14 treesize of output 11 [2018-10-27 04:51:31,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:31,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:31,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:11 [2018-10-27 04:51:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:31,144 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:31,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:31,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:51:31,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:51:31,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:51:31,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:51:31,146 INFO L87 Difference]: Start difference. First operand 326 states and 361 transitions. Second operand 5 states. [2018-10-27 04:51:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:31,434 INFO L93 Difference]: Finished difference Result 325 states and 359 transitions. [2018-10-27 04:51:31,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:51:31,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-10-27 04:51:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:31,435 INFO L225 Difference]: With dead ends: 325 [2018-10-27 04:51:31,436 INFO L226 Difference]: Without dead ends: 325 [2018-10-27 04:51:31,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:51:31,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-10-27 04:51:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-10-27 04:51:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-27 04:51:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 359 transitions. [2018-10-27 04:51:31,439 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 359 transitions. Word has length 77 [2018-10-27 04:51:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:31,440 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 359 transitions. [2018-10-27 04:51:31,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:51:31,440 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 359 transitions. [2018-10-27 04:51:31,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 04:51:31,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:31,442 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:51:31,442 INFO L424 AbstractCegarLoop]: === Iteration 34 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:31,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:31,442 INFO L82 PathProgramCache]: Analyzing trace with hash 675345199, now seen corresponding path program 1 times [2018-10-27 04:51:31,442 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:31,443 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:31,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:31,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:31,685 INFO L477 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-10-27 04:51:31,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:31,705 INFO L477 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-10-27 04:51:31,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:31,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:31,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:51:31,741 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:31,741 INFO L477 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-10-27 04:51:31,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:31,754 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:31,755 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:31,755 INFO L477 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-10-27 04:51:31,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:31,763 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-10-27 04:51:31,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-10-27 04:51:31,781 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:31,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:51:32,590 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 04:51:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:32,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:51:32,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2018-10-27 04:51:32,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:51:32,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:51:32,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:51:32,605 INFO L87 Difference]: Start difference. First operand 325 states and 359 transitions. Second operand 11 states. [2018-10-27 04:51:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:34,636 INFO L93 Difference]: Finished difference Result 339 states and 372 transitions. [2018-10-27 04:51:34,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 04:51:34,637 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-10-27 04:51:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:34,638 INFO L225 Difference]: With dead ends: 339 [2018-10-27 04:51:34,639 INFO L226 Difference]: Without dead ends: 339 [2018-10-27 04:51:34,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:51:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-27 04:51:34,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 303. [2018-10-27 04:51:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-27 04:51:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 333 transitions. [2018-10-27 04:51:34,643 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 333 transitions. Word has length 77 [2018-10-27 04:51:34,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:34,643 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 333 transitions. [2018-10-27 04:51:34,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:51:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 333 transitions. [2018-10-27 04:51:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 04:51:34,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:34,644 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:34,644 INFO L424 AbstractCegarLoop]: === Iteration 35 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:34,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:34,645 INFO L82 PathProgramCache]: Analyzing trace with hash 674457002, now seen corresponding path program 1 times [2018-10-27 04:51:34,647 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:34,647 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:34,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:34,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:34,869 INFO L477 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-10-27 04:51:34,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:34,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:34,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:51:34,921 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc6.base| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| c_create_data_~data~0.base (_ bv1 1)))) (and (= (store .cse0 |create_data_#t~malloc6.base| (_ bv1 1)) |c_#valid|) (= (select .cse0 |create_data_#t~malloc6.base|) (_ bv0 1))))) is different from true [2018-10-27 04:51:34,962 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc6.base| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| c_create_data_~data~0.base (_ bv1 1)))) (and (= (select .cse0 |create_data_#t~malloc6.base|) (_ bv0 1)) (= |c_#valid| (store (store .cse0 |create_data_#t~malloc6.base| (_ bv1 1)) |c_create_data_#t~malloc20.base| (_ bv1 1)))))) is different from true [2018-10-27 04:51:35,129 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:35,131 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:35,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-10-27 04:51:35,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-10-27 04:51:35,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-10-27 04:51:35,143 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:35,153 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:35,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:35,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:35,171 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:29 [2018-10-27 04:51:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 2 not checked. [2018-10-27 04:51:35,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:51:35,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:51:35,316 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:51:35,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:35,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:35,409 INFO L477 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-10-27 04:51:35,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:35,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:35,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:51:36,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:51:36,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:51:36,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:36,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:36,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:36,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:35 [2018-10-27 04:51:36,095 INFO L477 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 39 treesize of output 33 [2018-10-27 04:51:36,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2018-10-27 04:51:36,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:36,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:36,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:36,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:23 [2018-10-27 04:51:36,112 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)))) (and (= |c_#valid| (store .cse0 |c_create_data_#t~mem8.base| (_ bv1 1))) (= (_ bv0 1) (select .cse0 |c_create_data_#t~mem8.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base))))) is different from true [2018-10-27 04:51:36,202 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~mem8.base| (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)))) (let ((.cse0 (store .cse1 |create_data_#t~mem8.base| (_ bv1 1)))) (and (= (select .cse0 |c_create_data_#t~malloc20.base|) (_ bv0 1)) (= (_ bv0 1) (select .cse1 |create_data_#t~mem8.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#valid| (store .cse0 |c_create_data_#t~malloc20.base| (_ bv1 1))))))) is different from true [2018-10-27 04:51:36,226 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~mem8.base| (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)))) (let ((.cse0 (store .cse1 |create_data_#t~mem8.base| (_ bv1 1)))) (and (= (select .cse0 create_data_~nextData~0.base) (_ bv0 1)) (= (_ bv0 1) (select .cse1 |create_data_#t~mem8.base|)) (= (store .cse0 create_data_~nextData~0.base (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))))) is different from true [2018-10-27 04:51:36,277 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:36,279 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:36,281 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:36,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-10-27 04:51:36,319 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:36,320 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:36,321 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:36,322 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:36,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2018-10-27 04:51:36,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 53 [2018-10-27 04:51:36,328 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:36,357 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:36,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:36,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:36,396 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:44, output treesize:47 [2018-10-27 04:51:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 4 not checked. [2018-10-27 04:51:36,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:51:36,670 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-27 04:51:36,889 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-27 04:51:37,070 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-27 04:51:37,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:51:37,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2018-10-27 04:51:37,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 04:51:37,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 04:51:37,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=270, Unknown=31, NotChecked=190, Total=552 [2018-10-27 04:51:37,869 INFO L87 Difference]: Start difference. First operand 303 states and 333 transitions. Second operand 22 states. [2018-10-27 04:51:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:40,815 INFO L93 Difference]: Finished difference Result 354 states and 386 transitions. [2018-10-27 04:51:40,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 04:51:40,817 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2018-10-27 04:51:40,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:40,818 INFO L225 Difference]: With dead ends: 354 [2018-10-27 04:51:40,818 INFO L226 Difference]: Without dead ends: 354 [2018-10-27 04:51:40,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=118, Invalid=585, Unknown=73, NotChecked=280, Total=1056 [2018-10-27 04:51:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-27 04:51:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 339. [2018-10-27 04:51:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-27 04:51:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 374 transitions. [2018-10-27 04:51:40,824 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 374 transitions. Word has length 77 [2018-10-27 04:51:40,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:40,825 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 374 transitions. [2018-10-27 04:51:40,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-27 04:51:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 374 transitions. [2018-10-27 04:51:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 04:51:40,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:40,826 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:40,826 INFO L424 AbstractCegarLoop]: === Iteration 36 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:40,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:40,826 INFO L82 PathProgramCache]: Analyzing trace with hash 674457003, now seen corresponding path program 1 times [2018-10-27 04:51:40,827 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:40,827 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:40,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:41,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:41,169 INFO L477 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-10-27 04:51:41,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:41,215 INFO L477 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-10-27 04:51:41,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:41,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:41,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:51:41,248 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |create_data_#t~malloc5.base| (_ bv1 1))) (= |c_#length| (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32))) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)))) is different from true [2018-10-27 04:51:41,251 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32)) |c_create_data_#t~malloc6.base| (_ bv80 32))) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)) (= (select (store |c_old(#valid)| |create_data_#t~malloc5.base| (_ bv1 1)) |c_create_data_#t~malloc6.base|) (_ bv0 1)))) is different from true [2018-10-27 04:51:41,255 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| (_ BitVec 32)) (|create_data_#t~malloc6.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32)) |create_data_#t~malloc6.base| (_ bv80 32))) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)) (= (select (store |c_old(#valid)| |create_data_#t~malloc5.base| (_ bv1 1)) |create_data_#t~malloc6.base|) (_ bv0 1)))) is different from true [2018-10-27 04:51:41,268 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| (_ BitVec 32)) (|create_data_#t~malloc6.base| (_ BitVec 32))) (and (= |c_#length| (store (store (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32)) |create_data_#t~malloc6.base| (_ bv80 32)) |c_create_data_#t~malloc20.base| (_ bv16 32))) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)) (= (select (store |c_old(#valid)| |create_data_#t~malloc5.base| (_ bv1 1)) |create_data_#t~malloc6.base|) (_ bv0 1)))) is different from true [2018-10-27 04:51:41,272 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| (_ BitVec 32)) (|create_data_#t~malloc6.base| (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32))) (and (= (store (store (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32)) |create_data_#t~malloc6.base| (_ bv80 32)) create_data_~nextData~0.base (_ bv16 32)) |c_#length|) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)) (= (select (store |c_old(#valid)| |create_data_#t~malloc5.base| (_ bv1 1)) |create_data_#t~malloc6.base|) (_ bv0 1)))) is different from true [2018-10-27 04:51:41,313 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:41,314 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:41,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2018-10-27 04:51:41,326 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:41,329 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:41,331 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:41,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2018-10-27 04:51:41,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 41 [2018-10-27 04:51:41,353 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-27 04:51:41,420 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:51:41,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:51:41,508 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:41,509 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:41,510 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:41,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-10-27 04:51:41,512 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:41,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-10-27 04:51:41,563 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:43, output treesize:87 [2018-10-27 04:51:41,772 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-10-27 04:51:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 2 not checked. [2018-10-27 04:51:41,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:51:42,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:51:42,011 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:51:42,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:42,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:42,086 INFO L477 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-10-27 04:51:42,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:42,093 INFO L477 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-10-27 04:51:42,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:42,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:42,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:51:42,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:51:42,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:51:42,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:42,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:42,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:42,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:50 [2018-10-27 04:51:42,397 INFO L477 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 54 treesize of output 46 [2018-10-27 04:51:42,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 27 [2018-10-27 04:51:42,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:42,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:42,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:42,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:32 [2018-10-27 04:51:42,426 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base (_ bv16 32)) |c_create_data_#t~mem8.base| (_ bv80 32))) (= |c_#valid| (store .cse0 |c_create_data_#t~mem8.base| (_ bv1 1))) (= (_ bv0 1) (select .cse0 |c_create_data_#t~mem8.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base))))) is different from true [2018-10-27 04:51:42,602 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~mem8.base| (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)))) (and (= (select (store .cse0 |create_data_#t~mem8.base| (_ bv1 1)) |c_create_data_#t~malloc20.base|) (_ bv0 1)) (= (_ bv0 1) (select .cse0 |create_data_#t~mem8.base|)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base (_ bv16 32)) |create_data_#t~mem8.base| (_ bv80 32)) |c_create_data_#t~malloc20.base| (_ bv16 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base))))) is different from true [2018-10-27 04:51:42,626 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~mem8.base| (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)))) (and (= (select (store .cse0 |create_data_#t~mem8.base| (_ bv1 1)) create_data_~nextData~0.base) (_ bv0 1)) (= (_ bv0 1) (select .cse0 |create_data_#t~mem8.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= (store (store (store |c_old(#length)| create_data_~data~0.base (_ bv16 32)) |create_data_#t~mem8.base| (_ bv80 32)) create_data_~nextData~0.base (_ bv16 32)) |c_#length|)))) is different from true [2018-10-27 04:51:42,661 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:42,663 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:42,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2018-10-27 04:51:42,683 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:42,684 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:42,686 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:42,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2018-10-27 04:51:42,697 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:42,698 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:42,699 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:42,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 65 [2018-10-27 04:51:42,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:42,724 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:42,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:42,766 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:42,767 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:42,768 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:42,769 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:42,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-10-27 04:51:42,797 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:42,798 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:42,798 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:51:42,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-10-27 04:51:42,799 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:42,809 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:42,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:42,843 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:54, output treesize:30 [2018-10-27 04:51:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 4 not checked. [2018-10-27 04:51:42,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:51:43,004 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-10-27 04:51:43,158 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-27 04:51:43,361 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 04:51:47,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:51:47,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 19 [2018-10-27 04:51:47,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 04:51:47,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 04:51:47,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=175, Unknown=11, NotChecked=264, Total=506 [2018-10-27 04:51:47,805 INFO L87 Difference]: Start difference. First operand 339 states and 374 transitions. Second operand 20 states. [2018-10-27 04:51:48,940 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2018-10-27 04:51:49,245 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|create_data_#t~malloc5.base| (_ BitVec 32)) (|create_data_#t~malloc6.base| (_ BitVec 32))) (and (= |c_#length| (store (store (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32)) |create_data_#t~malloc6.base| (_ bv80 32)) |c_create_data_#t~malloc20.base| (_ bv16 32))) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)) (= (select (store |c_old(#valid)| |create_data_#t~malloc5.base| (_ bv1 1)) |create_data_#t~malloc6.base|) (_ bv0 1)))) (exists ((|create_data_#t~mem8.base| (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)))) (and (= (select (store .cse0 |create_data_#t~mem8.base| (_ bv1 1)) |c_create_data_#t~malloc20.base|) (_ bv0 1)) (= (_ bv0 1) (select .cse0 |create_data_#t~mem8.base|)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base (_ bv16 32)) |create_data_#t~mem8.base| (_ bv80 32)) |c_create_data_#t~malloc20.base| (_ bv16 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))))) is different from true [2018-10-27 04:51:49,286 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|create_data_#t~mem8.base| (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)))) (and (= (select (store .cse0 |create_data_#t~mem8.base| (_ bv1 1)) create_data_~nextData~0.base) (_ bv0 1)) (= (_ bv0 1) (select .cse0 |create_data_#t~mem8.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= (store (store (store |c_old(#length)| create_data_~data~0.base (_ bv16 32)) |create_data_#t~mem8.base| (_ bv80 32)) create_data_~nextData~0.base (_ bv16 32)) |c_#length|)))) (exists ((|create_data_#t~malloc5.base| (_ BitVec 32)) (|create_data_#t~malloc6.base| (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32))) (and (= (store (store (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32)) |create_data_#t~malloc6.base| (_ bv80 32)) create_data_~nextData~0.base (_ bv16 32)) |c_#length|) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)) (= (select (store |c_old(#valid)| |create_data_#t~malloc5.base| (_ bv1 1)) |create_data_#t~malloc6.base|) (_ bv0 1))))) is different from true [2018-10-27 04:51:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:51,044 INFO L93 Difference]: Finished difference Result 350 states and 383 transitions. [2018-10-27 04:51:51,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 04:51:51,045 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2018-10-27 04:51:51,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:51,047 INFO L225 Difference]: With dead ends: 350 [2018-10-27 04:51:51,047 INFO L226 Difference]: Without dead ends: 350 [2018-10-27 04:51:51,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 134 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=99, Invalid=346, Unknown=15, NotChecked=470, Total=930 [2018-10-27 04:51:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-27 04:51:51,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 339. [2018-10-27 04:51:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-27 04:51:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 372 transitions. [2018-10-27 04:51:51,053 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 372 transitions. Word has length 77 [2018-10-27 04:51:51,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:51,053 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 372 transitions. [2018-10-27 04:51:51,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 04:51:51,053 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 372 transitions. [2018-10-27 04:51:51,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-27 04:51:51,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:51,054 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:51,055 INFO L424 AbstractCegarLoop]: === Iteration 37 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:51,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:51,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1077480384, now seen corresponding path program 1 times [2018-10-27 04:51:51,055 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:51,056 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:51,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:51,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:51,230 INFO L477 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-10-27 04:51:51,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:51,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:51,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-10-27 04:51:51,264 INFO L477 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-10-27 04:51:51,266 INFO L477 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-10-27 04:51:51,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:51,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:51,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:51,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-10-27 04:51:51,292 INFO L477 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-10-27 04:51:51,295 INFO L477 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-10-27 04:51:51,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:51,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:51,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:51,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-27 04:51:51,309 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:51:51,310 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:51:51,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:51:51,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:51:51,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:51:51,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:51:51,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:51:51,312 INFO L87 Difference]: Start difference. First operand 339 states and 372 transitions. Second operand 8 states. [2018-10-27 04:51:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:51:51,887 INFO L93 Difference]: Finished difference Result 353 states and 388 transitions. [2018-10-27 04:51:51,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:51:51,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-10-27 04:51:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:51:51,889 INFO L225 Difference]: With dead ends: 353 [2018-10-27 04:51:51,889 INFO L226 Difference]: Without dead ends: 353 [2018-10-27 04:51:51,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:51:51,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-10-27 04:51:51,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 344. [2018-10-27 04:51:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-27 04:51:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 379 transitions. [2018-10-27 04:51:51,895 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 379 transitions. Word has length 78 [2018-10-27 04:51:51,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:51:51,895 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 379 transitions. [2018-10-27 04:51:51,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:51:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 379 transitions. [2018-10-27 04:51:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-27 04:51:51,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:51:51,896 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:51:51,897 INFO L424 AbstractCegarLoop]: === Iteration 38 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:51:51,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:51:51,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1077480383, now seen corresponding path program 1 times [2018-10-27 04:51:51,900 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:51:51,900 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:51:51,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:51:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:51:52,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:51:52,131 INFO L477 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-10-27 04:51:52,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:52,161 INFO L477 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-10-27 04:51:52,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:52,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:52,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-10-27 04:51:52,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:51:52,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:51:52,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:52,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:52,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:52,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-10-27 04:51:52,339 INFO L477 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 13 [2018-10-27 04:51:52,341 INFO L477 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 13 treesize of output 9 [2018-10-27 04:51:52,341 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:52,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:52,348 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-10-27 04:51:52,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:15 [2018-10-27 04:51:52,403 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:52,405 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:52,406 INFO L477 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-10-27 04:51:52,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:52,450 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:52,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-10-27 04:51:52,458 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:52,459 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:51:52,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 28 [2018-10-27 04:51:52,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-27 04:51:52,513 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:51:52,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-10-27 04:51:52,550 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:66 [2018-10-27 04:51:52,781 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2018-10-27 04:51:52,819 INFO L477 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 33 treesize of output 30 [2018-10-27 04:51:52,841 INFO L477 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-10-27 04:51:52,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:52,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:53,282 INFO L477 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 35 treesize of output 32 [2018-10-27 04:51:53,296 INFO L477 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-10-27 04:51:53,296 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:53,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:53,746 INFO L477 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 31 treesize of output 28 [2018-10-27 04:51:53,761 INFO L477 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-10-27 04:51:53,761 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:53,893 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:54,230 INFO L477 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 29 treesize of output 26 [2018-10-27 04:51:54,245 INFO L477 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-10-27 04:51:54,245 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:54,363 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:54,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 04:51:54,674 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:69, output treesize:47 [2018-10-27 04:51:55,136 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 04:51:55,469 INFO L477 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 38 treesize of output 34 [2018-10-27 04:51:55,473 INFO L477 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-10-27 04:51:55,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:55,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:55,531 INFO L477 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 36 treesize of output 32 [2018-10-27 04:51:55,534 INFO L477 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-10-27 04:51:55,535 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:55,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:55,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-27 04:51:55,575 INFO L477 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-10-27 04:51:55,576 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:55,583 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:55,607 INFO L477 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-10-27 04:51:55,613 INFO L477 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-10-27 04:51:55,613 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:55,620 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:55,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 04:51:55,638 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:75, output treesize:31 [2018-10-27 04:51:55,721 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 04:51:55,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:51:57,706 WARN L179 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 68 [2018-10-27 04:51:57,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-10-27 04:51:57,754 INFO L477 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 26 treesize of output 20 [2018-10-27 04:51:57,754 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:57,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:57,776 INFO L477 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 42 treesize of output 36 [2018-10-27 04:51:57,784 INFO L477 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 26 treesize of output 20 [2018-10-27 04:51:57,784 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:57,841 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:57,849 INFO L477 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 42 treesize of output 36 [2018-10-27 04:51:57,857 INFO L477 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 26 treesize of output 20 [2018-10-27 04:51:57,857 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:57,893 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:57,899 INFO L477 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 38 treesize of output 32 [2018-10-27 04:51:57,905 INFO L477 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 26 treesize of output 20 [2018-10-27 04:51:57,906 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:57,922 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:57,934 INFO L477 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 39 treesize of output 35 [2018-10-27 04:51:57,944 INFO L477 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-10-27 04:51:57,946 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 04:51:57,966 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:51:57,972 INFO L477 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 35 treesize of output 29 [2018-10-27 04:51:57,977 INFO L477 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 26 treesize of output 20 [2018-10-27 04:51:57,978 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:57,993 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:58,529 INFO L477 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 23 treesize of output 21 [2018-10-27 04:51:58,536 INFO L477 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 10 treesize of output 8 [2018-10-27 04:51:58,536 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:58,555 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:58,563 INFO L477 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 30 treesize of output 28 [2018-10-27 04:51:58,571 INFO L477 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 10 treesize of output 8 [2018-10-27 04:51:58,571 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:58,608 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:58,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-10-27 04:51:58,622 INFO L477 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 10 treesize of output 8 [2018-10-27 04:51:58,622 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:58,659 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:58,666 INFO L477 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 26 treesize of output 24 [2018-10-27 04:51:58,672 INFO L477 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 10 treesize of output 8 [2018-10-27 04:51:58,673 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:58,691 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:58,698 INFO L477 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 23 treesize of output 21 [2018-10-27 04:51:58,702 INFO L477 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 10 treesize of output 8 [2018-10-27 04:51:58,702 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:58,716 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:59,379 INFO L477 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 57 treesize of output 47 [2018-10-27 04:51:59,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-10-27 04:51:59,383 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:59,403 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:59,407 INFO L477 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 57 treesize of output 47 [2018-10-27 04:51:59,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-10-27 04:51:59,411 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:51:59,436 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:00,155 INFO L477 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 37 treesize of output 33 [2018-10-27 04:52:00,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-27 04:52:00,160 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:00,189 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:00,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-10-27 04:52:00,196 INFO L477 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 20 treesize of output 16 [2018-10-27 04:52:00,197 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:00,214 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:01,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 14 dim-0 vars, and 9 xjuncts. [2018-10-27 04:52:01,002 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 4 variables, input treesize:221, output treesize:229 [2018-10-27 04:52:02,754 WARN L179 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 113 DAG size of output: 78 [2018-10-27 04:52:03,756 WARN L179 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 95 [2018-10-27 04:52:03,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:52:03,759 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:52:03,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:52:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:52:03,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:52:03,893 INFO L477 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-10-27 04:52:03,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:03,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:52:03,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-10-27 04:52:04,135 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32))) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)))) is different from true [2018-10-27 04:52:04,138 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32)) |c_create_data_#t~malloc6.base| (_ bv80 32))) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)))) is different from true [2018-10-27 04:52:04,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:52:04,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:52:04,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:04,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:52:04,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:04,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-10-27 04:52:04,164 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc5.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32)) (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32))) (_ bv80 32))) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)))) is different from true [2018-10-27 04:52:04,189 INFO L477 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 13 [2018-10-27 04:52:04,209 INFO L477 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 13 treesize of output 9 [2018-10-27 04:52:04,210 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:04,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:04,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:04,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:15 [2018-10-27 04:52:04,241 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_102 (_ BitVec 32)) (|create_data_#t~malloc5.base| (_ BitVec 32))) (and (= (store (store |c_old(#length)| |create_data_#t~malloc5.base| (_ bv16 32)) v_arrayElimCell_102 (_ bv80 32)) |c_#length|) (= (select |c_old(#valid)| |create_data_#t~malloc5.base|) (_ bv0 1)))) is different from true [2018-10-27 04:52:04,297 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:52:04,325 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:52:04,326 INFO L477 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-10-27 04:52:04,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:04,533 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:52:04,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-10-27 04:52:04,541 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:52:04,542 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:52:04,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 28 [2018-10-27 04:52:04,557 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-27 04:52:04,820 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:52:04,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-10-27 04:52:04,864 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:68 [2018-10-27 04:52:04,979 INFO L477 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 33 treesize of output 30 [2018-10-27 04:52:04,982 INFO L477 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-10-27 04:52:04,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:04,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:52:05,094 INFO L477 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 35 treesize of output 32 [2018-10-27 04:52:05,097 INFO L477 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-10-27 04:52:05,097 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:05,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:52:05,169 INFO L477 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 29 treesize of output 26 [2018-10-27 04:52:05,171 INFO L477 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-10-27 04:52:05,171 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:05,185 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:52:05,220 INFO L477 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 31 treesize of output 28 [2018-10-27 04:52:05,223 INFO L477 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-10-27 04:52:05,223 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:05,234 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:52:05,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 04:52:05,265 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:69, output treesize:47 [2018-10-27 04:52:05,750 INFO L477 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 38 treesize of output 34 [2018-10-27 04:52:05,774 INFO L477 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-10-27 04:52:05,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:05,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:52:05,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-27 04:52:05,824 INFO L477 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-10-27 04:52:05,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:05,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:52:05,859 INFO L477 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 36 treesize of output 32 [2018-10-27 04:52:05,862 INFO L477 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-10-27 04:52:05,862 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:05,872 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:52:05,894 INFO L477 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-10-27 04:52:05,897 INFO L477 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-10-27 04:52:05,897 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:52:05,903 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:52:05,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 04:52:05,919 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:75, output treesize:31 [2018-10-27 04:52:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 8 not checked. [2018-10-27 04:52:05,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:52:06,133 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-10-27 04:52:07,164 WARN L179 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 68 [2018-10-27 04:52:07,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2018-10-27 04:52:07,214 INFO L477 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 13 treesize of output 11 [2018-10-27 04:52:07,215 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:07,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:07,258 INFO L477 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 60 treesize of output 56 [2018-10-27 04:52:07,262 INFO L477 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 28 treesize of output 24 [2018-10-27 04:52:07,262 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:07,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:07,288 INFO L477 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 57 treesize of output 53 [2018-10-27 04:52:07,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-10-27 04:52:07,292 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:07,313 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:07,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2018-10-27 04:52:07,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-10-27 04:52:07,325 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:07,368 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:07,371 INFO L477 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 57 treesize of output 53 [2018-10-27 04:52:07,375 INFO L477 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 28 treesize of output 24 [2018-10-27 04:52:07,376 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:07,399 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:07,404 INFO L477 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 67 treesize of output 63 [2018-10-27 04:52:07,410 INFO L477 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 28 treesize of output 24 [2018-10-27 04:52:07,411 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:07,452 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:07,457 INFO L477 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 64 treesize of output 60 [2018-10-27 04:52:07,463 INFO L477 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 28 treesize of output 24 [2018-10-27 04:52:07,464 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:07,505 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:08,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2018-10-27 04:52:08,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-10-27 04:52:08,042 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:08,070 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:08,079 INFO L477 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 56 treesize of output 46 [2018-10-27 04:52:08,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-10-27 04:52:08,086 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:08,120 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:08,125 INFO L477 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 59 treesize of output 49 [2018-10-27 04:52:08,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-10-27 04:52:08,131 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:08,179 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:08,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-10-27 04:52:08,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-10-27 04:52:08,187 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:08,214 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:08,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-10-27 04:52:08,222 INFO L477 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 36 treesize of output 26 [2018-10-27 04:52:08,223 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:08,247 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:08,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2018-10-27 04:52:08,262 INFO L477 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 36 treesize of output 26 [2018-10-27 04:52:08,262 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:08,301 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:09,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-10-27 04:52:09,381 INFO L477 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 26 treesize of output 20 [2018-10-27 04:52:09,382 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:09,401 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:09,423 INFO L477 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 35 treesize of output 29 [2018-10-27 04:52:09,426 INFO L477 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 26 treesize of output 20 [2018-10-27 04:52:09,427 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:09,441 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:10,517 INFO L477 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 23 treesize of output 21 [2018-10-27 04:52:10,520 INFO L477 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 10 treesize of output 8 [2018-10-27 04:52:10,520 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:10,538 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:10,544 INFO L477 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 23 treesize of output 21 [2018-10-27 04:52:10,550 INFO L477 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 10 treesize of output 8 [2018-10-27 04:52:10,550 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:10,565 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:52:11,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 16 dim-0 vars, and 10 xjuncts. [2018-10-27 04:52:11,599 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 4 variables, input treesize:221, output treesize:298 [2018-10-27 04:52:30,893 WARN L179 SmtUtils]: Spent 12.81 s on a formula simplification. DAG size of input: 140 DAG size of output: 78 [2018-10-27 04:53:06,223 WARN L179 SmtUtils]: Spent 32.59 s on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2018-10-27 04:53:09,256 WARN L179 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 101 [2018-10-27 04:53:09,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:53:09,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 25 [2018-10-27 04:53:09,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 04:53:09,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 04:53:09,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=882, Unknown=7, NotChecked=252, Total=1260 [2018-10-27 04:53:09,276 INFO L87 Difference]: Start difference. First operand 344 states and 379 transitions. Second operand 26 states. [2018-10-27 04:53:12,021 WARN L179 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2018-10-27 04:53:12,810 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2018-10-27 04:53:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:53:14,321 INFO L93 Difference]: Finished difference Result 390 states and 431 transitions. [2018-10-27 04:53:14,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 04:53:14,323 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 78 [2018-10-27 04:53:14,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:53:14,324 INFO L225 Difference]: With dead ends: 390 [2018-10-27 04:53:14,324 INFO L226 Difference]: Without dead ends: 390 [2018-10-27 04:53:14,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 152 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 65.3s TimeCoverageRelationStatistics Valid=185, Invalid=1463, Unknown=8, NotChecked=324, Total=1980 [2018-10-27 04:53:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-10-27 04:53:14,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 361. [2018-10-27 04:53:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-27 04:53:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 402 transitions. [2018-10-27 04:53:14,330 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 402 transitions. Word has length 78 [2018-10-27 04:53:14,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:53:14,330 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 402 transitions. [2018-10-27 04:53:14,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-27 04:53:14,330 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 402 transitions. [2018-10-27 04:53:14,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-27 04:53:14,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:53:14,331 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:53:14,331 INFO L424 AbstractCegarLoop]: === Iteration 39 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:53:14,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:53:14,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1755183838, now seen corresponding path program 1 times [2018-10-27 04:53:14,332 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:53:14,332 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:53:14,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:53:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:53:14,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:53:14,650 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:14,651 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:14,652 INFO L477 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-10-27 04:53:14,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:14,667 INFO L477 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-10-27 04:53:14,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:14,677 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-10-27 04:53:14,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-10-27 04:53:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:53:14,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:53:15,126 INFO L477 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 24 treesize of output 22 [2018-10-27 04:53:15,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:53:15,165 INFO L477 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 18 treesize of output 16 [2018-10-27 04:53:15,166 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:53:15,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-10-27 04:53:15,210 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:53:15,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-10-27 04:53:15,244 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:64, output treesize:53 [2018-10-27 04:53:15,435 INFO L477 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 12 treesize of output 7 [2018-10-27 04:53:15,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:15,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:15,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-10-27 04:53:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:53:15,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:53:15,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-10-27 04:53:15,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 04:53:15,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 04:53:15,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-10-27 04:53:15,451 INFO L87 Difference]: Start difference. First operand 361 states and 402 transitions. Second operand 16 states. [2018-10-27 04:53:17,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:53:17,090 INFO L93 Difference]: Finished difference Result 359 states and 400 transitions. [2018-10-27 04:53:17,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:53:17,091 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2018-10-27 04:53:17,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:53:17,092 INFO L225 Difference]: With dead ends: 359 [2018-10-27 04:53:17,092 INFO L226 Difference]: Without dead ends: 359 [2018-10-27 04:53:17,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:53:17,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-27 04:53:17,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-10-27 04:53:17,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-27 04:53:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 400 transitions. [2018-10-27 04:53:17,097 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 400 transitions. Word has length 79 [2018-10-27 04:53:17,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:53:17,097 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 400 transitions. [2018-10-27 04:53:17,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 04:53:17,097 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 400 transitions. [2018-10-27 04:53:17,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-27 04:53:17,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:53:17,098 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:53:17,098 INFO L424 AbstractCegarLoop]: === Iteration 40 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:53:17,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:53:17,098 INFO L82 PathProgramCache]: Analyzing trace with hash -386874855, now seen corresponding path program 1 times [2018-10-27 04:53:17,099 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:53:17,099 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:53:17,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:53:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:53:17,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:53:17,321 INFO L477 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-10-27 04:53:17,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:17,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:17,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-10-27 04:53:17,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:53:17,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:53:17,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:17,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:17,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:17,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:30 [2018-10-27 04:53:17,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-10-27 04:53:17,404 INFO L477 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 26 treesize of output 18 [2018-10-27 04:53:17,405 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:53:17,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:53:17,413 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-10-27 04:53:17,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:18 [2018-10-27 04:53:17,416 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| c_create_data_~data~0.base (_ bv1 1)))) (and (= |c_#valid| (store .cse0 v_arrayElimCell_151 (_ bv1 1))) (= (_ bv0 1) (select .cse0 v_arrayElimCell_151))))) is different from true [2018-10-27 04:53:17,424 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_151 (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| c_create_data_~data~0.base (_ bv1 1)))) (let ((.cse0 (store .cse1 v_arrayElimCell_151 (_ bv1 1)))) (and (= |c_#valid| (store .cse0 |c_create_data_#t~malloc20.base| (_ bv1 1))) (= (select .cse0 |c_create_data_#t~malloc20.base|) (_ bv0 1)) (= (_ bv0 1) (select .cse1 v_arrayElimCell_151)))))) is different from true [2018-10-27 04:53:17,531 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:17,533 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:17,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-10-27 04:53:17,568 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:17,569 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:17,570 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:17,571 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:17,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 57 [2018-10-27 04:53:17,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2018-10-27 04:53:17,578 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:17,592 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:17,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:17,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:53:17,622 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:44, output treesize:44 [2018-10-27 04:53:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 14 not checked. [2018-10-27 04:53:17,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:53:17,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:53:17,912 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:53:17,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:53:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:53:17,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:53:17,997 INFO L477 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-10-27 04:53:17,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:18,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:18,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:53:18,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 04:53:18,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:18,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:18,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-27 04:53:18,108 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2018-10-27 04:53:18,111 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc6.base| (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)))) (and (= (store .cse0 |create_data_#t~malloc6.base| (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse0 |create_data_#t~malloc6.base|) (_ bv0 1))))) is different from true [2018-10-27 04:53:18,123 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc6.base| (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse0 |create_data_#t~malloc6.base|) (_ bv0 1)) (= |c_#valid| (store (store .cse0 |create_data_#t~malloc6.base| (_ bv1 1)) |c_create_data_#t~malloc20.base| (_ bv1 1)))))) is different from true [2018-10-27 04:53:18,126 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc6.base| (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)))) (and (= |c_#valid| (store (store .cse0 |create_data_#t~malloc6.base| (_ bv1 1)) c_create_data_~nextData~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse0 |create_data_#t~malloc6.base|) (_ bv0 1))))) is different from true [2018-10-27 04:53:18,189 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:18,191 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:18,191 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:18,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-10-27 04:53:18,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 42 [2018-10-27 04:53:18,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-10-27 04:53:18,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:18,212 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:18,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:18,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 04:53:18,247 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:33 [2018-10-27 04:53:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 2 not checked. [2018-10-27 04:53:18,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:53:18,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:53:18,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2018-10-27 04:53:18,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 04:53:18,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 04:53:18,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=218, Unknown=28, NotChecked=210, Total=506 [2018-10-27 04:53:18,458 INFO L87 Difference]: Start difference. First operand 359 states and 400 transitions. Second operand 22 states. [2018-10-27 04:53:23,559 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|create_data_#t~malloc6.base| (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)))) (and (= |c_#valid| (store (store .cse0 |create_data_#t~malloc6.base| (_ bv1 1)) create_data_~nextData~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse0 |create_data_#t~malloc6.base|) (_ bv0 1)) (= (_ bv1 1) (select |c_#valid| create_data_~nextData~0.base))))) (exists ((|create_data_#t~malloc6.base| (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)))) (and (= |c_#valid| (store (store .cse1 |create_data_#t~malloc6.base| (_ bv1 1)) c_create_data_~nextData~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse1 |create_data_#t~malloc6.base|) (_ bv0 1))))) (exists ((v_arrayElimCell_151 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32))) (let ((.cse3 (store |c_old(#valid)| c_create_data_~data~0.base (_ bv1 1)))) (let ((.cse2 (store .cse3 v_arrayElimCell_151 (_ bv1 1)))) (and (= |c_#valid| (store .cse2 create_data_~nextData~0.base (_ bv1 1))) (= (select .cse2 create_data_~nextData~0.base) (_ bv0 1)) (= (_ bv0 1) (select .cse3 v_arrayElimCell_151))))))) is different from true [2018-10-27 04:53:27,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:53:27,642 INFO L93 Difference]: Finished difference Result 418 states and 463 transitions. [2018-10-27 04:53:27,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 04:53:27,644 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 79 [2018-10-27 04:53:27,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:53:27,645 INFO L225 Difference]: With dead ends: 418 [2018-10-27 04:53:27,645 INFO L226 Difference]: Without dead ends: 418 [2018-10-27 04:53:27,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 142 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=112, Invalid=608, Unknown=64, NotChecked=406, Total=1190 [2018-10-27 04:53:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-10-27 04:53:27,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 362. [2018-10-27 04:53:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-10-27 04:53:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 403 transitions. [2018-10-27 04:53:27,654 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 403 transitions. Word has length 79 [2018-10-27 04:53:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:53:27,654 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 403 transitions. [2018-10-27 04:53:27,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-27 04:53:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 403 transitions. [2018-10-27 04:53:27,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-27 04:53:27,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:53:27,655 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:53:27,655 INFO L424 AbstractCegarLoop]: === Iteration 41 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:53:27,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:53:27,655 INFO L82 PathProgramCache]: Analyzing trace with hash -386874854, now seen corresponding path program 1 times [2018-10-27 04:53:27,656 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:53:27,656 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:53:27,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:53:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:53:27,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:53:27,925 INFO L477 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-10-27 04:53:27,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:27,963 INFO L477 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-10-27 04:53:27,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:27,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:27,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:53:27,994 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:27,995 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:27,995 INFO L477 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-10-27 04:53:27,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:28,006 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,006 INFO L477 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-10-27 04:53:28,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:28,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:28,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2018-10-27 04:53:28,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-27 04:53:28,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 04:53:28,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:28,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:28,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:28,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:50 [2018-10-27 04:53:28,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-10-27 04:53:28,239 INFO L477 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 39 treesize of output 27 [2018-10-27 04:53:28,240 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:53:28,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:53:28,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:53:28,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:32 [2018-10-27 04:53:28,258 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_154 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)))) (and (= (store .cse0 v_arrayElimCell_154 (_ bv1 1)) |c_#valid|) (= (_ bv0 1) (select .cse0 v_arrayElimCell_154)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base (_ bv16 32)) v_arrayElimCell_154 (_ bv80 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base))))) is different from true [2018-10-27 04:53:28,305 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_154 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 v_arrayElimCell_154)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base (_ bv16 32)) v_arrayElimCell_154 (_ bv80 32)) |c_create_data_#t~malloc20.base| (_ bv16 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= (_ bv0 1) (select (store .cse0 v_arrayElimCell_154 (_ bv1 1)) |c_create_data_#t~malloc20.base|))))) is different from true [2018-10-27 04:53:28,337 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_154 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 v_arrayElimCell_154)) (= (store (store (store |c_old(#length)| create_data_~data~0.base (_ bv16 32)) v_arrayElimCell_154 (_ bv80 32)) create_data_~nextData~0.base (_ bv16 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= (_ bv0 1) (select (store .cse0 v_arrayElimCell_154 (_ bv1 1)) create_data_~nextData~0.base))))) is different from true [2018-10-27 04:53:28,551 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-27 04:53:28,558 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,562 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,567 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-10-27 04:53:28,604 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,607 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,611 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,615 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2018-10-27 04:53:28,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:28,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:28,686 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,690 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,692 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 51 [2018-10-27 04:53:28,710 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,713 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,714 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,715 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,717 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 83 [2018-10-27 04:53:28,732 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,734 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 104 [2018-10-27 04:53:28,745 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 04:53:28,872 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,873 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,874 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 74 [2018-10-27 04:53:28,875 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:28,922 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 04:53:28,992 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,993 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,994 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:28,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 59 [2018-10-27 04:53:28,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 67 [2018-10-27 04:53:29,000 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:29,026 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:29,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:53:29,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-10-27 04:53:29,139 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:59, output treesize:66 [2018-10-27 04:53:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 14 not checked. [2018-10-27 04:53:29,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:53:29,770 WARN L179 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2018-10-27 04:53:29,921 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-27 04:53:30,169 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-27 04:53:30,361 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 04:53:33,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:53:33,175 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:53:33,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:53:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:53:33,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:53:33,254 INFO L477 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-10-27 04:53:33,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:33,262 INFO L477 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-10-27 04:53:33,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:33,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:33,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:53:33,279 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:33,281 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:33,282 INFO L477 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 17 treesize of output 21 [2018-10-27 04:53:33,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:33,322 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:33,323 INFO L477 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-10-27 04:53:33,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:33,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:33,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2018-10-27 04:53:33,524 WARN L854 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1))) (= |c_#length| (store |c_old(#length)| create_data_~data~0.base (_ bv16 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2018-10-27 04:53:33,527 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc6.base| (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc6.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base (_ bv16 32)) |create_data_#t~malloc6.base| (_ bv80 32))))) is different from true [2018-10-27 04:53:33,540 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc6.base| (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base (_ bv16 32)) |create_data_#t~malloc6.base| (_ bv80 32)) |c_create_data_#t~malloc20.base| (_ bv16 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc6.base|) (_ bv0 1)))) is different from true [2018-10-27 04:53:33,544 WARN L854 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc6.base| (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base (_ bv16 32)) |create_data_#t~malloc6.base| (_ bv80 32)) c_create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc6.base|) (_ bv0 1)))) is different from true [2018-10-27 04:53:33,970 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:33,975 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:33,980 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:33,980 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 04:53:33,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-10-27 04:53:33,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:34,118 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:34,120 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:34,122 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:34,123 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:34,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 61 [2018-10-27 04:53:34,132 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:34,133 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:34,138 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:34,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 93 [2018-10-27 04:53:34,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 62 [2018-10-27 04:53:34,180 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-10-27 04:53:34,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:53:34,406 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 04:53:34,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 17 dim-0 vars, and 4 xjuncts. [2018-10-27 04:53:34,518 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:69, output treesize:210 [2018-10-27 04:53:34,940 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-10-27 04:53:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 2 not checked. [2018-10-27 04:53:34,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:53:41,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:53:41,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2018-10-27 04:53:41,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-27 04:53:41,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-27 04:53:41,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=418, Unknown=21, NotChecked=336, Total=870 [2018-10-27 04:53:41,609 INFO L87 Difference]: Start difference. First operand 362 states and 403 transitions. Second operand 27 states. [2018-10-27 04:53:47,072 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 78 [2018-10-27 04:53:49,721 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-27 04:53:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:53:55,667 INFO L93 Difference]: Finished difference Result 444 states and 505 transitions. [2018-10-27 04:53:55,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 04:53:55,671 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 79 [2018-10-27 04:53:55,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:53:55,672 INFO L225 Difference]: With dead ends: 444 [2018-10-27 04:53:55,672 INFO L226 Difference]: Without dead ends: 444 [2018-10-27 04:53:55,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 133 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=188, Invalid=1149, Unknown=23, NotChecked=532, Total=1892 [2018-10-27 04:53:55,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-10-27 04:53:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 415. [2018-10-27 04:53:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-10-27 04:53:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 477 transitions. [2018-10-27 04:53:55,681 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 477 transitions. Word has length 79 [2018-10-27 04:53:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:53:55,681 INFO L481 AbstractCegarLoop]: Abstraction has 415 states and 477 transitions. [2018-10-27 04:53:55,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-27 04:53:55,681 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 477 transitions. [2018-10-27 04:53:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-27 04:53:55,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:53:55,682 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:53:55,682 INFO L424 AbstractCegarLoop]: === Iteration 42 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:53:55,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:53:55,682 INFO L82 PathProgramCache]: Analyzing trace with hash -372450083, now seen corresponding path program 1 times [2018-10-27 04:53:55,683 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:53:55,683 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 48 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:53:55,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:53:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:53:55,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:53:56,051 INFO L477 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-10-27 04:53:56,053 INFO L477 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-10-27 04:53:56,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:56,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:56,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:56,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-10-27 04:53:56,084 INFO L477 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-10-27 04:53:56,085 INFO L477 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-10-27 04:53:56,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:56,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:56,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:56,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-10-27 04:53:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:53:56,101 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:53:56,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:53:56,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 04:53:56,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:53:56,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:53:56,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:53:56,104 INFO L87 Difference]: Start difference. First operand 415 states and 477 transitions. Second operand 9 states. [2018-10-27 04:53:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:53:56,486 INFO L93 Difference]: Finished difference Result 433 states and 493 transitions. [2018-10-27 04:53:56,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:53:56,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-10-27 04:53:56,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:53:56,489 INFO L225 Difference]: With dead ends: 433 [2018-10-27 04:53:56,489 INFO L226 Difference]: Without dead ends: 433 [2018-10-27 04:53:56,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:53:56,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-27 04:53:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 415. [2018-10-27 04:53:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-10-27 04:53:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 475 transitions. [2018-10-27 04:53:56,496 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 475 transitions. Word has length 80 [2018-10-27 04:53:56,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:53:56,496 INFO L481 AbstractCegarLoop]: Abstraction has 415 states and 475 transitions. [2018-10-27 04:53:56,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:53:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 475 transitions. [2018-10-27 04:53:56,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-27 04:53:56,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:53:56,497 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:53:56,497 INFO L424 AbstractCegarLoop]: === Iteration 43 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:53:56,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:53:56,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1367642244, now seen corresponding path program 1 times [2018-10-27 04:53:56,498 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:53:56,498 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 49 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:53:56,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:53:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:53:56,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:53:56,663 INFO L477 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-10-27 04:53:56,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:56,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:56,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-10-27 04:53:56,691 INFO L477 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-10-27 04:53:56,693 INFO L477 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-10-27 04:53:56,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:56,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:56,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:56,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-10-27 04:53:56,725 INFO L477 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-10-27 04:53:56,727 INFO L477 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-10-27 04:53:56,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:56,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:56,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:56,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-10-27 04:53:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:53:56,744 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:53:56,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:53:56,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 04:53:56,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 04:53:56,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 04:53:56,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-27 04:53:56,747 INFO L87 Difference]: Start difference. First operand 415 states and 475 transitions. Second operand 8 states. [2018-10-27 04:53:57,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:53:57,266 INFO L93 Difference]: Finished difference Result 421 states and 481 transitions. [2018-10-27 04:53:57,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:53:57,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-10-27 04:53:57,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:53:57,269 INFO L225 Difference]: With dead ends: 421 [2018-10-27 04:53:57,269 INFO L226 Difference]: Without dead ends: 421 [2018-10-27 04:53:57,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-10-27 04:53:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-10-27 04:53:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 418. [2018-10-27 04:53:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-10-27 04:53:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 479 transitions. [2018-10-27 04:53:57,277 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 479 transitions. Word has length 81 [2018-10-27 04:53:57,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:53:57,277 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 479 transitions. [2018-10-27 04:53:57,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 04:53:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 479 transitions. [2018-10-27 04:53:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-27 04:53:57,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:53:57,278 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:53:57,278 INFO L424 AbstractCegarLoop]: === Iteration 44 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:53:57,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:53:57,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1367642245, now seen corresponding path program 1 times [2018-10-27 04:53:57,279 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:53:57,279 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:53:57,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:53:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:53:57,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:53:57,650 INFO L477 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-10-27 04:53:57,653 INFO L477 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-10-27 04:53:57,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:57,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:57,666 INFO L477 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-10-27 04:53:57,669 INFO L477 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-10-27 04:53:57,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:57,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:57,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:57,678 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2018-10-27 04:53:57,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-10-27 04:53:57,854 INFO L477 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 15 [2018-10-27 04:53:57,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:57,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:57,874 INFO L477 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-10-27 04:53:57,876 INFO L477 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-10-27 04:53:57,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:57,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:57,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:57,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-10-27 04:53:57,922 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:53:57,922 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:53:57,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:53:57,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-27 04:53:57,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 04:53:57,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 04:53:57,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-27 04:53:57,925 INFO L87 Difference]: Start difference. First operand 418 states and 479 transitions. Second operand 13 states. [2018-10-27 04:53:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:53:58,729 INFO L93 Difference]: Finished difference Result 431 states and 491 transitions. [2018-10-27 04:53:58,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 04:53:58,731 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2018-10-27 04:53:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:53:58,732 INFO L225 Difference]: With dead ends: 431 [2018-10-27 04:53:58,732 INFO L226 Difference]: Without dead ends: 431 [2018-10-27 04:53:58,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:53:58,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-10-27 04:53:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 418. [2018-10-27 04:53:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-10-27 04:53:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 478 transitions. [2018-10-27 04:53:58,738 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 478 transitions. Word has length 81 [2018-10-27 04:53:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:53:58,739 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 478 transitions. [2018-10-27 04:53:58,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 04:53:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 478 transitions. [2018-10-27 04:53:58,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-27 04:53:58,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:53:58,740 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:53:58,741 INFO L424 AbstractCegarLoop]: === Iteration 45 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:53:58,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:53:58,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1370577801, now seen corresponding path program 1 times [2018-10-27 04:53:58,741 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:53:58,741 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 51 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:53:58,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:53:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:53:59,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:53:59,021 INFO L477 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-10-27 04:53:59,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:59,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:59,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:53:59,139 INFO L477 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-10-27 04:53:59,141 INFO L477 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-10-27 04:53:59,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:59,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:59,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:59,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-10-27 04:53:59,195 INFO L477 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-10-27 04:53:59,198 INFO L477 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-10-27 04:53:59,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:59,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:59,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 32 [2018-10-27 04:53:59,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-10-27 04:53:59,249 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:59,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 34 [2018-10-27 04:53:59,306 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 04:53:59,328 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:53:59,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:53:59,348 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:36, output treesize:47 [2018-10-27 04:53:59,384 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:53:59,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:59,395 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:59,396 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:53:59,397 INFO L477 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-10-27 04:53:59,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:59,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:59,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:28 [2018-10-27 04:53:59,430 INFO L477 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 20 [2018-10-27 04:53:59,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-10-27 04:53:59,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:53:59,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:59,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:53:59,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:31 [2018-10-27 04:53:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:53:59,581 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:53:59,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:53:59,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-10-27 04:53:59,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 04:53:59,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 04:53:59,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:53:59,584 INFO L87 Difference]: Start difference. First operand 418 states and 478 transitions. Second operand 17 states. [2018-10-27 04:54:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:54:01,718 INFO L93 Difference]: Finished difference Result 457 states and 519 transitions. [2018-10-27 04:54:01,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 04:54:01,719 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-10-27 04:54:01,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:54:01,721 INFO L225 Difference]: With dead ends: 457 [2018-10-27 04:54:01,721 INFO L226 Difference]: Without dead ends: 457 [2018-10-27 04:54:01,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2018-10-27 04:54:01,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-10-27 04:54:01,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 418. [2018-10-27 04:54:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-10-27 04:54:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 477 transitions. [2018-10-27 04:54:01,728 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 477 transitions. Word has length 84 [2018-10-27 04:54:01,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:54:01,728 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 477 transitions. [2018-10-27 04:54:01,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 04:54:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 477 transitions. [2018-10-27 04:54:01,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-27 04:54:01,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:54:01,733 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:54:01,733 INFO L424 AbstractCegarLoop]: === Iteration 46 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:54:01,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:54:01,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1737003697, now seen corresponding path program 1 times [2018-10-27 04:54:01,734 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:54:01,734 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:54:01,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:54:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:54:01,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:54:01,997 INFO L477 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-10-27 04:54:01,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:02,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:02,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-10-27 04:54:02,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-27 04:54:02,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-10-27 04:54:02,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:02,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:02,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 04:54:02,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2018-10-27 04:54:02,112 INFO L477 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2018-10-27 04:54:02,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-10-27 04:54:02,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:02,146 INFO L477 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-10-27 04:54:02,146 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:02,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:02,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:02,153 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:27, output treesize:7 [2018-10-27 04:54:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:54:02,190 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:54:02,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:54:02,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 04:54:02,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:54:02,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:54:02,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-27 04:54:02,193 INFO L87 Difference]: Start difference. First operand 418 states and 477 transitions. Second operand 9 states. [2018-10-27 04:54:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:54:03,056 INFO L93 Difference]: Finished difference Result 453 states and 525 transitions. [2018-10-27 04:54:03,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 04:54:03,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-10-27 04:54:03,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:54:03,059 INFO L225 Difference]: With dead ends: 453 [2018-10-27 04:54:03,059 INFO L226 Difference]: Without dead ends: 453 [2018-10-27 04:54:03,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:54:03,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-10-27 04:54:03,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 442. [2018-10-27 04:54:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-10-27 04:54:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 508 transitions. [2018-10-27 04:54:03,071 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 508 transitions. Word has length 88 [2018-10-27 04:54:03,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:54:03,071 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 508 transitions. [2018-10-27 04:54:03,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:54:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 508 transitions. [2018-10-27 04:54:03,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-27 04:54:03,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:54:03,072 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:54:03,072 INFO L424 AbstractCegarLoop]: === Iteration 47 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:54:03,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:54:03,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1737003696, now seen corresponding path program 1 times [2018-10-27 04:54:03,080 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:54:03,080 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:54:03,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:54:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:54:03,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:54:03,389 INFO L477 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-10-27 04:54:03,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:03,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:03,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:54:03,455 INFO L477 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-10-27 04:54:03,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:03,463 INFO L477 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-10-27 04:54:03,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:03,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:03,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-27 04:54:03,518 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:03,519 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:03,520 INFO L477 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-10-27 04:54:03,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:03,532 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:03,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-10-27 04:54:03,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:03,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:03,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-10-27 04:54:03,702 INFO L477 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-10-27 04:54:03,706 INFO L477 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-10-27 04:54:03,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:03,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:03,744 INFO L477 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-10-27 04:54:03,747 INFO L477 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-10-27 04:54:03,748 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:03,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:03,775 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-10-27 04:54:03,775 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:37 [2018-10-27 04:54:03,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-10-27 04:54:03,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-10-27 04:54:03,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:04,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-10-27 04:54:04,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:04,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:04,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-10-27 04:54:04,207 INFO L477 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-10-27 04:54:04,207 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:04,264 INFO L477 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 2 case distinctions, treesize of input 17 treesize of output 22 [2018-10-27 04:54:04,265 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 04:54:04,296 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:54:04,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-10-27 04:54:04,350 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:53, output treesize:157 [2018-10-27 04:54:04,486 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:54:04,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:04,505 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:04,506 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:04,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-27 04:54:04,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:04,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:54:04,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:102, output treesize:51 [2018-10-27 04:54:04,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2018-10-27 04:54:04,895 INFO L477 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 3 [2018-10-27 04:54:04,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:04,909 INFO L477 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 29 treesize of output 25 [2018-10-27 04:54:04,909 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:54:04,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:54:04,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-10-27 04:54:04,941 INFO L477 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-10-27 04:54:04,941 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:04,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-10-27 04:54:04,949 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:04,952 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:04,958 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-10-27 04:54:04,959 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:78, output treesize:16 [2018-10-27 04:54:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:54:05,140 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:54:05,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:54:05,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-10-27 04:54:05,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 04:54:05,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 04:54:05,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2018-10-27 04:54:05,143 INFO L87 Difference]: Start difference. First operand 442 states and 508 transitions. Second operand 22 states. [2018-10-27 04:54:10,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:54:10,197 INFO L93 Difference]: Finished difference Result 495 states and 563 transitions. [2018-10-27 04:54:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 04:54:10,199 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2018-10-27 04:54:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:54:10,201 INFO L225 Difference]: With dead ends: 495 [2018-10-27 04:54:10,201 INFO L226 Difference]: Without dead ends: 495 [2018-10-27 04:54:10,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=151, Invalid=1331, Unknown=0, NotChecked=0, Total=1482 [2018-10-27 04:54:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-10-27 04:54:10,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 462. [2018-10-27 04:54:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-10-27 04:54:10,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 531 transitions. [2018-10-27 04:54:10,208 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 531 transitions. Word has length 88 [2018-10-27 04:54:10,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:54:10,208 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 531 transitions. [2018-10-27 04:54:10,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-27 04:54:10,208 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 531 transitions. [2018-10-27 04:54:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-27 04:54:10,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:54:10,209 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:54:10,209 INFO L424 AbstractCegarLoop]: === Iteration 48 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:54:10,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:54:10,210 INFO L82 PathProgramCache]: Analyzing trace with hash -768190630, now seen corresponding path program 1 times [2018-10-27 04:54:10,210 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:54:10,210 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 54 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:54:10,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:54:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:54:10,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:54:10,537 INFO L477 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-10-27 04:54:10,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:10,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:10,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:54:10,598 INFO L477 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-10-27 04:54:10,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:10,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:10,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-27 04:54:10,675 INFO L477 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-10-27 04:54:10,678 INFO L477 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-10-27 04:54:10,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:10,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:10,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:10,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:23 [2018-10-27 04:54:10,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-10-27 04:54:10,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-10-27 04:54:10,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:10,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-10-27 04:54:10,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:10,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:10,889 INFO L477 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-10-27 04:54:10,891 INFO L477 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-10-27 04:54:10,892 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:10,895 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:10,926 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 2 xjuncts. [2018-10-27 04:54:10,926 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:39, output treesize:57 [2018-10-27 04:54:10,979 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:54:10,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:10,991 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:10,992 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:10,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-27 04:54:10,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:11,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:11,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:31 [2018-10-27 04:54:11,044 INFO L477 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-10-27 04:54:11,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 04:54:11,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:11,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:11,058 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-10-27 04:54:11,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2018-10-27 04:54:11,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-10-27 04:54:11,101 INFO L477 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-10-27 04:54:11,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:11,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-10-27 04:54:11,107 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:11,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:11,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:11,110 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:33, output treesize:5 [2018-10-27 04:54:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:54:11,143 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:54:11,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:54:11,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-27 04:54:11,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 04:54:11,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 04:54:11,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:54:11,146 INFO L87 Difference]: Start difference. First operand 462 states and 531 transitions. Second operand 17 states. [2018-10-27 04:54:13,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:54:13,690 INFO L93 Difference]: Finished difference Result 530 states and 619 transitions. [2018-10-27 04:54:13,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 04:54:13,691 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-10-27 04:54:13,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:54:13,693 INFO L225 Difference]: With dead ends: 530 [2018-10-27 04:54:13,694 INFO L226 Difference]: Without dead ends: 530 [2018-10-27 04:54:13,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2018-10-27 04:54:13,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-10-27 04:54:13,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 498. [2018-10-27 04:54:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-10-27 04:54:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 587 transitions. [2018-10-27 04:54:13,702 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 587 transitions. Word has length 88 [2018-10-27 04:54:13,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:54:13,702 INFO L481 AbstractCegarLoop]: Abstraction has 498 states and 587 transitions. [2018-10-27 04:54:13,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 04:54:13,702 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 587 transitions. [2018-10-27 04:54:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-27 04:54:13,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:54:13,714 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 04:54:13,715 INFO L424 AbstractCegarLoop]: === Iteration 49 === [create_dataErr7REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr3REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION]=== [2018-10-27 04:54:13,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:54:13,715 INFO L82 PathProgramCache]: Analyzing trace with hash -768190629, now seen corresponding path program 1 times [2018-10-27 04:54:13,715 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 04:54:13,715 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0293f65a-a5ad-4f02-8144-f324403cffc3/bin-2019/uautomizer/cvc4nyu Starting monitored process 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 04:54:13,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:54:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:54:14,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:54:14,033 INFO L477 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-10-27 04:54:14,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:14,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:14,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:54:14,099 INFO L477 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-10-27 04:54:14,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:14,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:14,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:54:14,212 INFO L477 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-10-27 04:54:14,215 INFO L477 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-10-27 04:54:14,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:14,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:14,245 INFO L477 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-10-27 04:54:14,248 INFO L477 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-10-27 04:54:14,248 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:14,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:14,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:14,271 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2018-10-27 04:54:14,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-10-27 04:54:14,378 INFO L477 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 2 case distinctions, treesize of input 17 treesize of output 22 [2018-10-27 04:54:14,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 04:54:14,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 04:54:14,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:14,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 04:54:14,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-10-27 04:54:14,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-10-27 04:54:14,518 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:14,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-10-27 04:54:14,585 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:14,629 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 04:54:14,687 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 4 xjuncts. [2018-10-27 04:54:14,688 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:46, output treesize:133 [2018-10-27 04:54:15,605 WARN L179 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-10-27 04:54:15,618 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:54:15,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:15,805 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:15,833 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:54:15,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-27 04:54:15,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:15,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:15,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:44 [2018-10-27 04:54:15,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2018-10-27 04:54:15,958 INFO L477 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 3 [2018-10-27 04:54:15,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:15,970 INFO L477 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 29 treesize of output 25 [2018-10-27 04:54:15,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:54:15,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:54:15,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-10-27 04:54:15,995 INFO L477 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-10-27 04:54:15,996 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:16,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-10-27 04:54:16,003 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 04:54:16,005 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:16,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:54:16,010 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:71, output treesize:9 [2018-10-27 04:54:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 04:54:16,052 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 04:54:16,055 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.core.lib.util.MonitoredProcess.forceShutdown(MonitoredProcess.java:411) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.exit(Executor.java:135) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.exit(Scriptor.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-27 04:54:16,059 INFO L168 Benchmark]: Toolchain (without parser) took 211369.95 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.7 MB). Free memory was 947.9 MB in the beginning and 1.2 GB in the end (delta: -229.1 MB). Peak memory consumption was 98.6 MB. Max. memory is 11.5 GB. [2018-10-27 04:54:16,059 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:54:16,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 506.90 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 926.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 04:54:16,060 INFO L168 Benchmark]: Boogie Preprocessor took 167.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 926.4 MB in the beginning and 1.2 GB in the end (delta: -246.6 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2018-10-27 04:54:16,060 INFO L168 Benchmark]: RCFGBuilder took 1787.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 85.7 MB). Peak memory consumption was 85.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:54:16,060 INFO L168 Benchmark]: TraceAbstraction took 208903.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 147.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -89.7 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. [2018-10-27 04:54:16,074 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 506.90 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 926.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 167.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 926.4 MB in the beginning and 1.2 GB in the end (delta: -246.6 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1787.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 85.7 MB). Peak memory consumption was 85.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 208903.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 147.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -89.7 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.core.lib.util.MonitoredProcess.forceShutdown(MonitoredProcess.java:411) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...