./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/alternating_list-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3d056a1f 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/list-properties/alternating_list-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-64bit-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9c54128245d3ab9ad313da188c7be33f66027c6a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-3d056a1 [2019-11-22 13:59:57,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 13:59:57,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 13:59:57,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 13:59:57,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 13:59:57,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 13:59:57,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 13:59:57,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 13:59:57,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 13:59:57,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 13:59:57,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 13:59:57,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 13:59:57,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 13:59:57,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 13:59:57,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 13:59:57,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 13:59:57,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 13:59:57,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 13:59:57,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 13:59:57,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 13:59:57,817 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 13:59:57,818 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 13:59:57,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 13:59:57,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 13:59:57,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 13:59:57,823 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 13:59:57,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 13:59:57,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 13:59:57,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 13:59:57,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 13:59:57,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 13:59:57,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 13:59:57,828 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 13:59:57,829 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 13:59:57,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 13:59:57,830 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 13:59:57,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 13:59:57,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 13:59:57,832 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 13:59:57,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 13:59:57,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 13:59:57,835 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-64bit-Automizer_Default.epf [2019-11-22 13:59:57,850 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 13:59:57,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 13:59:57,851 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 13:59:57,852 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 13:59:57,852 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 13:59:57,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 13:59:57,853 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 13:59:57,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 13:59:57,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 13:59:57,853 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 13:59:57,854 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 13:59:57,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 13:59:57,854 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 13:59:57,854 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 13:59:57,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 13:59:57,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 13:59:57,855 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 13:59:57,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 13:59:57,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 13:59:57,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 13:59:57,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 13:59:57,857 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 13:59:57,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 13:59:57,857 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-memcleanup) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c54128245d3ab9ad313da188c7be33f66027c6a [2019-11-22 13:59:58,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 13:59:58,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 13:59:58,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 13:59:58,180 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 13:59:58,181 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 13:59:58,181 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-22 13:59:58,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4fc5d9c/fe80995e524b4bc8abdd51f180bf0cf7/FLAG8cd5affec [2019-11-22 13:59:58,758 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 13:59:58,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-22 13:59:58,775 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4fc5d9c/fe80995e524b4bc8abdd51f180bf0cf7/FLAG8cd5affec [2019-11-22 13:59:59,072 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4fc5d9c/fe80995e524b4bc8abdd51f180bf0cf7 [2019-11-22 13:59:59,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 13:59:59,077 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 13:59:59,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 13:59:59,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 13:59:59,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 13:59:59,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:59:59" (1/1) ... [2019-11-22 13:59:59,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a332e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:59, skipping insertion in model container [2019-11-22 13:59:59,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:59:59" (1/1) ... [2019-11-22 13:59:59,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 13:59:59,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 13:59:59,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:59:59,580 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 13:59:59,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:59:59,693 INFO L208 MainTranslator]: Completed translation [2019-11-22 13:59:59,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:59 WrapperNode [2019-11-22 13:59:59,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 13:59:59,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 13:59:59,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 13:59:59,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 13:59:59,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:59" (1/1) ... [2019-11-22 13:59:59,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:59" (1/1) ... [2019-11-22 13:59:59,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:59" (1/1) ... [2019-11-22 13:59:59,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:59" (1/1) ... [2019-11-22 13:59:59,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:59" (1/1) ... [2019-11-22 13:59:59,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:59" (1/1) ... [2019-11-22 13:59:59,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:59" (1/1) ... [2019-11-22 13:59:59,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 13:59:59,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 13:59:59,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 13:59:59,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 13:59:59,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:59" (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-22 13:59:59,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 13:59:59,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 13:59:59,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 13:59:59,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 13:59:59,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-22 13:59:59,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-22 13:59:59,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-22 13:59:59,831 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-22 13:59:59,831 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 13:59:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 13:59:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 13:59:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 13:59:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 13:59:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 13:59:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 13:59:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 13:59:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 13:59:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 13:59:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 13:59:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 13:59:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 13:59:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 13:59:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 13:59:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 13:59:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 13:59:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 13:59:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 13:59:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 13:59:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 13:59:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-22 13:59:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-22 13:59:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-22 13:59:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 13:59:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 13:59:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 13:59:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 13:59:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 13:59:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 13:59:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 13:59:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 13:59:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 13:59:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 13:59:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 13:59:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 13:59:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 13:59:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 13:59:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 13:59:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 13:59:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 13:59:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 13:59:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 13:59:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 13:59:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 13:59:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 13:59:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 13:59:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 13:59:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 13:59:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 13:59:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 13:59:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 13:59:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 13:59:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 13:59:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 13:59:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 13:59:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 13:59:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 13:59:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 13:59:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 13:59:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 13:59:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 13:59:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 13:59:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 13:59:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 13:59:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 13:59:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 13:59:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 13:59:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 13:59:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 13:59:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 13:59:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 13:59:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 13:59:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 13:59:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 13:59:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 13:59:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 13:59:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 13:59:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 13:59:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 13:59:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 13:59:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 13:59:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 13:59:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 13:59:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 13:59:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 13:59:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 13:59:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 13:59:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 13:59:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 13:59:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 13:59:59,844 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 13:59:59,845 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 13:59:59,845 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 13:59:59,845 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 13:59:59,845 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 13:59:59,845 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 13:59:59,845 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 13:59:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 13:59:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 13:59:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 13:59:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 13:59:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 13:59:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 13:59:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 13:59:59,846 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 13:59:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 13:59:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 13:59:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 13:59:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 13:59:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-22 13:59:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 13:59:59,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 13:59:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 13:59:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 13:59:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 13:59:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 13:59:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 13:59:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 13:59:59,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 14:00:00,194 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-22 14:00:00,422 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 14:00:00,422 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-22 14:00:00,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:00:00 BoogieIcfgContainer [2019-11-22 14:00:00,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 14:00:00,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 14:00:00,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 14:00:00,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 14:00:00,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:59:59" (1/3) ... [2019-11-22 14:00:00,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71295906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:00:00, skipping insertion in model container [2019-11-22 14:00:00,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:59" (2/3) ... [2019-11-22 14:00:00,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71295906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:00:00, skipping insertion in model container [2019-11-22 14:00:00,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:00:00" (3/3) ... [2019-11-22 14:00:00,433 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2019-11-22 14:00:00,442 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 14:00:00,449 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-22 14:00:00,459 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-22 14:00:00,477 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 14:00:00,477 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 14:00:00,477 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 14:00:00,477 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 14:00:00,478 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 14:00:00,478 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 14:00:00,478 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 14:00:00,479 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 14:00:00,497 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-22 14:00:00,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 14:00:00,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:00,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:00:00,507 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:00:00,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:00,513 INFO L82 PathProgramCache]: Analyzing trace with hash 63975510, now seen corresponding path program 1 times [2019-11-22 14:00:00,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:00,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180374791] [2019-11-22 14:00:00,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:00,692 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-22 14:00:00,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180374791] [2019-11-22 14:00:00,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:00:00,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 14:00:00,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914776814] [2019-11-22 14:00:00,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 14:00:00,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:00,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 14:00:00,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:00:00,717 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2019-11-22 14:00:00,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:00,923 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-11-22 14:00:00,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 14:00:00,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-22 14:00:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:00,934 INFO L225 Difference]: With dead ends: 80 [2019-11-22 14:00:00,934 INFO L226 Difference]: Without dead ends: 72 [2019-11-22 14:00:00,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:00:00,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-22 14:00:00,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-11-22 14:00:00,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-22 14:00:00,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-11-22 14:00:00,978 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 10 [2019-11-22 14:00:00,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:00,978 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-11-22 14:00:00,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 14:00:00,979 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-11-22 14:00:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 14:00:00,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:00,980 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:00:00,980 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:00:00,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:00,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1983205163, now seen corresponding path program 1 times [2019-11-22 14:00:00,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:00,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095911243] [2019-11-22 14:00:00,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:01,104 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-22 14:00:01,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095911243] [2019-11-22 14:00:01,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:00:01,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 14:00:01,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720283661] [2019-11-22 14:00:01,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 14:00:01,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:01,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 14:00:01,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 14:00:01,108 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 5 states. [2019-11-22 14:00:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:01,342 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-11-22 14:00:01,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 14:00:01,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-22 14:00:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:01,345 INFO L225 Difference]: With dead ends: 93 [2019-11-22 14:00:01,345 INFO L226 Difference]: Without dead ends: 93 [2019-11-22 14:00:01,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-22 14:00:01,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-22 14:00:01,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2019-11-22 14:00:01,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-22 14:00:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2019-11-22 14:00:01,357 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 11 [2019-11-22 14:00:01,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:01,357 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2019-11-22 14:00:01,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 14:00:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2019-11-22 14:00:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-22 14:00:01,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:01,359 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:00:01,359 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:00:01,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:01,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1983205164, now seen corresponding path program 1 times [2019-11-22 14:00:01,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:01,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107246269] [2019-11-22 14:00:01,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:01,456 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-22 14:00:01,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107246269] [2019-11-22 14:00:01,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:00:01,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 14:00:01,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566949267] [2019-11-22 14:00:01,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 14:00:01,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:01,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 14:00:01,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 14:00:01,463 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 5 states. [2019-11-22 14:00:01,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:01,778 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-22 14:00:01,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 14:00:01,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-22 14:00:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:01,782 INFO L225 Difference]: With dead ends: 99 [2019-11-22 14:00:01,782 INFO L226 Difference]: Without dead ends: 99 [2019-11-22 14:00:01,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-22 14:00:01,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-22 14:00:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2019-11-22 14:00:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-22 14:00:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2019-11-22 14:00:01,800 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 11 [2019-11-22 14:00:01,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:01,804 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2019-11-22 14:00:01,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 14:00:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2019-11-22 14:00:01,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 14:00:01,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:01,805 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:00:01,810 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:00:01,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:01,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2096806293, now seen corresponding path program 1 times [2019-11-22 14:00:01,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:01,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181584770] [2019-11-22 14:00:01,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:01,915 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-22 14:00:01,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181584770] [2019-11-22 14:00:01,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:00:01,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 14:00:01,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691828541] [2019-11-22 14:00:01,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 14:00:01,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:01,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 14:00:01,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 14:00:01,919 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 5 states. [2019-11-22 14:00:02,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:02,130 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2019-11-22 14:00:02,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 14:00:02,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-22 14:00:02,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:02,132 INFO L225 Difference]: With dead ends: 95 [2019-11-22 14:00:02,132 INFO L226 Difference]: Without dead ends: 95 [2019-11-22 14:00:02,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-22 14:00:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-22 14:00:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2019-11-22 14:00:02,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-22 14:00:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-11-22 14:00:02,141 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 19 [2019-11-22 14:00:02,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:02,141 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-11-22 14:00:02,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 14:00:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-11-22 14:00:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-22 14:00:02,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:02,143 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] [2019-11-22 14:00:02,143 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:00:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:02,144 INFO L82 PathProgramCache]: Analyzing trace with hash 576531525, now seen corresponding path program 1 times [2019-11-22 14:00:02,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:02,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37485231] [2019-11-22 14:00:02,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:02,238 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-22 14:00:02,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37485231] [2019-11-22 14:00:02,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:00:02,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 14:00:02,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084587151] [2019-11-22 14:00:02,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 14:00:02,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:02,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 14:00:02,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:00:02,240 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 6 states. [2019-11-22 14:00:02,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:02,471 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-22 14:00:02,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 14:00:02,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-22 14:00:02,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:02,472 INFO L225 Difference]: With dead ends: 99 [2019-11-22 14:00:02,473 INFO L226 Difference]: Without dead ends: 99 [2019-11-22 14:00:02,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-22 14:00:02,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-22 14:00:02,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2019-11-22 14:00:02,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-22 14:00:02,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2019-11-22 14:00:02,481 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 20 [2019-11-22 14:00:02,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:02,482 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2019-11-22 14:00:02,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 14:00:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2019-11-22 14:00:02,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-22 14:00:02,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:02,485 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] [2019-11-22 14:00:02,485 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:00:02,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:02,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1548979245, now seen corresponding path program 1 times [2019-11-22 14:00:02,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:02,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014290221] [2019-11-22 14:00:02,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:00:02,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014290221] [2019-11-22 14:00:02,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:00:02,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 14:00:02,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223998208] [2019-11-22 14:00:02,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 14:00:02,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:02,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 14:00:02,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:00:02,591 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 7 states. [2019-11-22 14:00:02,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:02,879 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2019-11-22 14:00:02,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 14:00:02,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-22 14:00:02,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:02,882 INFO L225 Difference]: With dead ends: 132 [2019-11-22 14:00:02,882 INFO L226 Difference]: Without dead ends: 132 [2019-11-22 14:00:02,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-22 14:00:02,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-22 14:00:02,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 95. [2019-11-22 14:00:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-22 14:00:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2019-11-22 14:00:02,889 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 20 [2019-11-22 14:00:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:02,890 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2019-11-22 14:00:02,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 14:00:02,890 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2019-11-22 14:00:02,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 14:00:02,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:02,891 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] [2019-11-22 14:00:02,891 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:00:02,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:02,893 INFO L82 PathProgramCache]: Analyzing trace with hash 691191193, now seen corresponding path program 1 times [2019-11-22 14:00:02,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:02,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322401807] [2019-11-22 14:00:02,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:03,005 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-22 14:00:03,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322401807] [2019-11-22 14:00:03,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:00:03,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 14:00:03,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563205265] [2019-11-22 14:00:03,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 14:00:03,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:03,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 14:00:03,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:00:03,007 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 6 states. [2019-11-22 14:00:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:03,289 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-22 14:00:03,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 14:00:03,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-22 14:00:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:03,294 INFO L225 Difference]: With dead ends: 109 [2019-11-22 14:00:03,294 INFO L226 Difference]: Without dead ends: 105 [2019-11-22 14:00:03,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:00:03,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-22 14:00:03,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2019-11-22 14:00:03,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-22 14:00:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2019-11-22 14:00:03,301 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 21 [2019-11-22 14:00:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:03,301 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2019-11-22 14:00:03,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 14:00:03,302 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2019-11-22 14:00:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 14:00:03,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:03,302 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] [2019-11-22 14:00:03,303 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:00:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:03,303 INFO L82 PathProgramCache]: Analyzing trace with hash 692608250, now seen corresponding path program 1 times [2019-11-22 14:00:03,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:03,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673145393] [2019-11-22 14:00:03,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:03,383 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-22 14:00:03,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673145393] [2019-11-22 14:00:03,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:00:03,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 14:00:03,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139237580] [2019-11-22 14:00:03,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:00:03,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:03,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:00:03,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:00:03,386 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 8 states. [2019-11-22 14:00:03,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:03,715 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-11-22 14:00:03,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:00:03,716 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-22 14:00:03,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:03,717 INFO L225 Difference]: With dead ends: 111 [2019-11-22 14:00:03,717 INFO L226 Difference]: Without dead ends: 104 [2019-11-22 14:00:03,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-22 14:00:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-22 14:00:03,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2019-11-22 14:00:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-22 14:00:03,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-11-22 14:00:03,723 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 21 [2019-11-22 14:00:03,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:03,723 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-11-22 14:00:03,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:00:03,723 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-11-22 14:00:03,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 14:00:03,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:03,724 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:00:03,725 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:00:03,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:03,725 INFO L82 PathProgramCache]: Analyzing trace with hash -972300712, now seen corresponding path program 1 times [2019-11-22 14:00:03,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:03,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381649082] [2019-11-22 14:00:03,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:00:03,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381649082] [2019-11-22 14:00:03,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:00:03,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 14:00:03,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33481026] [2019-11-22 14:00:03,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 14:00:03,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:03,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 14:00:03,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:00:03,798 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 7 states. [2019-11-22 14:00:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:04,089 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-22 14:00:04,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 14:00:04,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-22 14:00:04,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:04,092 INFO L225 Difference]: With dead ends: 96 [2019-11-22 14:00:04,092 INFO L226 Difference]: Without dead ends: 96 [2019-11-22 14:00:04,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:00:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-22 14:00:04,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-11-22 14:00:04,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-22 14:00:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2019-11-22 14:00:04,097 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 21 [2019-11-22 14:00:04,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:04,097 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2019-11-22 14:00:04,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 14:00:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2019-11-22 14:00:04,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 14:00:04,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:04,098 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:00:04,099 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:00:04,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:04,099 INFO L82 PathProgramCache]: Analyzing trace with hash -972300711, now seen corresponding path program 1 times [2019-11-22 14:00:04,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:04,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108739079] [2019-11-22 14:00:04,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:00:04,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108739079] [2019-11-22 14:00:04,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:00:04,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 14:00:04,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277311244] [2019-11-22 14:00:04,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 14:00:04,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:04,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 14:00:04,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:00:04,176 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 7 states. [2019-11-22 14:00:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:04,503 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2019-11-22 14:00:04,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:00:04,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-22 14:00:04,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:04,505 INFO L225 Difference]: With dead ends: 87 [2019-11-22 14:00:04,505 INFO L226 Difference]: Without dead ends: 87 [2019-11-22 14:00:04,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-22 14:00:04,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-22 14:00:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2019-11-22 14:00:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-22 14:00:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-11-22 14:00:04,509 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 21 [2019-11-22 14:00:04,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:04,509 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-11-22 14:00:04,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 14:00:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-11-22 14:00:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-22 14:00:04,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:04,511 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:00:04,511 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:00:04,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:04,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1951842208, now seen corresponding path program 1 times [2019-11-22 14:00:04,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:04,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733523765] [2019-11-22 14:00:04,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:00:04,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733523765] [2019-11-22 14:00:04,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299966733] [2019-11-22 14:00:04,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:00:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:04,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-22 14:00:04,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:00:04,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 14:00:04,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:04,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:04,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:04,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:00:04,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-22 14:00:04,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:04,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:04,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:04,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-22 14:00:04,990 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:04,990 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 14:00:04,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:05,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:05,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:05,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-11-22 14:00:05,036 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_14|], 2=[|v_#memory_int_16|]} [2019-11-22 14:00:05,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 14:00:05,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:05,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:05,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:05,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-22 14:00:05,070 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:05,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:05,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:05,083 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2019-11-22 14:00:05,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-22 14:00:05,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:05,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:05,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:05,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2019-11-22 14:00:05,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-22 14:00:05,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:05,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:05,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 14:00:05,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2019-11-22 14:00:05,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-22 14:00:05,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:05,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:05,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:05,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-11-22 14:00:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:00:05,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:00:05,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2019-11-22 14:00:05,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740933474] [2019-11-22 14:00:05,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-22 14:00:05,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:05,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-22 14:00:05,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2019-11-22 14:00:05,300 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 23 states. [2019-11-22 14:00:06,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:06,780 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2019-11-22 14:00:06,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-22 14:00:06,781 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2019-11-22 14:00:06,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:06,782 INFO L225 Difference]: With dead ends: 194 [2019-11-22 14:00:06,782 INFO L226 Difference]: Without dead ends: 191 [2019-11-22 14:00:06,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2019-11-22 14:00:06,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-22 14:00:06,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 102. [2019-11-22 14:00:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-22 14:00:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2019-11-22 14:00:06,798 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 30 [2019-11-22 14:00:06,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:06,799 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2019-11-22 14:00:06,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-22 14:00:06,799 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2019-11-22 14:00:06,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-22 14:00:06,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:06,802 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:00:07,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:00:07,008 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:00:07,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:07,008 INFO L82 PathProgramCache]: Analyzing trace with hash 295041158, now seen corresponding path program 1 times [2019-11-22 14:00:07,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:07,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378153957] [2019-11-22 14:00:07,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:00:07,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378153957] [2019-11-22 14:00:07,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651496790] [2019-11-22 14:00:07,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:00:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:07,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-22 14:00:07,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:00:07,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 14:00:07,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:07,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:07,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:07,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:00:07,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-22 14:00:07,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:07,445 INFO L567 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2019-11-22 14:00:07,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:07,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-11-22 14:00:07,483 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:07,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 14:00:07,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:07,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:07,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:07,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-22 14:00:07,535 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_15|], 2=[|v_#memory_int_19|]} [2019-11-22 14:00:07,544 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 14:00:07,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:07,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:07,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:07,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-22 14:00:07,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:07,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:07,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:07,579 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-11-22 14:00:07,618 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-22 14:00:07,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:07,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:07,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:07,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-11-22 14:00:07,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-22 14:00:07,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:07,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:07,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 14:00:07,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-11-22 14:00:07,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-22 14:00:07,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:07,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:07,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:07,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-22 14:00:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:00:07,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:00:07,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-11-22 14:00:07,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471245506] [2019-11-22 14:00:07,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-22 14:00:07,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:07,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-22 14:00:07,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2019-11-22 14:00:07,778 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand 24 states. [2019-11-22 14:00:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:09,004 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2019-11-22 14:00:09,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-22 14:00:09,005 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2019-11-22 14:00:09,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:09,007 INFO L225 Difference]: With dead ends: 183 [2019-11-22 14:00:09,007 INFO L226 Difference]: Without dead ends: 179 [2019-11-22 14:00:09,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=1099, Unknown=0, NotChecked=0, Total=1332 [2019-11-22 14:00:09,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-22 14:00:09,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 98. [2019-11-22 14:00:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-22 14:00:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-11-22 14:00:09,013 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 31 [2019-11-22 14:00:09,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:09,014 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-11-22 14:00:09,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-22 14:00:09,014 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-11-22 14:00:09,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-22 14:00:09,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:09,015 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:00:09,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:00:09,227 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:00:09,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:09,228 INFO L82 PathProgramCache]: Analyzing trace with hash 384991059, now seen corresponding path program 2 times [2019-11-22 14:00:09,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:09,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318357509] [2019-11-22 14:00:09,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-22 14:00:09,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318357509] [2019-11-22 14:00:09,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:00:09,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 14:00:09,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975399431] [2019-11-22 14:00:09,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 14:00:09,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:09,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 14:00:09,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 14:00:09,270 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 4 states. [2019-11-22 14:00:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:09,345 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2019-11-22 14:00:09,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 14:00:09,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-11-22 14:00:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:09,347 INFO L225 Difference]: With dead ends: 131 [2019-11-22 14:00:09,347 INFO L226 Difference]: Without dead ends: 131 [2019-11-22 14:00:09,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-22 14:00:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-22 14:00:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 98. [2019-11-22 14:00:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-22 14:00:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2019-11-22 14:00:09,352 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 40 [2019-11-22 14:00:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:09,352 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2019-11-22 14:00:09,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 14:00:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2019-11-22 14:00:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-22 14:00:09,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:09,354 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:00:09,354 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:00:09,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash -232317747, now seen corresponding path program 1 times [2019-11-22 14:00:09,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:09,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887495329] [2019-11-22 14:00:09,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:00:09,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887495329] [2019-11-22 14:00:09,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955979986] [2019-11-22 14:00:09,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:00:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:09,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-22 14:00:09,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:00:09,851 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 14:00:09,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:09,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:09,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:09,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:00:09,911 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-22 14:00:09,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:09,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:09,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:09,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-22 14:00:09,982 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:09,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 14:00:09,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:09,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:09,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:09,993 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-11-22 14:00:10,024 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_16|], 2=[|v_#memory_int_22|]} [2019-11-22 14:00:10,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 14:00:10,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:10,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:10,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:10,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-22 14:00:10,058 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:10,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:10,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:10,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:35 [2019-11-22 14:00:10,116 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-22 14:00:10,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:10,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:10,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:10,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:23 [2019-11-22 14:00:10,187 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-22 14:00:10,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:10,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:10,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:10,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-22 14:00:10,254 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:10,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 14:00:10,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:10,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:10,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:10,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2019-11-22 14:00:10,305 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_17|], 6=[|v_#memory_int_24|]} [2019-11-22 14:00:10,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 14:00:10,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:10,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:10,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:10,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-22 14:00:10,336 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:10,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:10,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:10,349 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:35 [2019-11-22 14:00:10,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-22 14:00:10,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:10,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:10,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 14:00:10,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2019-11-22 14:00:10,513 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:10,514 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2019-11-22 14:00:10,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:10,556 INFO L567 ElimStorePlain]: treesize reduction 16, result has 73.3 percent of original size [2019-11-22 14:00:10,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:10,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 14:00:10,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:40, output treesize:44 [2019-11-22 14:00:10,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:10,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:10,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-22 14:00:10,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:10,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:10,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:10,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-11-22 14:00:10,719 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:00:10,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:00:10,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2019-11-22 14:00:10,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548559632] [2019-11-22 14:00:10,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-22 14:00:10,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:10,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-22 14:00:10,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2019-11-22 14:00:10,721 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 32 states. [2019-11-22 14:00:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:12,012 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-11-22 14:00:12,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-22 14:00:12,012 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-11-22 14:00:12,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:12,013 INFO L225 Difference]: With dead ends: 57 [2019-11-22 14:00:12,014 INFO L226 Difference]: Without dead ends: 54 [2019-11-22 14:00:12,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=429, Invalid=2433, Unknown=0, NotChecked=0, Total=2862 [2019-11-22 14:00:12,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-22 14:00:12,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-11-22 14:00:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-22 14:00:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-11-22 14:00:12,018 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 40 [2019-11-22 14:00:12,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:12,018 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-11-22 14:00:12,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-22 14:00:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-11-22 14:00:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-22 14:00:12,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:12,019 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:00:12,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:00:12,227 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-22 14:00:12,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:12,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1305559289, now seen corresponding path program 1 times [2019-11-22 14:00:12,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:00:12,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854786496] [2019-11-22 14:00:12,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:00:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:00:12,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854786496] [2019-11-22 14:00:12,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479964920] [2019-11-22 14:00:12,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:00:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:12,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-22 14:00:12,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:00:12,618 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 14:00:12,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:12,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:12,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:12,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:00:12,742 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-22 14:00:12,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:12,761 INFO L567 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2019-11-22 14:00:12,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:12,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-11-22 14:00:12,794 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:12,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 14:00:12,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:12,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:12,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:12,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-22 14:00:12,838 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_18|], 2=[|v_#memory_int_27|]} [2019-11-22 14:00:12,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 14:00:12,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:12,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:12,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:12,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-22 14:00:12,867 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:12,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:12,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:12,881 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2019-11-22 14:00:12,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-22 14:00:12,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:12,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:12,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:12,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2019-11-22 14:00:12,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-22 14:00:12,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:12,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:12,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:12,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-22 14:00:13,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:13,036 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 14:00:13,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:13,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:13,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:13,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-11-22 14:00:13,099 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_19|], 6=[|v_#memory_int_29|]} [2019-11-22 14:00:13,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 14:00:13,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:13,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:13,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:13,128 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-22 14:00:13,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:13,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:13,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:13,142 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2019-11-22 14:00:13,186 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-22 14:00:13,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:13,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:13,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 14:00:13,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26 [2019-11-22 14:00:13,324 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:13,325 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2019-11-22 14:00:13,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:13,362 INFO L567 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2019-11-22 14:00:13,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:13,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 14:00:13,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:41 [2019-11-22 14:00:13,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:13,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:13,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-22 14:00:13,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:13,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:13,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:13,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-11-22 14:00:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:00:13,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:00:13,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2019-11-22 14:00:13,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037528446] [2019-11-22 14:00:13,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-22 14:00:13,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:00:13,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-22 14:00:13,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2019-11-22 14:00:13,528 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 34 states. [2019-11-22 14:00:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:14,513 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-11-22 14:00:14,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-22 14:00:14,514 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2019-11-22 14:00:14,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:14,514 INFO L225 Difference]: With dead ends: 46 [2019-11-22 14:00:14,514 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 14:00:14,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=424, Invalid=2438, Unknown=0, NotChecked=0, Total=2862 [2019-11-22 14:00:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 14:00:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 14:00:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 14:00:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 14:00:14,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-11-22 14:00:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:14,518 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 14:00:14,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-22 14:00:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 14:00:14,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 14:00:14,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:00:14,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:00:14 BoogieIcfgContainer [2019-11-22 14:00:14,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 14:00:14,727 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 14:00:14,727 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 14:00:14,728 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 14:00:14,728 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:00:00" (3/4) ... [2019-11-22 14:00:14,732 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 14:00:14,739 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 14:00:14,739 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-22 14:00:14,739 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-22 14:00:14,740 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-22 14:00:14,740 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-22 14:00:14,740 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-22 14:00:14,740 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 14:00:14,740 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-22 14:00:14,746 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-22 14:00:14,747 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-22 14:00:14,747 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 14:00:14,747 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 14:00:14,797 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 14:00:14,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 14:00:14,798 INFO L168 Benchmark]: Toolchain (without parser) took 15721.95 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 392.2 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -231.8 MB). Peak memory consumption was 160.4 MB. Max. memory is 11.5 GB. [2019-11-22 14:00:14,798 INFO L168 Benchmark]: CDTParser took 0.29 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-22 14:00:14,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 616.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-22 14:00:14,799 INFO L168 Benchmark]: Boogie Preprocessor took 74.39 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.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-11-22 14:00:14,799 INFO L168 Benchmark]: RCFGBuilder took 654.66 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.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. [2019-11-22 14:00:14,800 INFO L168 Benchmark]: TraceAbstraction took 14301.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -132.3 MB). Peak memory consumption was 114.2 MB. Max. memory is 11.5 GB. [2019-11-22 14:00:14,800 INFO L168 Benchmark]: Witness Printer took 69.68 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2019-11-22 14:00:14,802 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.29 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.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.39 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.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 654.66 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.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14301.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -132.3 MB). Peak memory consumption was 114.2 MB. Max. memory is 11.5 GB. * Witness Printer took 69.68 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 96 locations, 29 error locations. Result: SAFE, OverallTime: 14.2s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 707 SDtfs, 1576 SDslu, 2444 SDs, 0 SdLazy, 4405 SolverSat, 460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2241 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 316 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 499 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 480 ConstructedInterpolants, 22 QuantifiedInterpolants, 144152 SizeOfPredicates, 65 NumberOfNonLiveVariables, 662 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 24/80 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...