./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0019-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0019-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 4494187e77773a0836e533a199cc56d858d4efc9 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:07:12,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:07:12,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:07:12,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:07:12,627 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:07:12,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:07:12,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:07:12,644 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:07:12,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:07:12,649 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:07:12,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:07:12,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:07:12,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:07:12,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:07:12,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:07:12,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:07:12,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:07:12,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:07:12,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:07:12,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:07:12,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:07:12,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:07:12,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:07:12,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:07:12,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:07:12,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:07:12,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:07:12,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:07:12,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:07:12,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:07:12,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:07:12,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:07:12,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:07:12,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:07:12,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:07:12,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:07:12,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:07:12,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:07:12,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:07:12,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:07:12,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:07:12,690 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 20:07:12,705 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:07:12,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:07:12,708 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:07:12,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:07:12,710 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:07:12,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:07:12,710 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:07:12,711 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:07:12,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:07:12,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:07:12,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:07:12,713 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:07:12,713 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:07:12,713 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:07:12,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:07:12,714 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:07:12,714 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:07:12,715 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:07:12,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:07:12,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:07:12,716 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:07:12,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:07:12,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:07:12,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:07:12,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:07:12,718 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:07:12,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:07:12,719 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:07:12,719 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 4494187e77773a0836e533a199cc56d858d4efc9 [2019-11-28 20:07:13,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:07:13,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:07:13,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:07:13,035 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:07:13,035 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:07:13,036 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-1.i [2019-11-28 20:07:13,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3d1b9d34/efee3cddac2d4d459e830116d91e9ea0/FLAGfb982a9af [2019-11-28 20:07:13,650 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:07:13,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-1.i [2019-11-28 20:07:13,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3d1b9d34/efee3cddac2d4d459e830116d91e9ea0/FLAGfb982a9af [2019-11-28 20:07:13,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3d1b9d34/efee3cddac2d4d459e830116d91e9ea0 [2019-11-28 20:07:13,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:07:13,962 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:07:13,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:07:13,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:07:13,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:07:13,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:07:13" (1/1) ... [2019-11-28 20:07:13,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48e2acac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:13, skipping insertion in model container [2019-11-28 20:07:13,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:07:13" (1/1) ... [2019-11-28 20:07:13,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:07:14,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:07:14,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:07:14,472 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:07:14,519 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:07:14,577 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:07:14,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:14 WrapperNode [2019-11-28 20:07:14,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:07:14,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:07:14,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:07:14,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:07:14,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:14" (1/1) ... [2019-11-28 20:07:14,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:14" (1/1) ... [2019-11-28 20:07:14,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:14" (1/1) ... [2019-11-28 20:07:14,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:14" (1/1) ... [2019-11-28 20:07:14,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:14" (1/1) ... [2019-11-28 20:07:14,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:14" (1/1) ... [2019-11-28 20:07:14,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:14" (1/1) ... [2019-11-28 20:07:14,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:07:14,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:07:14,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:07:14,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:07:14,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:07:14,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:07:14,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:07:14,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 20:07:14,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 20:07:14,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 20:07:14,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 20:07:14,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 20:07:14,694 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-11-28 20:07:14,695 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-11-28 20:07:14,695 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:07:14,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 20:07:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 20:07:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 20:07:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 20:07:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 20:07:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 20:07:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 20:07:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 20:07:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 20:07:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 20:07:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 20:07:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 20:07:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 20:07:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 20:07:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 20:07:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 20:07:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 20:07:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 20:07:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 20:07:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 20:07:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 20:07:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 20:07:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 20:07:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 20:07:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 20:07:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 20:07:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 20:07:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 20:07:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 20:07:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 20:07:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 20:07:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 20:07:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 20:07:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 20:07:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 20:07:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 20:07:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 20:07:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 20:07:14,701 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 20:07:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 20:07:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 20:07:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 20:07:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 20:07:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 20:07:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 20:07:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 20:07:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 20:07:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 20:07:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 20:07:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 20:07:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 20:07:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 20:07:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 20:07:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 20:07:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 20:07:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 20:07:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 20:07:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:07:14,705 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 20:07:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:07:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 20:07:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 20:07:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 20:07:14,706 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 20:07:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 20:07:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 20:07:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 20:07:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 20:07:14,707 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 20:07:14,708 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 20:07:14,708 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 20:07:14,708 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 20:07:14,708 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 20:07:14,708 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 20:07:14,709 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 20:07:14,709 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 20:07:14,709 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 20:07:14,709 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 20:07:14,709 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 20:07:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 20:07:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 20:07:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 20:07:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 20:07:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 20:07:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 20:07:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 20:07:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 20:07:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 20:07:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 20:07:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 20:07:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 20:07:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 20:07:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 20:07:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 20:07:14,713 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 20:07:14,713 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 20:07:14,713 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 20:07:14,713 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 20:07:14,713 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 20:07:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 20:07:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 20:07:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 20:07:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 20:07:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 20:07:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 20:07:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 20:07:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 20:07:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 20:07:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-11-28 20:07:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:07:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 20:07:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-11-28 20:07:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:07:14,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 20:07:14,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:07:14,717 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:07:14,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:07:14,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:07:15,320 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:07:15,320 INFO L287 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-28 20:07:15,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:07:15 BoogieIcfgContainer [2019-11-28 20:07:15,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:07:15,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:07:15,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:07:15,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:07:15,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:07:13" (1/3) ... [2019-11-28 20:07:15,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6845e888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:07:15, skipping insertion in model container [2019-11-28 20:07:15,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:14" (2/3) ... [2019-11-28 20:07:15,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6845e888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:07:15, skipping insertion in model container [2019-11-28 20:07:15,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:07:15" (3/3) ... [2019-11-28 20:07:15,331 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019-1.i [2019-11-28 20:07:15,340 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:07:15,348 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-11-28 20:07:15,360 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-11-28 20:07:15,386 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:07:15,386 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:07:15,386 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:07:15,387 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:07:15,387 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:07:15,387 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:07:15,388 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:07:15,388 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:07:15,410 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-11-28 20:07:15,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 20:07:15,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:15,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:15,419 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:07:15,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:15,424 INFO L82 PathProgramCache]: Analyzing trace with hash 163875527, now seen corresponding path program 1 times [2019-11-28 20:07:15,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:15,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807762071] [2019-11-28 20:07:15,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:15,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:07:15,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807762071] [2019-11-28 20:07:15,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:15,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:07:15,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902811664] [2019-11-28 20:07:15,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:07:15,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:15,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:07:15,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:07:15,694 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 6 states. [2019-11-28 20:07:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:16,004 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-11-28 20:07:16,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:07:16,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-28 20:07:16,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:16,016 INFO L225 Difference]: With dead ends: 56 [2019-11-28 20:07:16,016 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 20:07:16,018 INFO L630 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-11-28 20:07:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 20:07:16,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-28 20:07:16,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 20:07:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-11-28 20:07:16,053 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 9 [2019-11-28 20:07:16,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:16,053 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-11-28 20:07:16,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:07:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-11-28 20:07:16,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 20:07:16,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:16,054 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:16,055 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:07:16,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:16,055 INFO L82 PathProgramCache]: Analyzing trace with hash 163875528, now seen corresponding path program 1 times [2019-11-28 20:07:16,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:16,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116167077] [2019-11-28 20:07:16,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:07:16,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116167077] [2019-11-28 20:07:16,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:16,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:07:16,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709599966] [2019-11-28 20:07:16,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:07:16,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:16,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:07:16,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:07:16,186 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 6 states. [2019-11-28 20:07:16,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:16,391 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-11-28 20:07:16,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:07:16,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-28 20:07:16,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:16,394 INFO L225 Difference]: With dead ends: 50 [2019-11-28 20:07:16,394 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 20:07:16,396 INFO L630 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-11-28 20:07:16,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 20:07:16,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-28 20:07:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 20:07:16,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-11-28 20:07:16,406 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 9 [2019-11-28 20:07:16,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:16,407 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-11-28 20:07:16,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:07:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-11-28 20:07:16,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:07:16,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:16,408 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:16,409 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:07:16,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:16,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1429408695, now seen corresponding path program 1 times [2019-11-28 20:07:16,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:16,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852385444] [2019-11-28 20:07:16,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:07:16,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852385444] [2019-11-28 20:07:16,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:16,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:07:16,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922870877] [2019-11-28 20:07:16,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:07:16,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:16,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:07:16,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:07:16,601 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 7 states. [2019-11-28 20:07:16,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:16,802 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-11-28 20:07:16,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:07:16,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-11-28 20:07:16,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:16,804 INFO L225 Difference]: With dead ends: 49 [2019-11-28 20:07:16,804 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 20:07:16,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:07:16,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 20:07:16,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-28 20:07:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 20:07:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-11-28 20:07:16,814 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 11 [2019-11-28 20:07:16,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:16,814 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-11-28 20:07:16,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:07:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-11-28 20:07:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 20:07:16,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:16,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:16,817 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:07:16,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:16,817 INFO L82 PathProgramCache]: Analyzing trace with hash -2056472042, now seen corresponding path program 1 times [2019-11-28 20:07:16,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:16,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948123165] [2019-11-28 20:07:16,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:16,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-11-28 20:07:16,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948123165] [2019-11-28 20:07:16,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:16,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:07:16,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554612058] [2019-11-28 20:07:16,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:07:16,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:16,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:07:16,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:07:16,954 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 5 states. [2019-11-28 20:07:17,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:17,089 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-11-28 20:07:17,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:07:17,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-28 20:07:17,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:17,092 INFO L225 Difference]: With dead ends: 45 [2019-11-28 20:07:17,092 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 20:07:17,093 INFO L630 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-11-28 20:07:17,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 20:07:17,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-28 20:07:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 20:07:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-11-28 20:07:17,099 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 18 [2019-11-28 20:07:17,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:17,100 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-11-28 20:07:17,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:07:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-11-28 20:07:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 20:07:17,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:17,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:17,101 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:07:17,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:17,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2056472043, now seen corresponding path program 1 times [2019-11-28 20:07:17,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:17,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513543970] [2019-11-28 20:07:17,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:07:17,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513543970] [2019-11-28 20:07:17,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:17,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:07:17,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94923815] [2019-11-28 20:07:17,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:07:17,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:17,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:07:17,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:07:17,189 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 5 states. [2019-11-28 20:07:17,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:17,308 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-11-28 20:07:17,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:07:17,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-28 20:07:17,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:17,310 INFO L225 Difference]: With dead ends: 41 [2019-11-28 20:07:17,310 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 20:07:17,310 INFO L630 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-11-28 20:07:17,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 20:07:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 20:07:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 20:07:17,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-11-28 20:07:17,316 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 18 [2019-11-28 20:07:17,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:17,317 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-11-28 20:07:17,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:07:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-11-28 20:07:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:07:17,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:17,318 INFO L410 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] [2019-11-28 20:07:17,319 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:07:17,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:17,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1835398156, now seen corresponding path program 1 times [2019-11-28 20:07:17,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:17,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017960233] [2019-11-28 20:07:17,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:17,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:07:17,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017960233] [2019-11-28 20:07:17,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:17,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 20:07:17,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144316408] [2019-11-28 20:07:17,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:07:17,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:17,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:07:17,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:07:17,574 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 13 states. [2019-11-28 20:07:17,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:17,997 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-11-28 20:07:17,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:07:17,997 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-11-28 20:07:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:17,998 INFO L225 Difference]: With dead ends: 40 [2019-11-28 20:07:17,998 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 20:07:17,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:07:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 20:07:18,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-28 20:07:18,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 20:07:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-11-28 20:07:18,004 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 25 [2019-11-28 20:07:18,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:18,004 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-11-28 20:07:18,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:07:18,004 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-11-28 20:07:18,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 20:07:18,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:18,005 INFO L410 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] [2019-11-28 20:07:18,006 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:07:18,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:18,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1062767907, now seen corresponding path program 1 times [2019-11-28 20:07:18,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:18,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743062442] [2019-11-28 20:07:18,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:07:18,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743062442] [2019-11-28 20:07:18,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:18,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 20:07:18,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167019276] [2019-11-28 20:07:18,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:07:18,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:18,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:07:18,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:07:18,270 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 13 states. [2019-11-28 20:07:18,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:18,645 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-11-28 20:07:18,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:07:18,646 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-11-28 20:07:18,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:18,647 INFO L225 Difference]: With dead ends: 39 [2019-11-28 20:07:18,647 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 20:07:18,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:07:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 20:07:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-28 20:07:18,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:07:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-11-28 20:07:18,653 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 26 [2019-11-28 20:07:18,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:18,653 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-11-28 20:07:18,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:07:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-11-28 20:07:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 20:07:18,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:18,655 INFO L410 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] [2019-11-28 20:07:18,656 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:07:18,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:18,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1413933334, now seen corresponding path program 1 times [2019-11-28 20:07:18,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:18,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318340152] [2019-11-28 20:07:18,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:07:18,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318340152] [2019-11-28 20:07:18,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:18,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-28 20:07:18,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850887379] [2019-11-28 20:07:18,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 20:07:18,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:18,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:07:18,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:07:18,912 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 14 states. [2019-11-28 20:07:19,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:19,261 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-11-28 20:07:19,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:07:19,262 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-11-28 20:07:19,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:19,263 INFO L225 Difference]: With dead ends: 38 [2019-11-28 20:07:19,263 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 20:07:19,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:07:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 20:07:19,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-28 20:07:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 20:07:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-11-28 20:07:19,268 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 27 [2019-11-28 20:07:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:19,269 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-11-28 20:07:19,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 20:07:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-11-28 20:07:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 20:07:19,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:19,270 INFO L410 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] [2019-11-28 20:07:19,271 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:07:19,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:19,271 INFO L82 PathProgramCache]: Analyzing trace with hash 881682728, now seen corresponding path program 1 times [2019-11-28 20:07:19,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:19,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904346597] [2019-11-28 20:07:19,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:07:19,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904346597] [2019-11-28 20:07:19,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:19,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-28 20:07:19,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56312665] [2019-11-28 20:07:19,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 20:07:19,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:19,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 20:07:19,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:07:19,632 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 19 states. [2019-11-28 20:07:20,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:20,203 INFO L93 Difference]: Finished difference Result 40 states and 39 transitions. [2019-11-28 20:07:20,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 20:07:20,203 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2019-11-28 20:07:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:20,204 INFO L225 Difference]: With dead ends: 40 [2019-11-28 20:07:20,204 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 20:07:20,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2019-11-28 20:07:20,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 20:07:20,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-28 20:07:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 20:07:20,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 37 transitions. [2019-11-28 20:07:20,209 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 37 transitions. Word has length 28 [2019-11-28 20:07:20,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:20,210 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 37 transitions. [2019-11-28 20:07:20,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 20:07:20,210 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 37 transitions. [2019-11-28 20:07:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 20:07:20,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:20,211 INFO L410 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] [2019-11-28 20:07:20,212 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:07:20,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:20,212 INFO L82 PathProgramCache]: Analyzing trace with hash 882260479, now seen corresponding path program 1 times [2019-11-28 20:07:20,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:20,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334132162] [2019-11-28 20:07:20,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:07:20,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334132162] [2019-11-28 20:07:20,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:20,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-28 20:07:20,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797923451] [2019-11-28 20:07:20,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 20:07:20,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:20,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:07:20,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:07:20,420 INFO L87 Difference]: Start difference. First operand 38 states and 37 transitions. Second operand 14 states. [2019-11-28 20:07:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:20,813 INFO L93 Difference]: Finished difference Result 37 states and 36 transitions. [2019-11-28 20:07:20,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 20:07:20,814 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-11-28 20:07:20,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:20,815 INFO L225 Difference]: With dead ends: 37 [2019-11-28 20:07:20,815 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 20:07:20,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-11-28 20:07:20,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 20:07:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-28 20:07:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 20:07:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 36 transitions. [2019-11-28 20:07:20,819 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 36 transitions. Word has length 28 [2019-11-28 20:07:20,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:20,820 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 36 transitions. [2019-11-28 20:07:20,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 20:07:20,820 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 36 transitions. [2019-11-28 20:07:20,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 20:07:20,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:20,821 INFO L410 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] [2019-11-28 20:07:20,822 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:07:20,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:20,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1580271160, now seen corresponding path program 1 times [2019-11-28 20:07:20,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:20,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337007220] [2019-11-28 20:07:20,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:21,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-11-28 20:07:21,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337007220] [2019-11-28 20:07:21,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:21,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-28 20:07:21,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941639986] [2019-11-28 20:07:21,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 20:07:21,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:21,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:07:21,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:07:21,015 INFO L87 Difference]: Start difference. First operand 37 states and 36 transitions. Second operand 14 states. [2019-11-28 20:07:21,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:21,427 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2019-11-28 20:07:21,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 20:07:21,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-11-28 20:07:21,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:21,429 INFO L225 Difference]: With dead ends: 36 [2019-11-28 20:07:21,430 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 20:07:21,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-11-28 20:07:21,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 20:07:21,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-28 20:07:21,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 20:07:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 35 transitions. [2019-11-28 20:07:21,438 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 35 transitions. Word has length 29 [2019-11-28 20:07:21,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:21,440 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 35 transitions. [2019-11-28 20:07:21,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 20:07:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 35 transitions. [2019-11-28 20:07:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 20:07:21,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:21,442 INFO L410 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-11-28 20:07:21,444 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:07:21,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:21,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1743765793, now seen corresponding path program 1 times [2019-11-28 20:07:21,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:21,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672275182] [2019-11-28 20:07:21,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:07:21,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672275182] [2019-11-28 20:07:21,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:21,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-28 20:07:21,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753023621] [2019-11-28 20:07:21,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 20:07:21,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:21,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 20:07:21,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-11-28 20:07:21,861 INFO L87 Difference]: Start difference. First operand 36 states and 35 transitions. Second operand 20 states. [2019-11-28 20:07:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:22,743 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2019-11-28 20:07:22,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 20:07:22,744 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-11-28 20:07:22,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:22,745 INFO L225 Difference]: With dead ends: 35 [2019-11-28 20:07:22,745 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 20:07:22,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2019-11-28 20:07:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 20:07:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-28 20:07:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 20:07:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 34 transitions. [2019-11-28 20:07:22,750 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 34 transitions. Word has length 30 [2019-11-28 20:07:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:22,750 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 34 transitions. [2019-11-28 20:07:22,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 20:07:22,751 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2019-11-28 20:07:22,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 20:07:22,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:22,752 INFO L410 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-11-28 20:07:22,752 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-28 20:07:22,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:22,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2049094415, now seen corresponding path program 1 times [2019-11-28 20:07:22,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:22,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160321008] [2019-11-28 20:07:22,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:24,372 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-11-28 20:07:24,591 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-11-28 20:07:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:07:25,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160321008] [2019-11-28 20:07:25,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:25,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-11-28 20:07:25,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487027202] [2019-11-28 20:07:25,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 20:07:25,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:25,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 20:07:25,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2019-11-28 20:07:25,113 INFO L87 Difference]: Start difference. First operand 35 states and 34 transitions. Second operand 27 states. [2019-11-28 20:07:25,919 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-11-28 20:07:26,639 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-11-28 20:07:26,793 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-11-28 20:07:27,000 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-11-28 20:07:27,190 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-11-28 20:07:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:27,319 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2019-11-28 20:07:27,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-28 20:07:27,319 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2019-11-28 20:07:27,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:27,320 INFO L225 Difference]: With dead ends: 34 [2019-11-28 20:07:27,320 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:07:27,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=165, Invalid=1475, Unknown=0, NotChecked=0, Total=1640 [2019-11-28 20:07:27,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:07:27,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:07:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:07:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:07:27,322 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2019-11-28 20:07:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:27,322 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:07:27,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 20:07:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:07:27,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:07:27,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:07:27 BoogieIcfgContainer [2019-11-28 20:07:27,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:07:27,330 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:07:27,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:07:27,330 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:07:27,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:07:15" (3/4) ... [2019-11-28 20:07:27,334 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:07:27,342 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 20:07:27,342 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-28 20:07:27,342 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-28 20:07:27,343 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-28 20:07:27,343 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-28 20:07:27,343 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_data [2019-11-28 20:07:27,343 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 20:07:27,343 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-28 20:07:27,343 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_data [2019-11-28 20:07:27,348 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-28 20:07:27,349 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-28 20:07:27,349 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 20:07:27,349 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 20:07:27,394 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:07:27,395 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:07:27,396 INFO L168 Benchmark]: Toolchain (without parser) took 13434.22 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.3 MB). Free memory was 961.7 MB in the beginning and 916.0 MB in the end (delta: 45.7 MB). Peak memory consumption was 365.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:27,397 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:07:27,398 INFO L168 Benchmark]: CACSL2BoogieTranslator took 616.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:27,398 INFO L168 Benchmark]: Boogie Preprocessor took 59.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:27,399 INFO L168 Benchmark]: RCFGBuilder took 681.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:27,400 INFO L168 Benchmark]: TraceAbstraction took 12005.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 927.1 MB in the end (delta: 144.7 MB). Peak memory consumption was 316.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:27,400 INFO L168 Benchmark]: Witness Printer took 65.16 ms. Allocated memory is still 1.3 GB. Free memory was 927.1 MB in the beginning and 916.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:27,404 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 616.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 681.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12005.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 927.1 MB in the end (delta: 144.7 MB). Peak memory consumption was 316.1 MB. Max. memory is 11.5 GB. * Witness Printer took 65.16 ms. Allocated memory is still 1.3 GB. Free memory was 927.1 MB in the beginning and 916.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 533]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 533]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 533]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 533]: 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: 519]: 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: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: 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: 521]: 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: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: free always succeeds For all program executions holds that free 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: 528]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 528]: free always succeeds For all program executions holds that free 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: 528]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 75 locations, 23 error locations. Result: SAFE, OverallTime: 11.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 306 SDtfs, 372 SDslu, 1308 SDs, 0 SdLazy, 3060 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred 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.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 86439 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...