./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memcleanup.prp --file /storage/repos/svcomp/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 91b1670e Calling Ultimate with: 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 /storage/repos/svcomp/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a74485b04ec8988328f8bc8f67ebe898d81e7141 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:03:32,119 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:03:32,121 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:03:32,133 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:03:32,134 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:03:32,135 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:03:32,136 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:03:32,138 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:03:32,140 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:03:32,141 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:03:32,142 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:03:32,142 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:03:32,144 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:03:32,145 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:03:32,146 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:03:32,147 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:03:32,148 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:03:32,150 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:03:32,152 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:03:32,154 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:03:32,155 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:03:32,157 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:03:32,159 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:03:32,159 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:03:32,160 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:03:32,161 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:03:32,162 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:03:32,163 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:03:32,163 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:03:32,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:03:32,165 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:03:32,166 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:03:32,166 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:03:32,166 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:03:32,168 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:03:32,169 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:03:32,169 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2018-11-28 23:03:32,186 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:03:32,187 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:03:32,187 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:03:32,189 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:03:32,192 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:03:32,192 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:03:32,192 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:03:32,192 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:03:32,192 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:03:32,193 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:03:32,194 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:03:32,194 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:03:32,194 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:03:32,194 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 23:03:32,194 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 23:03:32,194 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:03:32,196 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:03:32,197 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:03:32,197 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:03:32,197 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:03:32,197 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:03:32,197 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:03:32,199 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:03:32,199 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:03:32,199 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:03:32,199 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:03:32,199 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:03:32,200 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a74485b04ec8988328f8bc8f67ebe898d81e7141 [2018-11-28 23:03:32,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:03:32,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:03:32,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:03:32,264 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:03:32,265 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:03:32,265 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-11-28 23:03:32,334 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4889bb526/760de5d3e3904708854c79b15d08723d/FLAG633997b66 [2018-11-28 23:03:32,859 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:03:32,863 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-11-28 23:03:32,879 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4889bb526/760de5d3e3904708854c79b15d08723d/FLAG633997b66 [2018-11-28 23:03:33,156 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4889bb526/760de5d3e3904708854c79b15d08723d [2018-11-28 23:03:33,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:03:33,162 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 23:03:33,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:03:33,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:03:33,167 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:03:33,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:03:33" (1/1) ... [2018-11-28 23:03:33,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6896aeb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:33, skipping insertion in model container [2018-11-28 23:03:33,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:03:33" (1/1) ... [2018-11-28 23:03:33,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:03:33,237 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:03:33,606 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:03:33,622 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:03:33,676 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:03:33,740 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:03:33,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:33 WrapperNode [2018-11-28 23:03:33,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:03:33,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:03:33,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:03:33,741 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:03:33,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:33" (1/1) ... [2018-11-28 23:03:33,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:33" (1/1) ... [2018-11-28 23:03:33,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:33" (1/1) ... [2018-11-28 23:03:33,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:33" (1/1) ... [2018-11-28 23:03:33,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:33" (1/1) ... [2018-11-28 23:03:33,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:33" (1/1) ... [2018-11-28 23:03:33,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:33" (1/1) ... [2018-11-28 23:03:33,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:03:33,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:03:33,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:03:33,897 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:03:33,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:33" (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 [2018-11-28 23:03:33,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:03:33,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:03:33,953 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-11-28 23:03:33,953 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:03:33,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 23:03:33,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 23:03:33,953 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 23:03:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 23:03:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 23:03:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 23:03:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 23:03:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 23:03:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 23:03:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 23:03:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 23:03:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 23:03:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 23:03:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 23:03:33,956 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 23:03:33,956 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 23:03:33,956 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 23:03:33,956 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 23:03:33,956 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 23:03:33,956 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 23:03:33,959 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 23:03:33,959 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 23:03:33,959 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 23:03:33,959 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 23:03:33,959 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 23:03:33,960 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 23:03:33,960 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 23:03:33,960 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 23:03:33,961 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 23:03:33,961 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 23:03:33,961 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 23:03:33,961 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 23:03:33,961 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 23:03:33,961 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 23:03:33,961 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 23:03:33,961 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 23:03:33,962 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 23:03:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 23:03:33,964 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 23:03:33,964 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 23:03:33,964 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 23:03:33,964 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 23:03:33,964 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 23:03:33,964 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 23:03:33,964 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 23:03:33,964 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 23:03:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 23:03:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 23:03:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 23:03:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 23:03:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 23:03:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 23:03:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 23:03:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 23:03:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 23:03:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 23:03:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 23:03:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 23:03:33,967 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 23:03:33,968 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 23:03:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 23:03:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 23:03:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 23:03:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 23:03:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 23:03:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 23:03:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 23:03:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 23:03:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 23:03:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 23:03:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 23:03:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 23:03:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 23:03:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 23:03:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 23:03:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 23:03:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 23:03:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 23:03:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 23:03:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 23:03:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 23:03:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 23:03:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 23:03:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 23:03:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 23:03:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 23:03:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 23:03:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 23:03:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 23:03:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 23:03:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 23:03:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 23:03:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 23:03:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 23:03:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 23:03:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 23:03:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 23:03:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 23:03:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 23:03:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 23:03:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 23:03:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 23:03:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 23:03:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-11-28 23:03:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:03:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:03:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:03:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 23:03:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 23:03:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:03:33,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:03:33,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:03:33,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:03:34,879 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:03:34,879 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-28 23:03:34,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:03:34 BoogieIcfgContainer [2018-11-28 23:03:34,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:03:34,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:03:34,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:03:34,884 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:03:34,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:03:33" (1/3) ... [2018-11-28 23:03:34,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7baec133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:03:34, skipping insertion in model container [2018-11-28 23:03:34,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:03:33" (2/3) ... [2018-11-28 23:03:34,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7baec133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:03:34, skipping insertion in model container [2018-11-28 23:03:34,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:03:34" (3/3) ... [2018-11-28 23:03:34,888 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-11-28 23:03:34,899 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:03:34,908 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-11-28 23:03:34,926 INFO L257 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2018-11-28 23:03:34,955 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:03:34,956 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:03:34,956 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 23:03:34,956 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:03:34,957 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:03:34,957 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:03:34,957 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:03:34,957 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:03:34,957 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:03:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-11-28 23:03:34,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 23:03:34,987 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:03:34,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:03:34,990 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:03:34,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:03:34,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1038621538, now seen corresponding path program 1 times [2018-11-28 23:03:34,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:03:34,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:03:35,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:35,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:35,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:35,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:03:35,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:03:35,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 23:03:35,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:03:35,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:03:35,162 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-11-28 23:03:35,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:03:35,185 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-11-28 23:03:35,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:03:35,186 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-28 23:03:35,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:03:35,196 INFO L225 Difference]: With dead ends: 76 [2018-11-28 23:03:35,196 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 23:03:35,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:03:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 23:03:35,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-28 23:03:35,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 23:03:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-28 23:03:35,243 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 10 [2018-11-28 23:03:35,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:03:35,244 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-28 23:03:35,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 23:03:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-28 23:03:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 23:03:35,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:03:35,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:03:35,245 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:03:35,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:03:35,246 INFO L82 PathProgramCache]: Analyzing trace with hash -2132532259, now seen corresponding path program 1 times [2018-11-28 23:03:35,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:03:35,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:03:35,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:35,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:35,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:35,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:03:35,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:03:35,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:03:35,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:03:35,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:03:35,368 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 4 states. [2018-11-28 23:03:35,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:03:35,856 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-11-28 23:03:35,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:03:35,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 23:03:35,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:03:35,859 INFO L225 Difference]: With dead ends: 85 [2018-11-28 23:03:35,859 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 23:03:35,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:03:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 23:03:35,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2018-11-28 23:03:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 23:03:35,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2018-11-28 23:03:35,871 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 11 [2018-11-28 23:03:35,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:03:35,872 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2018-11-28 23:03:35,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:03:35,872 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-28 23:03:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 23:03:35,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:03:35,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:03:35,873 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:03:35,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:03:35,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2132532258, now seen corresponding path program 1 times [2018-11-28 23:03:35,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:03:35,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:03:35,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:35,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:35,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:35,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:03:35,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:03:35,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 23:03:35,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:03:35,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:03:35,987 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 4 states. [2018-11-28 23:03:36,178 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 23:03:36,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:03:36,591 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-11-28 23:03:36,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:03:36,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 23:03:36,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:03:36,593 INFO L225 Difference]: With dead ends: 93 [2018-11-28 23:03:36,593 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 23:03:36,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:03:36,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 23:03:36,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-11-28 23:03:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 23:03:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-11-28 23:03:36,603 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 11 [2018-11-28 23:03:36,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:03:36,604 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-11-28 23:03:36,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 23:03:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-11-28 23:03:36,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 23:03:36,605 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:03:36,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:03:36,605 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:03:36,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:03:36,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1219409795, now seen corresponding path program 1 times [2018-11-28 23:03:36,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:03:36,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:03:36,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:36,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:36,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:36,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:36,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:03:36,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:03:36,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:03:36,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:03:36,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:03:36,778 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 5 states. [2018-11-28 23:03:37,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:03:37,104 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2018-11-28 23:03:37,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:03:37,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 23:03:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:03:37,107 INFO L225 Difference]: With dead ends: 122 [2018-11-28 23:03:37,108 INFO L226 Difference]: Without dead ends: 119 [2018-11-28 23:03:37,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:03:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-28 23:03:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 106. [2018-11-28 23:03:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-28 23:03:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2018-11-28 23:03:37,119 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 20 [2018-11-28 23:03:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:03:37,119 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2018-11-28 23:03:37,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:03:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2018-11-28 23:03:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 23:03:37,120 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:03:37,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:03:37,121 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:03:37,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:03:37,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1219362099, now seen corresponding path program 1 times [2018-11-28 23:03:37,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:03:37,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:03:37,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:37,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:37,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:37,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:03:37,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:03:37,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:03:37,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:03:37,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:03:37,206 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 5 states. [2018-11-28 23:03:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:03:37,423 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2018-11-28 23:03:37,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:03:37,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 23:03:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:03:37,426 INFO L225 Difference]: With dead ends: 116 [2018-11-28 23:03:37,426 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 23:03:37,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:03:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 23:03:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2018-11-28 23:03:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-28 23:03:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2018-11-28 23:03:37,436 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 20 [2018-11-28 23:03:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:03:37,437 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2018-11-28 23:03:37,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:03:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2018-11-28 23:03:37,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 23:03:37,438 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:03:37,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:03:37,439 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:03:37,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:03:37,440 INFO L82 PathProgramCache]: Analyzing trace with hash 48910251, now seen corresponding path program 1 times [2018-11-28 23:03:37,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:03:37,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:03:37,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:37,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:37,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:37,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:03:37,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:03:37,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 23:03:37,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:03:37,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:03:37,498 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 3 states. [2018-11-28 23:03:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:03:37,526 INFO L93 Difference]: Finished difference Result 159 states and 181 transitions. [2018-11-28 23:03:37,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:03:37,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 23:03:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:03:37,528 INFO L225 Difference]: With dead ends: 159 [2018-11-28 23:03:37,528 INFO L226 Difference]: Without dead ends: 159 [2018-11-28 23:03:37,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:03:37,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-28 23:03:37,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 120. [2018-11-28 23:03:37,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-28 23:03:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2018-11-28 23:03:37,543 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 20 [2018-11-28 23:03:37,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:03:37,543 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2018-11-28 23:03:37,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 23:03:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2018-11-28 23:03:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 23:03:37,545 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:03:37,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:03:37,546 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:03:37,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:03:37,547 INFO L82 PathProgramCache]: Analyzing trace with hash -246914379, now seen corresponding path program 1 times [2018-11-28 23:03:37,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:03:37,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:03:37,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:37,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:37,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:37,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:03:37,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 23:03:37,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:03:37,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:03:37,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:03:37,670 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand 6 states. [2018-11-28 23:03:38,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:03:38,044 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2018-11-28 23:03:38,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:03:38,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-28 23:03:38,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:03:38,045 INFO L225 Difference]: With dead ends: 127 [2018-11-28 23:03:38,045 INFO L226 Difference]: Without dead ends: 127 [2018-11-28 23:03:38,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:03:38,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-28 23:03:38,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2018-11-28 23:03:38,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 23:03:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2018-11-28 23:03:38,063 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 20 [2018-11-28 23:03:38,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:03:38,064 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2018-11-28 23:03:38,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:03:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2018-11-28 23:03:38,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 23:03:38,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:03:38,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:03:38,065 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:03:38,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:03:38,066 INFO L82 PathProgramCache]: Analyzing trace with hash 854480748, now seen corresponding path program 1 times [2018-11-28 23:03:38,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:03:38,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:03:38,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:38,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:38,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:38,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:03:38,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:03:38,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:03:38,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:03:38,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:03:38,178 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 6 states. [2018-11-28 23:03:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:03:38,445 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-11-28 23:03:38,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:03:38,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 23:03:38,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:03:38,448 INFO L225 Difference]: With dead ends: 108 [2018-11-28 23:03:38,448 INFO L226 Difference]: Without dead ends: 108 [2018-11-28 23:03:38,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:03:38,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-28 23:03:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2018-11-28 23:03:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-28 23:03:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2018-11-28 23:03:38,456 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 21 [2018-11-28 23:03:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:03:38,457 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2018-11-28 23:03:38,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:03:38,457 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-11-28 23:03:38,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 23:03:38,458 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:03:38,458 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:03:38,458 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:03:38,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:03:38,459 INFO L82 PathProgramCache]: Analyzing trace with hash -810428214, now seen corresponding path program 1 times [2018-11-28 23:03:38,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:03:38,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:03:38,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:38,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:38,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:38,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:03:38,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:03:38,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:03:38,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:03:38,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:03:38,558 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2018-11-28 23:03:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:03:38,800 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2018-11-28 23:03:38,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:03:38,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 23:03:38,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:03:38,803 INFO L225 Difference]: With dead ends: 103 [2018-11-28 23:03:38,803 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 23:03:38,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:03:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 23:03:38,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-11-28 23:03:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 23:03:38,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-11-28 23:03:38,809 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 21 [2018-11-28 23:03:38,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:03:38,809 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-11-28 23:03:38,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:03:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-11-28 23:03:38,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 23:03:38,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:03:38,810 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:03:38,811 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:03:38,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:03:38,811 INFO L82 PathProgramCache]: Analyzing trace with hash -810428213, now seen corresponding path program 1 times [2018-11-28 23:03:38,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:03:38,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:03:38,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:38,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:38,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:39,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:03:39,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:03:39,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 23:03:39,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:03:39,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:03:39,024 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 6 states. [2018-11-28 23:03:39,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:03:39,365 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-11-28 23:03:39,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:03:39,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 23:03:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:03:39,368 INFO L225 Difference]: With dead ends: 112 [2018-11-28 23:03:39,368 INFO L226 Difference]: Without dead ends: 112 [2018-11-28 23:03:39,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:03:39,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-28 23:03:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 86. [2018-11-28 23:03:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-28 23:03:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-11-28 23:03:39,374 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 21 [2018-11-28 23:03:39,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:03:39,375 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-11-28 23:03:39,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 23:03:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-11-28 23:03:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 23:03:39,376 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:03:39,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:03:39,377 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:03:39,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:03:39,379 INFO L82 PathProgramCache]: Analyzing trace with hash 719099552, now seen corresponding path program 1 times [2018-11-28 23:03:39,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:03:39,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:03:39,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:39,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:39,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:39,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:03:39,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:03:39,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 23:03:39,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:03:39,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:03:39,539 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 7 states. [2018-11-28 23:03:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:03:39,750 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-11-28 23:03:39,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:03:39,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-28 23:03:39,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:03:39,753 INFO L225 Difference]: With dead ends: 105 [2018-11-28 23:03:39,753 INFO L226 Difference]: Without dead ends: 98 [2018-11-28 23:03:39,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:03:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-28 23:03:39,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2018-11-28 23:03:39,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 23:03:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-11-28 23:03:39,757 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 22 [2018-11-28 23:03:39,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:03:39,757 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-11-28 23:03:39,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 23:03:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-11-28 23:03:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 23:03:39,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:03:39,759 INFO L402 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] [2018-11-28 23:03:39,761 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:03:39,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:03:39,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1968452048, now seen corresponding path program 1 times [2018-11-28 23:03:39,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:03:39,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:03:39,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:39,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:39,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:40,247 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-11-28 23:03:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:40,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:03:40,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:03:40,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:40,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:03:40,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 23:03:40,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:40,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:40,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 23:03:40,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 23:03:40,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:03:40,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:40,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:40,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:40,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-11-28 23:03:40,845 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:40,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:40,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 23:03:40,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:40,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:40,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-11-28 23:03:40,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 23:03:40,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 23:03:40,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:40,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:41,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 23:03:41,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:41,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 23:03:41,058 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:41,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:41,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:41,132 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-11-28 23:03:41,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 23:03:41,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-28 23:03:41,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:41,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:41,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:41,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-11-28 23:03:41,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 23:03:41,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:03:41,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:41,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:41,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 23:03:41,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-11-28 23:03:41,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 23:03:41,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 23:03:41,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:41,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 23:03:41,454 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:41,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:41,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:41,464 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-11-28 23:03:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:41,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:03:41,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-11-28 23:03:41,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 23:03:41,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 23:03:41,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-11-28 23:03:41,518 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 21 states. [2018-11-28 23:03:43,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:03:43,176 INFO L93 Difference]: Finished difference Result 179 states and 200 transitions. [2018-11-28 23:03:43,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 23:03:43,180 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-11-28 23:03:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:03:43,181 INFO L225 Difference]: With dead ends: 179 [2018-11-28 23:03:43,181 INFO L226 Difference]: Without dead ends: 179 [2018-11-28 23:03:43,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2018-11-28 23:03:43,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-28 23:03:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 96. [2018-11-28 23:03:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 23:03:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2018-11-28 23:03:43,188 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 30 [2018-11-28 23:03:43,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:03:43,188 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2018-11-28 23:03:43,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 23:03:43,188 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-11-28 23:03:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 23:03:43,191 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:03:43,191 INFO L402 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] [2018-11-28 23:03:43,191 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:03:43,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:03:43,193 INFO L82 PathProgramCache]: Analyzing trace with hash -995956632, now seen corresponding path program 1 times [2018-11-28 23:03:43,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:03:43,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:03:43,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:43,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:43,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:43,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:43,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:03:43,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:03:43,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:43,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:03:43,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 23:03:43,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:43,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:43,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 23:03:43,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 23:03:43,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:03:43,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:43,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:43,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:43,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-28 23:03:43,686 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:43,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:43,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 23:03:43,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:43,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:43,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-11-28 23:03:43,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 23:03:43,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:43,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 23:03:43,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:43,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:43,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 23:03:43,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 23:03:43,809 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:43,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:43,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:43,825 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2018-11-28 23:03:43,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 23:03:43,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-28 23:03:43,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:43,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:43,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:43,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-11-28 23:03:43,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 23:03:43,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:03:43,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:43,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:43,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 23:03:43,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-11-28 23:03:44,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 23:03:44,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 23:03:44,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:44,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 23:03:44,075 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:44,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:44,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:44,088 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-11-28 23:03:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:44,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:03:44,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-28 23:03:44,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 23:03:44,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 23:03:44,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-11-28 23:03:44,125 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 21 states. [2018-11-28 23:03:44,531 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 23:03:45,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:03:45,495 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-11-28 23:03:45,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 23:03:45,496 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-11-28 23:03:45,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:03:45,497 INFO L225 Difference]: With dead ends: 133 [2018-11-28 23:03:45,497 INFO L226 Difference]: Without dead ends: 126 [2018-11-28 23:03:45,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 23:03:45,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-28 23:03:45,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2018-11-28 23:03:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-28 23:03:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2018-11-28 23:03:45,504 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 30 [2018-11-28 23:03:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:03:45,504 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2018-11-28 23:03:45,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 23:03:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2018-11-28 23:03:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 23:03:45,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:03:45,508 INFO L402 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] [2018-11-28 23:03:45,508 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:03:45,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:03:45,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1031908765, now seen corresponding path program 1 times [2018-11-28 23:03:45,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:03:45,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:03:45,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:45,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:45,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:46,016 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-11-28 23:03:46,348 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-11-28 23:03:46,759 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2018-11-28 23:03:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:46,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:03:46,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:03:46,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:46,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:03:46,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 23:03:46,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 23:03:47,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 23:03:47,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:03:47,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-11-28 23:03:47,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:47,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:47,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 23:03:47,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-11-28 23:03:47,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 23:03:47,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 23:03:47,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 23:03:47,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:47,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 23:03:47,542 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2018-11-28 23:03:47,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 23:03:47,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-28 23:03:47,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2018-11-28 23:03:47,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 23:03:47,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:03:47,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-28 23:03:47,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:47,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:47,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 23:03:47,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-11-28 23:03:47,784 INFO L478 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 13 treesize of output 10 [2018-11-28 23:03:47,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 23:03:47,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-28 23:03:47,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:47,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 23:03:47,835 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,841 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,854 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2018-11-28 23:03:47,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 23:03:47,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-28 23:03:47,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:47,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 23:03:47,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26 [2018-11-28 23:03:48,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-11-28 23:03:48,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-28 23:03:48,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:48,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:48,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-11-28 23:03:48,079 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 23:03:48,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:03:48,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-11-28 23:03:48,131 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:37, output treesize:56 [2018-11-28 23:03:48,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 23:03:48,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 23:03:48,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:48,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 23:03:48,244 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:48,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:48,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:48,250 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-28 23:03:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:48,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:03:48,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2018-11-28 23:03:48,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-28 23:03:48,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-28 23:03:48,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2018-11-28 23:03:48,295 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 31 states. [2018-11-28 23:03:49,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:03:49,930 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2018-11-28 23:03:49,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-28 23:03:49,931 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-11-28 23:03:49,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:03:49,933 INFO L225 Difference]: With dead ends: 92 [2018-11-28 23:03:49,934 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 23:03:49,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=386, Invalid=2064, Unknown=0, NotChecked=0, Total=2450 [2018-11-28 23:03:49,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 23:03:49,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-11-28 23:03:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 23:03:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-11-28 23:03:49,940 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 40 [2018-11-28 23:03:49,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:03:49,941 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-11-28 23:03:49,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-28 23:03:49,941 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-11-28 23:03:49,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 23:03:49,942 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:03:49,942 INFO L402 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] [2018-11-28 23:03:49,945 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr11REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 23:03:49,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:03:49,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2004404181, now seen corresponding path program 1 times [2018-11-28 23:03:49,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:03:49,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:03:49,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:49,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:49,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:03:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:50,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:03:50,283 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:03:50,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:03:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:03:50,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:03:50,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 23:03:50,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:50,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:50,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 23:03:50,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 23:03:50,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:03:50,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:50,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:50,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:50,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-28 23:03:50,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:50,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:50,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 23:03:50,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:50,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:50,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2018-11-28 23:03:50,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 23:03:50,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:50,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 23:03:50,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:50,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:50,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 23:03:50,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 23:03:50,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:50,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:50,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:50,795 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:46 [2018-11-28 23:03:50,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-28 23:03:50,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-11-28 23:03:50,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:50,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:50,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:50,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:28 [2018-11-28 23:03:51,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 23:03:51,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:03:51,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-11-28 23:03:51,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:51,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:51,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:51,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 23:03:51,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2018-11-28 23:03:51,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 23:03:51,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 23:03:51,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-28 23:03:51,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:03:51,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 23:03:51,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,240 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:45 [2018-11-28 23:03:51,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-28 23:03:51,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-11-28 23:03:51,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 23:03:51,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:33 [2018-11-28 23:03:51,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-11-28 23:03:51,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:03:51,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 23:03:51,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-11-28 23:03:51,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-11-28 23:03:51,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 23:03:51,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 23:03:51,683 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 23:03:51,698 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:03:51,722 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:47, output treesize:3 [2018-11-28 23:03:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:03:51,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:03:51,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-11-28 23:03:51,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-28 23:03:51,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-28 23:03:51,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2018-11-28 23:03:51,783 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 30 states. [2018-11-28 23:03:54,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:03:54,111 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-11-28 23:03:54,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 23:03:54,113 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2018-11-28 23:03:54,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:03:54,114 INFO L225 Difference]: With dead ends: 79 [2018-11-28 23:03:54,114 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 23:03:54,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=558, Invalid=2748, Unknown=0, NotChecked=0, Total=3306 [2018-11-28 23:03:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 23:03:54,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 23:03:54,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 23:03:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:03:54,116 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-11-28 23:03:54,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:03:54,116 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:03:54,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-28 23:03:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:03:54,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 23:03:54,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:03:54 BoogieIcfgContainer [2018-11-28 23:03:54,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:03:54,127 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:03:54,127 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:03:54,128 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:03:54,128 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:03:34" (3/4) ... [2018-11-28 23:03:54,134 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 23:03:54,142 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 23:03:54,143 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-11-28 23:03:54,143 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 23:03:54,151 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 23:03:54,153 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 23:03:54,153 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 23:03:54,219 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:03:54,219 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:03:54,220 INFO L168 Benchmark]: Toolchain (without parser) took 21059.49 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.2 MB). Free memory was 946.0 MB in the beginning and 848.8 MB in the end (delta: 97.2 MB). Peak memory consumption was 403.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:03:54,222 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:03:54,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 577.76 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 919.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:03:54,222 INFO L168 Benchmark]: Boogie Preprocessor took 155.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:03:54,223 INFO L168 Benchmark]: RCFGBuilder took 982.96 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:03:54,223 INFO L168 Benchmark]: TraceAbstraction took 19246.20 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 858.1 MB in the end (delta: 207.6 MB). Peak memory consumption was 389.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:03:54,226 INFO L168 Benchmark]: Witness Printer took 92.04 ms. Allocated memory is still 1.3 GB. Free memory was 858.1 MB in the beginning and 848.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:03:54,228 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 577.76 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 919.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 155.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 982.96 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19246.20 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 858.1 MB in the end (delta: 207.6 MB). Peak memory consumption was 389.5 MB. Max. memory is 11.5 GB. * Witness Printer took 92.04 ms. Allocated memory is still 1.3 GB. Free memory was 858.1 MB in the beginning and 848.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 645]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 645]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 643]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 643]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 27 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 78 locations, 27 error locations. SAFE Result, 19.1s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 10.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 707 SDtfs, 1525 SDslu, 2490 SDs, 0 SdLazy, 3079 SolverSat, 432 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 117 SyntacticMatches, 6 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2155 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 284 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 458 ConstructedInterpolants, 22 QuantifiedInterpolants, 141358 SizeOfPredicates, 65 NumberOfNonLiveVariables, 646 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 11/67 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...