./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9798c877-e6ec-42c7-a540-c91dcefabab5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9798c877-e6ec-42c7-a540-c91dcefabab5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9798c877-e6ec-42c7-a540-c91dcefabab5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9798c877-e6ec-42c7-a540-c91dcefabab5/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9798c877-e6ec-42c7-a540-c91dcefabab5/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9798c877-e6ec-42c7-a540-c91dcefabab5/bin/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 69e4d0785323ca2fbac076cafe34fff682fc43d2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:11,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:11,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:11,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:11,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:11,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:11,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:11,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:11,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:11,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:11,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:11,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:11,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:11,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:11,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:11,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:11,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:11,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:11,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:11,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:11,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:11,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:11,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:11,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:11,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:11,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:11,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:11,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:11,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:11,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:11,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:11,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:11,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:11,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:11,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:11,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:11,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:11,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:11,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:11,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:11,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:11,329 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9798c877-e6ec-42c7-a540-c91dcefabab5/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-10-22 08:59:11,339 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:11,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:11,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:11,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:11,340 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:11,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:11,341 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:11,341 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:11,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:11,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:11,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:11,342 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 08:59:11,342 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 08:59:11,342 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 08:59:11,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:59:11,342 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:11,343 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:11,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:11,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:11,343 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:59:11,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:59:11,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:59:11,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:11,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:59:11,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:11,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:59:11,344 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_9798c877-e6ec-42c7-a540-c91dcefabab5/bin/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 -> 69e4d0785323ca2fbac076cafe34fff682fc43d2 [2019-10-22 08:59:11,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:11,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:11,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:11,383 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:11,383 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:11,384 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9798c877-e6ec-42c7-a540-c91dcefabab5/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2019-10-22 08:59:11,430 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9798c877-e6ec-42c7-a540-c91dcefabab5/bin/uautomizer/data/46f6a71df/457ea35abd2740e98c3d608e0381710c/FLAGf9eb18bcb [2019-10-22 08:59:11,872 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:11,872 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9798c877-e6ec-42c7-a540-c91dcefabab5/sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2019-10-22 08:59:11,882 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9798c877-e6ec-42c7-a540-c91dcefabab5/bin/uautomizer/data/46f6a71df/457ea35abd2740e98c3d608e0381710c/FLAGf9eb18bcb [2019-10-22 08:59:11,893 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9798c877-e6ec-42c7-a540-c91dcefabab5/bin/uautomizer/data/46f6a71df/457ea35abd2740e98c3d608e0381710c [2019-10-22 08:59:11,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:11,896 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-10-22 08:59:11,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:11,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:11,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:11,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:11" (1/1) ... [2019-10-22 08:59:11,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e97f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:11, skipping insertion in model container [2019-10-22 08:59:11,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:11" (1/1) ... [2019-10-22 08:59:11,910 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:11,953 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:12,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:12,336 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:12,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:12,422 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:12,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:12 WrapperNode [2019-10-22 08:59:12,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:12,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:12,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:12,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:12,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:12" (1/1) ... [2019-10-22 08:59:12,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:12" (1/1) ... [2019-10-22 08:59:12,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:12" (1/1) ... [2019-10-22 08:59:12,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:12" (1/1) ... [2019-10-22 08:59:12,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:12" (1/1) ... [2019-10-22 08:59:12,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:12" (1/1) ... [2019-10-22 08:59:12,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:12" (1/1) ... [2019-10-22 08:59:12,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:12,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:12,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:12,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:12,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9798c877-e6ec-42c7-a540-c91dcefabab5/bin/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 [2019-10-22 08:59:12,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-22 08:59:12,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:12,521 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-22 08:59:12,521 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-22 08:59:12,522 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-10-22 08:59:12,522 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-10-22 08:59:12,522 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-10-22 08:59:12,522 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-10-22 08:59:12,522 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-10-22 08:59:12,522 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-22 08:59:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-22 08:59:12,522 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-22 08:59:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-22 08:59:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-22 08:59:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-22 08:59:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-22 08:59:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-22 08:59:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-22 08:59:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-22 08:59:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-22 08:59:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-22 08:59:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-22 08:59:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-22 08:59:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-22 08:59:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-22 08:59:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-22 08:59:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-22 08:59:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-22 08:59:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-22 08:59:12,525 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-10-22 08:59:12,525 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-10-22 08:59:12,525 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-10-22 08:59:12,525 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-22 08:59:12,525 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-22 08:59:12,525 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-22 08:59:12,525 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-22 08:59:12,526 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-22 08:59:12,526 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-22 08:59:12,526 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-22 08:59:12,526 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-22 08:59:12,526 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-22 08:59:12,526 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-22 08:59:12,527 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-22 08:59:12,527 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-22 08:59:12,527 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-22 08:59:12,527 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-22 08:59:12,527 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-22 08:59:12,527 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-22 08:59:12,527 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-22 08:59:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-22 08:59:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-22 08:59:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-22 08:59:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-22 08:59:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-22 08:59:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-22 08:59:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-22 08:59:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-22 08:59:12,529 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-22 08:59:12,529 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-22 08:59:12,529 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-22 08:59:12,529 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-22 08:59:12,529 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-22 08:59:12,529 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-22 08:59:12,529 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-22 08:59:12,530 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-22 08:59:12,530 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-22 08:59:12,530 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-22 08:59:12,530 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-22 08:59:12,530 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-22 08:59:12,530 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-22 08:59:12,531 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-22 08:59:12,531 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-22 08:59:12,531 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-22 08:59:12,531 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-22 08:59:12,531 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-22 08:59:12,531 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-22 08:59:12,531 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-22 08:59:12,531 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-22 08:59:12,531 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-22 08:59:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-22 08:59:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-22 08:59:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-22 08:59:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-22 08:59:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-22 08:59:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-22 08:59:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-22 08:59:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-22 08:59:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-22 08:59:12,533 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-22 08:59:12,533 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-22 08:59:12,533 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-22 08:59:12,533 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-22 08:59:12,533 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-22 08:59:12,533 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-22 08:59:12,533 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-22 08:59:12,533 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-22 08:59:12,534 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-22 08:59:12,534 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-22 08:59:12,534 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-22 08:59:12,534 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-22 08:59:12,534 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-22 08:59:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-22 08:59:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-22 08:59:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-22 08:59:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-22 08:59:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-22 08:59:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-22 08:59:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-22 08:59:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-22 08:59:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-22 08:59:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-22 08:59:12,536 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-22 08:59:12,536 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-22 08:59:12,536 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-22 08:59:12,536 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-22 08:59:12,536 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-22 08:59:12,536 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-22 08:59:12,536 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-22 08:59:12,536 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-10-22 08:59:12,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:59:12,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:59:12,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:59:12,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:12,537 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-10-22 08:59:12,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:12,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:12,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:12,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-22 08:59:12,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-22 08:59:12,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:12,999 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:12,999 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-22 08:59:13,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:13 BoogieIcfgContainer [2019-10-22 08:59:13,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:13,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:59:13,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:59:13,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:59:13,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:59:11" (1/3) ... [2019-10-22 08:59:13,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7b9596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:59:13, skipping insertion in model container [2019-10-22 08:59:13,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:12" (2/3) ... [2019-10-22 08:59:13,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7b9596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:59:13, skipping insertion in model container [2019-10-22 08:59:13,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:13" (3/3) ... [2019-10-22 08:59:13,007 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019_1-2.i [2019-10-22 08:59:13,016 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:59:13,023 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2019-10-22 08:59:13,033 INFO L249 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2019-10-22 08:59:13,051 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:59:13,051 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 08:59:13,052 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:59:13,052 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:13,052 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:13,052 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:59:13,052 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:13,052 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:59:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-10-22 08:59:13,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 08:59:13,084 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:13,085 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:13,089 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:13,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:13,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1034402705, now seen corresponding path program 1 times [2019-10-22 08:59:13,104 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:13,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250627628] [2019-10-22 08:59:13,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:13,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:13,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:13,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250627628] [2019-10-22 08:59:13,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:13,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:13,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24193760] [2019-10-22 08:59:13,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:59:13,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:13,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:59:13,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:59:13,408 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 6 states. [2019-10-22 08:59:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:13,752 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-10-22 08:59:13,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:59:13,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-10-22 08:59:13,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:13,764 INFO L225 Difference]: With dead ends: 74 [2019-10-22 08:59:13,765 INFO L226 Difference]: Without dead ends: 71 [2019-10-22 08:59:13,767 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:59:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-22 08:59:13,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-10-22 08:59:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-22 08:59:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-10-22 08:59:13,815 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 9 [2019-10-22 08:59:13,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:13,816 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-10-22 08:59:13,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:59:13,816 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-10-22 08:59:13,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 08:59:13,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:13,817 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:13,817 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:13,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:13,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1034402704, now seen corresponding path program 1 times [2019-10-22 08:59:13,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:13,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366403072] [2019-10-22 08:59:13,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:13,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:13,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:13,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366403072] [2019-10-22 08:59:13,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:13,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:13,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098942998] [2019-10-22 08:59:13,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:59:13,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:13,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:59:13,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:59:13,960 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 6 states. [2019-10-22 08:59:14,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:14,225 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-10-22 08:59:14,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:59:14,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-10-22 08:59:14,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:14,227 INFO L225 Difference]: With dead ends: 68 [2019-10-22 08:59:14,227 INFO L226 Difference]: Without dead ends: 68 [2019-10-22 08:59:14,228 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:59:14,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-22 08:59:14,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-22 08:59:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 08:59:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-10-22 08:59:14,236 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 9 [2019-10-22 08:59:14,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:14,237 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-10-22 08:59:14,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:59:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-10-22 08:59:14,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 08:59:14,239 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:14,240 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:14,240 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:14,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:14,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1923554319, now seen corresponding path program 1 times [2019-10-22 08:59:14,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:14,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502505602] [2019-10-22 08:59:14,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:14,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502505602] [2019-10-22 08:59:14,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:14,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:59:14,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830139755] [2019-10-22 08:59:14,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:59:14,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:14,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:59:14,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:59:14,400 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 7 states. [2019-10-22 08:59:14,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:14,649 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-10-22 08:59:14,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:59:14,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-10-22 08:59:14,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:14,651 INFO L225 Difference]: With dead ends: 65 [2019-10-22 08:59:14,651 INFO L226 Difference]: Without dead ends: 65 [2019-10-22 08:59:14,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:59:14,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-22 08:59:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-10-22 08:59:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-22 08:59:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-10-22 08:59:14,657 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 11 [2019-10-22 08:59:14,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:14,658 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-10-22 08:59:14,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:59:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-10-22 08:59:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 08:59:14,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:14,658 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:14,659 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:14,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:14,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1699764301, now seen corresponding path program 1 times [2019-10-22 08:59:14,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:14,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854653047] [2019-10-22 08:59:14,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:14,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854653047] [2019-10-22 08:59:14,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:14,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:14,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042076913] [2019-10-22 08:59:14,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:59:14,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:14,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:59:14,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:59:14,738 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 6 states. [2019-10-22 08:59:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:14,947 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-10-22 08:59:14,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:59:14,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-22 08:59:14,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:14,948 INFO L225 Difference]: With dead ends: 64 [2019-10-22 08:59:14,948 INFO L226 Difference]: Without dead ends: 64 [2019-10-22 08:59:14,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:59:14,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-22 08:59:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-10-22 08:59:14,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-22 08:59:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-10-22 08:59:14,958 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 13 [2019-10-22 08:59:14,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:14,959 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-10-22 08:59:14,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:59:14,959 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-10-22 08:59:14,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 08:59:14,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:14,960 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:14,960 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:14,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:14,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1699764300, now seen corresponding path program 1 times [2019-10-22 08:59:14,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:14,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557233516] [2019-10-22 08:59:14,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:14,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:15,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:15,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557233516] [2019-10-22 08:59:15,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:15,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:15,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946649954] [2019-10-22 08:59:15,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:59:15,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:15,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:59:15,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:59:15,069 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 6 states. [2019-10-22 08:59:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:15,257 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-10-22 08:59:15,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:59:15,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-22 08:59:15,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:15,259 INFO L225 Difference]: With dead ends: 63 [2019-10-22 08:59:15,259 INFO L226 Difference]: Without dead ends: 63 [2019-10-22 08:59:15,259 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:59:15,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-22 08:59:15,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-10-22 08:59:15,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-22 08:59:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-10-22 08:59:15,273 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 13 [2019-10-22 08:59:15,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:15,274 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-10-22 08:59:15,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:59:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-10-22 08:59:15,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 08:59:15,278 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:15,279 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:15,279 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:15,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:15,279 INFO L82 PathProgramCache]: Analyzing trace with hash -13867244, now seen corresponding path program 1 times [2019-10-22 08:59:15,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:15,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278020197] [2019-10-22 08:59:15,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:15,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:15,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:15,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278020197] [2019-10-22 08:59:15,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:15,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-22 08:59:15,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083329559] [2019-10-22 08:59:15,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 08:59:15,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:15,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:59:15,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:59:15,478 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 12 states. [2019-10-22 08:59:15,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:15,806 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-10-22 08:59:15,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:59:15,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-10-22 08:59:15,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:15,807 INFO L225 Difference]: With dead ends: 62 [2019-10-22 08:59:15,807 INFO L226 Difference]: Without dead ends: 62 [2019-10-22 08:59:15,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-10-22 08:59:15,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-22 08:59:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-10-22 08:59:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-22 08:59:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-10-22 08:59:15,811 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 16 [2019-10-22 08:59:15,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:15,812 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-10-22 08:59:15,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 08:59:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-10-22 08:59:15,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 08:59:15,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:15,812 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:15,813 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:15,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:15,813 INFO L82 PathProgramCache]: Analyzing trace with hash -13867243, now seen corresponding path program 1 times [2019-10-22 08:59:15,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:15,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222360247] [2019-10-22 08:59:15,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:15,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:15,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:15,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222360247] [2019-10-22 08:59:15,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:15,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-22 08:59:15,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309421402] [2019-10-22 08:59:15,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 08:59:15,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:15,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:59:15,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:59:15,980 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 12 states. [2019-10-22 08:59:16,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:16,361 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-10-22 08:59:16,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:59:16,369 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-10-22 08:59:16,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:16,370 INFO L225 Difference]: With dead ends: 61 [2019-10-22 08:59:16,370 INFO L226 Difference]: Without dead ends: 61 [2019-10-22 08:59:16,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-10-22 08:59:16,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-22 08:59:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-10-22 08:59:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 08:59:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-10-22 08:59:16,375 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 16 [2019-10-22 08:59:16,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:16,375 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-10-22 08:59:16,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 08:59:16,375 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-10-22 08:59:16,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 08:59:16,376 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:16,376 INFO L380 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] [2019-10-22 08:59:16,376 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:16,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:16,377 INFO L82 PathProgramCache]: Analyzing trace with hash -2043476268, now seen corresponding path program 1 times [2019-10-22 08:59:16,377 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:16,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971787816] [2019-10-22 08:59:16,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:16,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:16,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:16,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971787816] [2019-10-22 08:59:16,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:16,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:59:16,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741416097] [2019-10-22 08:59:16,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:59:16,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:16,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:59:16,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:59:16,469 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 5 states. [2019-10-22 08:59:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:16,599 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-10-22 08:59:16,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:16,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-10-22 08:59:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:16,600 INFO L225 Difference]: With dead ends: 57 [2019-10-22 08:59:16,600 INFO L226 Difference]: Without dead ends: 57 [2019-10-22 08:59:16,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:59:16,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-22 08:59:16,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-22 08:59:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-22 08:59:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-10-22 08:59:16,603 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 24 [2019-10-22 08:59:16,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:16,603 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-10-22 08:59:16,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:59:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-10-22 08:59:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 08:59:16,604 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:16,604 INFO L380 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] [2019-10-22 08:59:16,604 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:16,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:16,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2043476267, now seen corresponding path program 1 times [2019-10-22 08:59:16,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:16,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278406726] [2019-10-22 08:59:16,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:16,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:16,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:16,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278406726] [2019-10-22 08:59:16,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:16,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:59:16,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070579281] [2019-10-22 08:59:16,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:59:16,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:16,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:59:16,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:59:16,688 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 5 states. [2019-10-22 08:59:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:16,820 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-10-22 08:59:16,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:16,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-10-22 08:59:16,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:16,822 INFO L225 Difference]: With dead ends: 53 [2019-10-22 08:59:16,822 INFO L226 Difference]: Without dead ends: 53 [2019-10-22 08:59:16,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:59:16,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-22 08:59:16,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-10-22 08:59:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 08:59:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-10-22 08:59:16,826 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 24 [2019-10-22 08:59:16,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:16,826 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-10-22 08:59:16,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:59:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-10-22 08:59:16,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 08:59:16,827 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:16,827 INFO L380 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] [2019-10-22 08:59:16,828 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:16,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:16,828 INFO L82 PathProgramCache]: Analyzing trace with hash 640066169, now seen corresponding path program 1 times [2019-10-22 08:59:16,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:16,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612773843] [2019-10-22 08:59:16,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:16,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:16,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:17,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:17,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612773843] [2019-10-22 08:59:17,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:17,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-22 08:59:17,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718296538] [2019-10-22 08:59:17,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-22 08:59:17,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:17,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-22 08:59:17,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2019-10-22 08:59:17,299 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 20 states. [2019-10-22 08:59:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:18,192 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-10-22 08:59:18,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-22 08:59:18,192 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-10-22 08:59:18,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:18,192 INFO L225 Difference]: With dead ends: 51 [2019-10-22 08:59:18,192 INFO L226 Difference]: Without dead ends: 51 [2019-10-22 08:59:18,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2019-10-22 08:59:18,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-22 08:59:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-10-22 08:59:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-22 08:59:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-10-22 08:59:18,198 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 30 [2019-10-22 08:59:18,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:18,198 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-10-22 08:59:18,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-22 08:59:18,198 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-10-22 08:59:18,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 08:59:18,199 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:18,199 INFO L380 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] [2019-10-22 08:59:18,199 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:18,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:18,199 INFO L82 PathProgramCache]: Analyzing trace with hash 640066170, now seen corresponding path program 1 times [2019-10-22 08:59:18,200 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:18,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397103693] [2019-10-22 08:59:18,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:18,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:18,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:18,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397103693] [2019-10-22 08:59:18,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:18,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-22 08:59:18,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099256253] [2019-10-22 08:59:18,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-22 08:59:18,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:18,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-22 08:59:18,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-10-22 08:59:18,654 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 20 states. [2019-10-22 08:59:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:19,550 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-10-22 08:59:19,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-22 08:59:19,550 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-10-22 08:59:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:19,551 INFO L225 Difference]: With dead ends: 49 [2019-10-22 08:59:19,551 INFO L226 Difference]: Without dead ends: 49 [2019-10-22 08:59:19,552 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=1107, Unknown=0, NotChecked=0, Total=1260 [2019-10-22 08:59:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-22 08:59:19,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-10-22 08:59:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-22 08:59:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-10-22 08:59:19,554 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 30 [2019-10-22 08:59:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:19,555 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-10-22 08:59:19,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-22 08:59:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-10-22 08:59:19,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 08:59:19,555 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:19,556 INFO L380 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] [2019-10-22 08:59:19,556 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:19,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:19,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1632785210, now seen corresponding path program 1 times [2019-10-22 08:59:19,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:19,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855993067] [2019-10-22 08:59:19,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:19,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:19,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:20,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855993067] [2019-10-22 08:59:20,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:20,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-10-22 08:59:20,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149159140] [2019-10-22 08:59:20,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-22 08:59:20,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:20,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-22 08:59:20,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-10-22 08:59:20,015 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 21 states. [2019-10-22 08:59:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:20,758 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-10-22 08:59:20,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-22 08:59:20,759 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2019-10-22 08:59:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:20,759 INFO L225 Difference]: With dead ends: 48 [2019-10-22 08:59:20,759 INFO L226 Difference]: Without dead ends: 48 [2019-10-22 08:59:20,760 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2019-10-22 08:59:20,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-22 08:59:20,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-10-22 08:59:20,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-22 08:59:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-10-22 08:59:20,763 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 31 [2019-10-22 08:59:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:20,763 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-10-22 08:59:20,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-22 08:59:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-10-22 08:59:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 08:59:20,764 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:20,764 INFO L380 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] [2019-10-22 08:59:20,764 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:20,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:20,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1632785209, now seen corresponding path program 1 times [2019-10-22 08:59:20,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:20,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178854496] [2019-10-22 08:59:20,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:20,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:20,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:21,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178854496] [2019-10-22 08:59:21,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:21,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-22 08:59:21,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945306430] [2019-10-22 08:59:21,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-22 08:59:21,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:21,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-22 08:59:21,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-10-22 08:59:21,264 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 20 states. [2019-10-22 08:59:22,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:22,083 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-10-22 08:59:22,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-22 08:59:22,084 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-10-22 08:59:22,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:22,084 INFO L225 Difference]: With dead ends: 46 [2019-10-22 08:59:22,085 INFO L226 Difference]: Without dead ends: 46 [2019-10-22 08:59:22,085 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2019-10-22 08:59:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-22 08:59:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-22 08:59:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-22 08:59:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-10-22 08:59:22,088 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 31 [2019-10-22 08:59:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:22,088 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-10-22 08:59:22,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-22 08:59:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-10-22 08:59:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 08:59:22,089 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:22,089 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:22,090 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:22,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:22,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1799527105, now seen corresponding path program 1 times [2019-10-22 08:59:22,090 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:22,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195268014] [2019-10-22 08:59:22,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:22,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:22,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:22,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195268014] [2019-10-22 08:59:22,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:22,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-22 08:59:22,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060191615] [2019-10-22 08:59:22,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-22 08:59:22,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:22,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-22 08:59:22,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-22 08:59:22,453 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 19 states. [2019-10-22 08:59:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:22,994 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-10-22 08:59:22,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-22 08:59:22,995 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-10-22 08:59:22,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:22,996 INFO L225 Difference]: With dead ends: 45 [2019-10-22 08:59:22,996 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 08:59:22,996 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2019-10-22 08:59:22,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 08:59:22,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-22 08:59:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 08:59:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-10-22 08:59:22,999 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 34 [2019-10-22 08:59:22,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:22,999 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-10-22 08:59:22,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-22 08:59:22,999 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-10-22 08:59:22,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:59:23,000 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:23,000 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:23,000 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:23,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:23,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1525697290, now seen corresponding path program 1 times [2019-10-22 08:59:23,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:23,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693632974] [2019-10-22 08:59:23,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:23,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:23,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:23,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693632974] [2019-10-22 08:59:23,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:23,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-22 08:59:23,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711827796] [2019-10-22 08:59:23,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-22 08:59:23,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:23,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-22 08:59:23,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2019-10-22 08:59:23,977 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 26 states. [2019-10-22 08:59:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:25,617 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2019-10-22 08:59:25,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-22 08:59:25,617 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-10-22 08:59:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:25,618 INFO L225 Difference]: With dead ends: 47 [2019-10-22 08:59:25,618 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 08:59:25,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=175, Invalid=1805, Unknown=0, NotChecked=0, Total=1980 [2019-10-22 08:59:25,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 08:59:25,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-22 08:59:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 08:59:25,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 44 transitions. [2019-10-22 08:59:25,622 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 44 transitions. Word has length 36 [2019-10-22 08:59:25,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:25,622 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 44 transitions. [2019-10-22 08:59:25,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-22 08:59:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 44 transitions. [2019-10-22 08:59:25,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 08:59:25,623 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:25,623 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:25,623 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:25,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:25,623 INFO L82 PathProgramCache]: Analyzing trace with hash 69905962, now seen corresponding path program 1 times [2019-10-22 08:59:25,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:25,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912031722] [2019-10-22 08:59:25,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:25,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:25,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:25,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912031722] [2019-10-22 08:59:25,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:25,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-22 08:59:25,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119652801] [2019-10-22 08:59:25,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-22 08:59:25,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:25,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-22 08:59:25,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-22 08:59:25,957 INFO L87 Difference]: Start difference. First operand 45 states and 44 transitions. Second operand 19 states. [2019-10-22 08:59:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:26,468 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2019-10-22 08:59:26,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-22 08:59:26,468 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2019-10-22 08:59:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:26,469 INFO L225 Difference]: With dead ends: 44 [2019-10-22 08:59:26,469 INFO L226 Difference]: Without dead ends: 44 [2019-10-22 08:59:26,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2019-10-22 08:59:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-22 08:59:26,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-22 08:59:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-22 08:59:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2019-10-22 08:59:26,471 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 37 [2019-10-22 08:59:26,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:26,471 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2019-10-22 08:59:26,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-22 08:59:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2019-10-22 08:59:26,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-22 08:59:26,472 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:26,472 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:26,472 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:26,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:26,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2127882365, now seen corresponding path program 1 times [2019-10-22 08:59:26,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:26,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746190999] [2019-10-22 08:59:26,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:26,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:26,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:26,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746190999] [2019-10-22 08:59:26,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:26,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-22 08:59:26,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677942309] [2019-10-22 08:59:26,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-22 08:59:26,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:26,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-22 08:59:26,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2019-10-22 08:59:26,953 INFO L87 Difference]: Start difference. First operand 44 states and 43 transitions. Second operand 25 states. [2019-10-22 08:59:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:27,882 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2019-10-22 08:59:27,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-22 08:59:27,883 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 38 [2019-10-22 08:59:27,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:27,883 INFO L225 Difference]: With dead ends: 43 [2019-10-22 08:59:27,883 INFO L226 Difference]: Without dead ends: 43 [2019-10-22 08:59:27,884 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=1781, Unknown=0, NotChecked=0, Total=1980 [2019-10-22 08:59:27,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-22 08:59:27,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-22 08:59:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 08:59:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2019-10-22 08:59:27,886 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 38 [2019-10-22 08:59:27,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:27,886 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2019-10-22 08:59:27,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-22 08:59:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2019-10-22 08:59:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-22 08:59:27,887 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:27,887 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:27,887 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr9REQUIRES_VIOLATION]=== [2019-10-22 08:59:27,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:27,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1060203249, now seen corresponding path program 1 times [2019-10-22 08:59:27,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:27,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118469479] [2019-10-22 08:59:27,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:27,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:27,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:29,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118469479] [2019-10-22 08:59:29,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:29,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-10-22 08:59:29,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957279537] [2019-10-22 08:59:29,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-22 08:59:29,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:29,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-22 08:59:29,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-10-22 08:59:29,846 INFO L87 Difference]: Start difference. First operand 43 states and 42 transitions. Second operand 29 states. [2019-10-22 08:59:30,926 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-22 08:59:31,625 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-10-22 08:59:31,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:31,705 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2019-10-22 08:59:31,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-22 08:59:31,705 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 42 [2019-10-22 08:59:31,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:31,706 INFO L225 Difference]: With dead ends: 42 [2019-10-22 08:59:31,706 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:59:31,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=164, Invalid=1816, Unknown=0, NotChecked=0, Total=1980 [2019-10-22 08:59:31,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:59:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:59:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:59:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:59:31,707 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2019-10-22 08:59:31,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:31,707 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:31,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-22 08:59:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:31,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:59:31,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:59:31 BoogieIcfgContainer [2019-10-22 08:59:31,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:59:31,711 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:31,711 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:31,711 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:31,712 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:13" (3/4) ... [2019-10-22 08:59:31,715 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:59:31,722 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-10-22 08:59:31,722 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-10-22 08:59:31,722 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-10-22 08:59:31,723 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-10-22 08:59:31,723 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-10-22 08:59:31,723 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_data [2019-10-22 08:59:31,723 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-10-22 08:59:31,723 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-10-22 08:59:31,723 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_data [2019-10-22 08:59:31,728 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-10-22 08:59:31,728 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-10-22 08:59:31,728 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 08:59:31,768 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9798c877-e6ec-42c7-a540-c91dcefabab5/bin/uautomizer/witness.graphml [2019-10-22 08:59:31,768 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:31,769 INFO L168 Benchmark]: Toolchain (without parser) took 19873.29 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 441.5 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -219.5 MB). Peak memory consumption was 221.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:31,769 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:31,770 INFO L168 Benchmark]: CACSL2BoogieTranslator took 525.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.7 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -230.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:31,770 INFO L168 Benchmark]: Boogie Preprocessor took 48.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:31,770 INFO L168 Benchmark]: RCFGBuilder took 529.37 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: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:31,771 INFO L168 Benchmark]: TraceAbstraction took 18709.76 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 243.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -51.4 MB). Peak memory consumption was 192.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:31,771 INFO L168 Benchmark]: Witness Printer took 56.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:31,773 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 525.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.7 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -230.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 529.37 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: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18709.76 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 243.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -51.4 MB). Peak memory consumption was 192.4 MB. Max. memory is 11.5 GB. * Witness Printer took 56.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 529]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 525]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 525]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 530]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 95 locations, 35 error locations. Result: SAFE, OverallTime: 18.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 572 SDtfs, 731 SDslu, 2678 SDs, 0 SdLazy, 6185 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1489 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 444 NumberOfCodeBlocks, 444 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 426 ConstructedInterpolants, 0 QuantifiedInterpolants, 262030 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...