./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa 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-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd0b9292151174331f3cf63e5ad3d651d29dfbcc ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd0b9292151174331f3cf63e5ad3d651d29dfbcc .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:59:04,187 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:59:04,189 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:59:04,205 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:59:04,207 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:59:04,208 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:59:04,210 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:59:04,212 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:59:04,215 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:59:04,218 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:59:04,220 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:59:04,221 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:59:04,222 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:59:04,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:59:04,233 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:59:04,233 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:59:04,234 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:59:04,236 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:59:04,238 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:59:04,239 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:59:04,240 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:59:04,242 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:59:04,244 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:59:04,244 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:59:04,245 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:59:04,245 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:59:04,247 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:59:04,247 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:59:04,248 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:59:04,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:59:04,250 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:59:04,250 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:59:04,251 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:59:04,251 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:59:04,252 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:59:04,253 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:59:04,253 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 17:59:04,267 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:59:04,268 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:59:04,269 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:59:04,269 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:59:04,269 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:59:04,269 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:59:04,269 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:59:04,270 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:59:04,271 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:59:04,271 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:59:04,271 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:59:04,271 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:59:04,271 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:59:04,271 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:59:04,272 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:59:04,272 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:59:04,273 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:59:04,273 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:59:04,273 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:59:04,273 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:59:04,273 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:59:04,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:59:04,274 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:59:04,274 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:59:04,274 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:59:04,274 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:59:04,274 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd0b9292151174331f3cf63e5ad3d651d29dfbcc [2019-01-01 17:59:04,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:59:04,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:59:04,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:59:04,352 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:59:04,352 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:59:04,353 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2019-01-01 17:59:04,420 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d298ef99f/def44f24e4654c748149d70dc29ca420/FLAGd5fca1ad9 [2019-01-01 17:59:04,903 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:59:04,904 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2019-01-01 17:59:04,916 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d298ef99f/def44f24e4654c748149d70dc29ca420/FLAGd5fca1ad9 [2019-01-01 17:59:05,212 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d298ef99f/def44f24e4654c748149d70dc29ca420 [2019-01-01 17:59:05,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:59:05,217 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:59:05,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:59:05,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:59:05,222 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:59:05,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:59:05" (1/1) ... [2019-01-01 17:59:05,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a04698b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:05, skipping insertion in model container [2019-01-01 17:59:05,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:59:05" (1/1) ... [2019-01-01 17:59:05,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:59:05,293 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:59:05,663 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:59:05,684 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:59:05,763 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:59:05,917 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:59:05,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:05 WrapperNode [2019-01-01 17:59:05,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:59:05,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:59:05,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:59:05,920 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:59:05,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:05" (1/1) ... [2019-01-01 17:59:05,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:05" (1/1) ... [2019-01-01 17:59:05,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:05" (1/1) ... [2019-01-01 17:59:05,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:05" (1/1) ... [2019-01-01 17:59:05,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:05" (1/1) ... [2019-01-01 17:59:05,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:05" (1/1) ... [2019-01-01 17:59:06,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:05" (1/1) ... [2019-01-01 17:59:06,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:59:06,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:59:06,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:59:06,007 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:59:06,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:59:06,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:59:06,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:59:06,072 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-01-01 17:59:06,072 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:59:06,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 17:59:06,072 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:59:06,072 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:59:06,072 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:59:06,073 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:59:06,073 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:59:06,073 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:59:06,073 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:59:06,073 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:59:06,073 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:59:06,073 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:59:06,074 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:59:06,074 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:59:06,074 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:59:06,074 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:59:06,074 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:59:06,074 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:59:06,074 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:59:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:59:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:59:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:59:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:59:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:59:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:59:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:59:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:59:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:59:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:59:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:59:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:59:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:59:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:59:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:59:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:59:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:59:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:59:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:59:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:59:06,077 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:59:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:59:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:59:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:59:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:59:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:59:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:59:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:59:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:59:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:59:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:59:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:59:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:59:06,080 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:59:06,080 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:59:06,080 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:59:06,080 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:59:06,080 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:59:06,080 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:59:06,081 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:59:06,081 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:59:06,081 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:59:06,081 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:59:06,081 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:59:06,081 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:59:06,082 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:59:06,082 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:59:06,082 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-01 17:59:06,082 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:59:06,082 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:59:06,082 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:59:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:59:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:59:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:59:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:59:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:59:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:59:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:59:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:59:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:59:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:59:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:59:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:59:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:59:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:59:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:59:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:59:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:59:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:59:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:59:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:59:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:59:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:59:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:59:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:59:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:59:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:59:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:59:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:59:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:59:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:59:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:59:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:59:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:59:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:59:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-01-01 17:59:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 17:59:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 17:59:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 17:59:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:59:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:59:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-01 17:59:06,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:59:06,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:59:06,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:59:06,989 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:59:06,990 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-01 17:59:06,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:59:06 BoogieIcfgContainer [2019-01-01 17:59:06,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:59:06,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:59:06,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:59:06,996 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:59:06,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:59:05" (1/3) ... [2019-01-01 17:59:06,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c53d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:59:06, skipping insertion in model container [2019-01-01 17:59:06,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:05" (2/3) ... [2019-01-01 17:59:06,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c53d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:59:06, skipping insertion in model container [2019-01-01 17:59:06,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:59:06" (3/3) ... [2019-01-01 17:59:07,001 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2019-01-01 17:59:07,013 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:59:07,024 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2019-01-01 17:59:07,043 INFO L257 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2019-01-01 17:59:07,073 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:59:07,073 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:59:07,074 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:59:07,074 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:59:07,074 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:59:07,075 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:59:07,075 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:59:07,075 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:59:07,075 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:59:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2019-01-01 17:59:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:59:07,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:07,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:07,126 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-01 17:59:07,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:07,133 INFO L82 PathProgramCache]: Analyzing trace with hash 483918089, now seen corresponding path program 1 times [2019-01-01 17:59:07,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:07,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:07,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:07,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:07,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:07,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:07,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:59:07,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:59:07,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:59:07,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:59:07,538 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 5 states. [2019-01-01 17:59:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:08,528 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2019-01-01 17:59:08,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:59:08,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-01 17:59:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:08,542 INFO L225 Difference]: With dead ends: 126 [2019-01-01 17:59:08,543 INFO L226 Difference]: Without dead ends: 123 [2019-01-01 17:59:08,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:59:08,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-01 17:59:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 102. [2019-01-01 17:59:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-01 17:59:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2019-01-01 17:59:08,596 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 9 [2019-01-01 17:59:08,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:08,597 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2019-01-01 17:59:08,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:59:08,597 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2019-01-01 17:59:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:59:08,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:08,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:08,599 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-01 17:59:08,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:08,599 INFO L82 PathProgramCache]: Analyzing trace with hash 483918090, now seen corresponding path program 1 times [2019-01-01 17:59:08,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:08,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:08,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:08,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:08,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:08,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:08,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:08,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:59:08,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:59:08,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:59:08,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:59:08,932 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 5 states. [2019-01-01 17:59:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:09,218 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-01-01 17:59:09,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:59:09,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-01 17:59:09,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:09,224 INFO L225 Difference]: With dead ends: 101 [2019-01-01 17:59:09,224 INFO L226 Difference]: Without dead ends: 101 [2019-01-01 17:59:09,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:59:09,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-01 17:59:09,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-01-01 17:59:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-01 17:59:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-01-01 17:59:09,237 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 9 [2019-01-01 17:59:09,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:09,237 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-01-01 17:59:09,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:59:09,237 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-01-01 17:59:09,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:59:09,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:09,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:09,239 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-01 17:59:09,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:09,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2116558944, now seen corresponding path program 1 times [2019-01-01 17:59:09,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:09,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:09,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:09,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:09,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:09,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:09,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:09,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:59:09,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:59:09,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:59:09,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:59:09,291 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 3 states. [2019-01-01 17:59:09,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:09,421 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2019-01-01 17:59:09,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:59:09,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:59:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:09,424 INFO L225 Difference]: With dead ends: 93 [2019-01-01 17:59:09,425 INFO L226 Difference]: Without dead ends: 93 [2019-01-01 17:59:09,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:59:09,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-01 17:59:09,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-01 17:59:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-01 17:59:09,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2019-01-01 17:59:09,438 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 10 [2019-01-01 17:59:09,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:09,438 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2019-01-01 17:59:09,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:59:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2019-01-01 17:59:09,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:59:09,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:09,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:09,441 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-01 17:59:09,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:09,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2116558945, now seen corresponding path program 1 times [2019-01-01 17:59:09,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:09,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:09,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:09,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:09,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:09,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:59:09,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:59:09,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:59:09,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:59:09,560 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 3 states. [2019-01-01 17:59:09,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:09,662 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-01-01 17:59:09,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:59:09,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:59:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:09,664 INFO L225 Difference]: With dead ends: 89 [2019-01-01 17:59:09,664 INFO L226 Difference]: Without dead ends: 89 [2019-01-01 17:59:09,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:59:09,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-01 17:59:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-01 17:59:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-01 17:59:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2019-01-01 17:59:09,673 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 10 [2019-01-01 17:59:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:09,673 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2019-01-01 17:59:09,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:59:09,674 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2019-01-01 17:59:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 17:59:09,674 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:09,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:09,675 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-01 17:59:09,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:09,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1578128564, now seen corresponding path program 1 times [2019-01-01 17:59:09,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:09,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:09,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:09,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:09,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:09,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:09,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 17:59:09,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:59:09,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:59:09,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:59:09,909 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 8 states. [2019-01-01 17:59:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:10,246 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2019-01-01 17:59:10,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 17:59:10,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-01 17:59:10,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:10,249 INFO L225 Difference]: With dead ends: 100 [2019-01-01 17:59:10,250 INFO L226 Difference]: Without dead ends: 100 [2019-01-01 17:59:10,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-01-01 17:59:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-01 17:59:10,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2019-01-01 17:59:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-01 17:59:10,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2019-01-01 17:59:10,260 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 15 [2019-01-01 17:59:10,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:10,261 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2019-01-01 17:59:10,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:59:10,261 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2019-01-01 17:59:10,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:59:10,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:10,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:10,262 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-01 17:59:10,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:10,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1677623365, now seen corresponding path program 1 times [2019-01-01 17:59:10,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:10,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:10,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:10,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:10,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:10,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:10,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:59:10,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:59:10,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:59:10,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:59:10,402 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 6 states. [2019-01-01 17:59:10,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:10,742 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-01-01 17:59:10,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:59:10,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-01-01 17:59:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:10,745 INFO L225 Difference]: With dead ends: 95 [2019-01-01 17:59:10,746 INFO L226 Difference]: Without dead ends: 95 [2019-01-01 17:59:10,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:59:10,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-01 17:59:10,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2019-01-01 17:59:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-01 17:59:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2019-01-01 17:59:10,768 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 16 [2019-01-01 17:59:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:10,769 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2019-01-01 17:59:10,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:59:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2019-01-01 17:59:10,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 17:59:10,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:10,770 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, 1, 1, 1] [2019-01-01 17:59:10,771 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-01 17:59:10,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:10,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1052744250, now seen corresponding path program 1 times [2019-01-01 17:59:10,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:10,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:10,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:10,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:10,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:11,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:11,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:11,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:59:11,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:59:11,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:59:11,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:59:11,080 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 7 states. [2019-01-01 17:59:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:11,369 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-01-01 17:59:11,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:59:11,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-01-01 17:59:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:11,372 INFO L225 Difference]: With dead ends: 108 [2019-01-01 17:59:11,372 INFO L226 Difference]: Without dead ends: 108 [2019-01-01 17:59:11,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:59:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-01 17:59:11,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2019-01-01 17:59:11,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-01 17:59:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2019-01-01 17:59:11,379 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 25 [2019-01-01 17:59:11,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:11,381 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2019-01-01 17:59:11,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:59:11,381 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2019-01-01 17:59:11,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 17:59:11,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:11,383 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, 1, 1, 1] [2019-01-01 17:59:11,383 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-01 17:59:11,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:11,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1052744251, now seen corresponding path program 1 times [2019-01-01 17:59:11,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:11,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:11,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:11,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:11,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:11,617 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-01 17:59:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:11,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:11,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:59:11,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:59:11,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:59:11,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:59:11,720 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 7 states. [2019-01-01 17:59:11,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:11,945 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2019-01-01 17:59:11,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:59:11,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-01-01 17:59:11,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:11,948 INFO L225 Difference]: With dead ends: 102 [2019-01-01 17:59:11,949 INFO L226 Difference]: Without dead ends: 102 [2019-01-01 17:59:11,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:59:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-01 17:59:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 91. [2019-01-01 17:59:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-01 17:59:11,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2019-01-01 17:59:11,954 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 25 [2019-01-01 17:59:11,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:11,954 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2019-01-01 17:59:11,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:59:11,955 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2019-01-01 17:59:11,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 17:59:11,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:11,956 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, 1, 1, 1] [2019-01-01 17:59:11,956 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-01 17:59:11,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:11,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1052730316, now seen corresponding path program 1 times [2019-01-01 17:59:11,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:11,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:11,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:11,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:11,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:12,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:12,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:59:12,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:59:12,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:59:12,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:59:12,030 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 3 states. [2019-01-01 17:59:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:12,114 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2019-01-01 17:59:12,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:59:12,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-01 17:59:12,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:12,116 INFO L225 Difference]: With dead ends: 74 [2019-01-01 17:59:12,116 INFO L226 Difference]: Without dead ends: 74 [2019-01-01 17:59:12,116 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 [2019-01-01 17:59:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-01 17:59:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-01 17:59:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-01 17:59:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2019-01-01 17:59:12,121 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2019-01-01 17:59:12,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:12,122 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2019-01-01 17:59:12,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:59:12,122 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2019-01-01 17:59:12,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 17:59:12,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:12,124 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, 1, 1, 1] [2019-01-01 17:59:12,124 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-01 17:59:12,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:12,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1053966446, now seen corresponding path program 1 times [2019-01-01 17:59:12,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:12,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:12,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:12,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:12,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:12,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:12,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:59:12,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:59:12,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:59:12,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:59:12,277 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 4 states. [2019-01-01 17:59:12,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:12,352 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-01 17:59:12,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:59:12,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-01-01 17:59:12,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:12,354 INFO L225 Difference]: With dead ends: 70 [2019-01-01 17:59:12,354 INFO L226 Difference]: Without dead ends: 70 [2019-01-01 17:59:12,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:59:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-01 17:59:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-01-01 17:59:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-01 17:59:12,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-01-01 17:59:12,358 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 25 [2019-01-01 17:59:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:12,358 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-01-01 17:59:12,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:59:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-01-01 17:59:12,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 17:59:12,360 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:12,360 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, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:12,360 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-01 17:59:12,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:12,360 INFO L82 PathProgramCache]: Analyzing trace with hash 452771287, now seen corresponding path program 1 times [2019-01-01 17:59:12,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:12,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:12,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:12,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:12,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:12,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:12,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:59:12,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:59:12,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:59:12,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:59:12,849 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 6 states. [2019-01-01 17:59:13,132 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 17:59:13,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:13,357 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-01-01 17:59:13,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:59:13,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-01 17:59:13,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:13,360 INFO L225 Difference]: With dead ends: 68 [2019-01-01 17:59:13,360 INFO L226 Difference]: Without dead ends: 68 [2019-01-01 17:59:13,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:59:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-01 17:59:13,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-01 17:59:13,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-01 17:59:13,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-01-01 17:59:13,364 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 28 [2019-01-01 17:59:13,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:13,364 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-01-01 17:59:13,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:59:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-01-01 17:59:13,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 17:59:13,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:13,366 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, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:13,366 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-01 17:59:13,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:13,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1151008091, now seen corresponding path program 1 times [2019-01-01 17:59:13,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:13,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:13,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:13,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:13,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:13,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:13,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 17:59:13,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:59:13,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:59:13,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:59:13,489 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 6 states. [2019-01-01 17:59:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:13,854 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-01 17:59:13,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:59:13,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-01-01 17:59:13,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:13,857 INFO L225 Difference]: With dead ends: 67 [2019-01-01 17:59:13,857 INFO L226 Difference]: Without dead ends: 67 [2019-01-01 17:59:13,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:59:13,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-01 17:59:13,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-01 17:59:13,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-01 17:59:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-01-01 17:59:13,861 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 29 [2019-01-01 17:59:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:13,862 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-01-01 17:59:13,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:59:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-01-01 17:59:13,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 17:59:13,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:13,863 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:13,864 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-01 17:59:13,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:13,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1342664407, now seen corresponding path program 1 times [2019-01-01 17:59:13,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:13,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:13,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:13,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:13,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:14,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:59:14,251 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 [2019-01-01 17:59:14,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:14,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:14,479 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 [2019-01-01 17:59:14,485 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 [2019-01-01 17:59:14,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:14,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:14,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:14,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-01-01 17:59:14,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2019-01-01 17:59:14,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:14,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:14,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-01-01 17:59:14,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2019-01-01 17:59:14,861 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 26 treesize of output 25 [2019-01-01 17:59:14,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:14,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:14,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:14,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-01-01 17:59:15,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2019-01-01 17:59:15,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2019-01-01 17:59:15,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:15,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:15,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:15,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2019-01-01 17:59:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:15,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:59:15,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2019-01-01 17:59:15,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 17:59:15,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 17:59:15,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-01-01 17:59:15,146 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 17 states. [2019-01-01 17:59:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:16,334 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-01-01 17:59:16,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 17:59:16,336 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-01 17:59:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:16,337 INFO L225 Difference]: With dead ends: 73 [2019-01-01 17:59:16,338 INFO L226 Difference]: Without dead ends: 73 [2019-01-01 17:59:16,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2019-01-01 17:59:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-01 17:59:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-01-01 17:59:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-01 17:59:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-01-01 17:59:16,342 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 30 [2019-01-01 17:59:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:16,342 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-01-01 17:59:16,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 17:59:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-01-01 17:59:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 17:59:16,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:16,344 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:16,344 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-01 17:59:16,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:16,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1342664406, now seen corresponding path program 1 times [2019-01-01 17:59:16,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:16,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:16,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:16,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:16,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:16,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 17:59:16,655 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 [2019-01-01 17:59:16,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:16,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:16,762 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 [2019-01-01 17:59:16,765 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 [2019-01-01 17:59:16,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:16,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:16,791 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 [2019-01-01 17:59:16,796 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 [2019-01-01 17:59:16,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:16,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:16,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:16,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2019-01-01 17:59:16,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:16,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:16,876 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 15 treesize of output 8 [2019-01-01 17:59:16,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:16,917 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 16 treesize of output 23 [2019-01-01 17:59:16,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:16,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:16,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2019-01-01 17:59:17,086 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2019-01-01 17:59:17,106 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 24 treesize of output 23 [2019-01-01 17:59:17,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:17,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:17,183 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2019-01-01 17:59:17,192 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2019-01-01 17:59:17,194 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:17,225 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 30 treesize of output 29 [2019-01-01 17:59:17,225 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:17,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:17,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:17,266 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2019-01-01 17:59:17,370 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 1 case distinctions, treesize of input 36 treesize of output 34 [2019-01-01 17:59:17,388 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 30 treesize of output 23 [2019-01-01 17:59:17,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:17,423 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 23 treesize of output 14 [2019-01-01 17:59:17,424 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:17,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-01-01 17:59:17,454 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:17,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:17,495 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 1 case distinctions, treesize of input 26 treesize of output 26 [2019-01-01 17:59:17,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2019-01-01 17:59:17,501 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:17,515 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:17,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:17,530 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2019-01-01 17:59:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:17,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:59:17,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2019-01-01 17:59:17,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 17:59:17,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 17:59:17,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2019-01-01 17:59:17,594 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 17 states. [2019-01-01 17:59:18,201 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-01-01 17:59:18,915 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-01-01 17:59:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:19,209 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-01-01 17:59:19,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 17:59:19,211 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-01 17:59:19,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:19,212 INFO L225 Difference]: With dead ends: 72 [2019-01-01 17:59:19,212 INFO L226 Difference]: Without dead ends: 72 [2019-01-01 17:59:19,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=105, Invalid=446, Unknown=1, NotChecked=0, Total=552 [2019-01-01 17:59:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-01 17:59:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-01-01 17:59:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-01 17:59:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-01 17:59:19,215 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 30 [2019-01-01 17:59:19,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:19,216 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-01 17:59:19,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 17:59:19,216 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-01 17:59:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 17:59:19,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:19,217 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:19,219 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-01 17:59:19,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:19,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1321512537, now seen corresponding path program 1 times [2019-01-01 17:59:19,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:19,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:19,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:19,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:19,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:19,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:19,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:59:19,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:59:19,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:59:19,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:59:19,342 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 5 states. [2019-01-01 17:59:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:19,440 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-01-01 17:59:19,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:59:19,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-01 17:59:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:19,443 INFO L225 Difference]: With dead ends: 69 [2019-01-01 17:59:19,443 INFO L226 Difference]: Without dead ends: 69 [2019-01-01 17:59:19,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:59:19,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-01 17:59:19,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-01 17:59:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-01 17:59:19,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-01-01 17:59:19,449 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 30 [2019-01-01 17:59:19,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:19,449 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-01-01 17:59:19,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:59:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-01-01 17:59:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 17:59:19,450 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:19,453 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:19,453 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-01 17:59:19,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:19,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1982784226, now seen corresponding path program 1 times [2019-01-01 17:59:19,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:19,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:19,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:19,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:19,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:19,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:19,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:59:19,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:59:19,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:59:19,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:59:19,653 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 8 states. [2019-01-01 17:59:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:19,848 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-01-01 17:59:19,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:59:19,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-01-01 17:59:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:19,851 INFO L225 Difference]: With dead ends: 66 [2019-01-01 17:59:19,851 INFO L226 Difference]: Without dead ends: 66 [2019-01-01 17:59:19,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-01 17:59:19,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-01 17:59:19,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-01 17:59:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-01 17:59:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-01-01 17:59:19,854 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 31 [2019-01-01 17:59:19,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:19,854 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-01-01 17:59:19,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:59:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-01-01 17:59:19,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 17:59:19,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:19,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:19,856 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION]=== [2019-01-01 17:59:19,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:19,856 INFO L82 PathProgramCache]: Analyzing trace with hash -743527608, now seen corresponding path program 1 times [2019-01-01 17:59:19,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:59:19,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:59:19,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:19,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:19,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:59:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 17:59:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 17:59:19,952 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 17:59:19,974 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-01 17:59:19,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:59:19 BoogieIcfgContainer [2019-01-01 17:59:19,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:59:19,998 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:59:19,999 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:59:20,000 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:59:20,001 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:59:06" (3/4) ... [2019-01-01 17:59:20,006 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 17:59:20,006 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:59:20,007 INFO L168 Benchmark]: Toolchain (without parser) took 14790.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 283.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. [2019-01-01 17:59:20,009 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. [2019-01-01 17:59:20,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-01-01 17:59:20,011 INFO L168 Benchmark]: Boogie Preprocessor took 87.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 17:59:20,011 INFO L168 Benchmark]: RCFGBuilder took 984.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. [2019-01-01 17:59:20,012 INFO L168 Benchmark]: TraceAbstraction took 13006.60 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -101.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 11.5 GB. [2019-01-01 17:59:20,014 INFO L168 Benchmark]: Witness Printer took 7.60 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:59:20,019 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 699.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 984.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13006.60 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -101.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 11.5 GB. * Witness Printer took 7.60 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 635]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 635. Possible FailurePath: [L620] int c = 0; VAL [\old(c)=10, c=0] [L637] struct item *list = ((void *)0); [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={-1:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={-1:0}] [L627] c++ [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L629] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L629] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L630] EXPR item->next VAL [\old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={2:0}, \old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={2:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L630-L632] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={2:0}, \old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={2:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L633] *plist = item VAL [\old(c)=0, c=1, item={1:0}, malloc(sizeof *item)={2:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L640] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={-1:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={-1:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={-1:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={-1:0}] [L647] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={-1:0}] [L647] EXPR list->next VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={-1:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={-1:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={-1:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={-1:0}, next={0:0}] [L648] free(list) [L649] list = next VAL [\old(c)=0, c=1, length=1, list={-1:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={-1:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={-1:0}, next={0:0}] [L658] return 0; [L637] struct item *list = ((void *)0); [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 44 error locations. UNSAFE Result, 12.9s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 868 SDtfs, 813 SDslu, 2338 SDs, 0 SdLazy, 2147 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=1, 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, 16 MinimizatonAttempts, 64 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 442 NumberOfCodeBlocks, 442 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 389 ConstructedInterpolants, 11 QuantifiedInterpolants, 81202 SizeOfPredicates, 35 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2019-01-01 17:59:22,281 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:59:22,283 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:59:22,307 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:59:22,307 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:59:22,309 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:59:22,310 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:59:22,312 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:59:22,314 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:59:22,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:59:22,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:59:22,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:59:22,317 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:59:22,318 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:59:22,320 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:59:22,321 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:59:22,321 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:59:22,324 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:59:22,326 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:59:22,328 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:59:22,329 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:59:22,330 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:59:22,333 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:59:22,333 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:59:22,334 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:59:22,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:59:22,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:59:22,337 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:59:22,338 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:59:22,339 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:59:22,339 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:59:22,341 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:59:22,341 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:59:22,341 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:59:22,343 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:59:22,343 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:59:22,344 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-01 17:59:22,361 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:59:22,362 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:59:22,367 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:59:22,367 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:59:22,367 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:59:22,367 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:59:22,368 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:59:22,368 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:59:22,368 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:59:22,368 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:59:22,368 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:59:22,369 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:59:22,369 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:59:22,370 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:59:22,370 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:59:22,370 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-01 17:59:22,370 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-01 17:59:22,370 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:59:22,370 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:59:22,371 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:59:22,371 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:59:22,371 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:59:22,371 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:59:22,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:59:22,373 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:59:22,373 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:59:22,373 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-01 17:59:22,373 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:59:22,373 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-01 17:59:22,374 INFO L133 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd0b9292151174331f3cf63e5ad3d651d29dfbcc [2019-01-01 17:59:22,429 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:59:22,444 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:59:22,450 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:59:22,452 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:59:22,453 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:59:22,453 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2019-01-01 17:59:22,520 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f257135/36829ba827ea4e88ad49cbb19bf5d06d/FLAG6a38c67bb [2019-01-01 17:59:23,043 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:59:23,044 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2019-01-01 17:59:23,059 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f257135/36829ba827ea4e88ad49cbb19bf5d06d/FLAG6a38c67bb [2019-01-01 17:59:23,307 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f257135/36829ba827ea4e88ad49cbb19bf5d06d [2019-01-01 17:59:23,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:59:23,312 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:59:23,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:59:23,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:59:23,317 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:59:23,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:59:23" (1/1) ... [2019-01-01 17:59:23,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556facdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:23, skipping insertion in model container [2019-01-01 17:59:23,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:59:23" (1/1) ... [2019-01-01 17:59:23,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:59:23,379 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:59:23,700 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:59:23,713 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:59:23,863 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:59:23,934 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:59:23,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:23 WrapperNode [2019-01-01 17:59:23,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:59:23,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:59:23,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:59:23,935 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:59:23,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:23" (1/1) ... [2019-01-01 17:59:23,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:23" (1/1) ... [2019-01-01 17:59:23,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:23" (1/1) ... [2019-01-01 17:59:23,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:23" (1/1) ... [2019-01-01 17:59:23,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:23" (1/1) ... [2019-01-01 17:59:24,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:23" (1/1) ... [2019-01-01 17:59:24,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:23" (1/1) ... [2019-01-01 17:59:24,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:59:24,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:59:24,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:59:24,014 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:59:24,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:59:24,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:59:24,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:59:24,075 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-01-01 17:59:24,076 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:59:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 17:59:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:59:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:59:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:59:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:59:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:59:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:59:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:59:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:59:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:59:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:59:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:59:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:59:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:59:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:59:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:59:24,079 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:59:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:59:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:59:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:59:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:59:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:59:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:59:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:59:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:59:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:59:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:59:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:59:24,083 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:59:24,083 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:59:24,083 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:59:24,083 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:59:24,083 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:59:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:59:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:59:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:59:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:59:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:59:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:59:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:59:24,085 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:59:24,085 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:59:24,085 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:59:24,085 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:59:24,085 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:59:24,085 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:59:24,085 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:59:24,085 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:59:24,086 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:59:24,088 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:59:24,088 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:59:24,088 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:59:24,088 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:59:24,088 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:59:24,089 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:59:24,089 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:59:24,089 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:59:24,089 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:59:24,089 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:59:24,089 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:59:24,089 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:59:24,090 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:59:24,090 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:59:24,090 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:59:24,090 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:59:24,090 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-01 17:59:24,090 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:59:24,090 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:59:24,091 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:59:24,093 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:59:24,093 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:59:24,093 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:59:24,093 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:59:24,093 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:59:24,094 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:59:24,094 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:59:24,094 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:59:24,095 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:59:24,095 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:59:24,095 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:59:24,095 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:59:24,095 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:59:24,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:59:24,095 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:59:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:59:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:59:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:59:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:59:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:59:24,097 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:59:24,098 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:59:24,098 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:59:24,098 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:59:24,099 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:59:24,099 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:59:24,099 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:59:24,099 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:59:24,099 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:59:24,099 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:59:24,099 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:59:24,099 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:59:24,100 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:59:24,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:59:24,101 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-01-01 17:59:24,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 17:59:24,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 17:59:24,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 17:59:24,102 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:59:24,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 17:59:24,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-01 17:59:24,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:59:24,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:59:24,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:59:25,200 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:59:25,201 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-01 17:59:25,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:59:25 BoogieIcfgContainer [2019-01-01 17:59:25,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:59:25,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:59:25,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:59:25,207 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:59:25,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:59:23" (1/3) ... [2019-01-01 17:59:25,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10275566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:59:25, skipping insertion in model container [2019-01-01 17:59:25,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:59:23" (2/3) ... [2019-01-01 17:59:25,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10275566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:59:25, skipping insertion in model container [2019-01-01 17:59:25,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:59:25" (3/3) ... [2019-01-01 17:59:25,213 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2019-01-01 17:59:25,225 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:59:25,237 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2019-01-01 17:59:25,257 INFO L257 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2019-01-01 17:59:25,286 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:59:25,287 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:59:25,287 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:59:25,287 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:59:25,288 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:59:25,288 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:59:25,288 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:59:25,289 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:59:25,289 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:59:25,310 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-01-01 17:59:25,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:59:25,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:25,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:25,326 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-01 17:59:25,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:25,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2033148409, now seen corresponding path program 1 times [2019-01-01 17:59:25,339 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:25,340 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:25,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:25,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:25,485 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 [2019-01-01 17:59:25,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:25,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:25,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 17:59:25,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:25,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:25,620 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 19 treesize of output 23 [2019-01-01 17:59:25,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:25,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:25,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-01-01 17:59:25,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:25,909 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:25,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:25,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:59:25,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:59:25,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:59:25,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:59:25,948 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 5 states. [2019-01-01 17:59:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:27,246 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2019-01-01 17:59:27,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:59:27,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-01 17:59:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:27,262 INFO L225 Difference]: With dead ends: 94 [2019-01-01 17:59:27,262 INFO L226 Difference]: Without dead ends: 91 [2019-01-01 17:59:27,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:59:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-01 17:59:27,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-01-01 17:59:27,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-01 17:59:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2019-01-01 17:59:27,312 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 9 [2019-01-01 17:59:27,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:27,313 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2019-01-01 17:59:27,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:59:27,313 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2019-01-01 17:59:27,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:59:27,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:27,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:27,314 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-01 17:59:27,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:27,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2033148408, now seen corresponding path program 1 times [2019-01-01 17:59:27,317 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:27,317 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:27,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:27,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:27,416 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 [2019-01-01 17:59:27,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:27,431 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 [2019-01-01 17:59:27,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:27,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:27,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-01 17:59:27,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:27,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:27,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-01 17:59:27,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:27,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:27,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:27,640 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 13 treesize of output 4 [2019-01-01 17:59:27,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:27,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:27,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-01-01 17:59:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:27,685 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:27,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:27,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:59:27,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:59:27,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:59:27,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:59:27,690 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 5 states. [2019-01-01 17:59:28,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:28,447 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2019-01-01 17:59:28,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:59:28,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-01 17:59:28,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:28,454 INFO L225 Difference]: With dead ends: 120 [2019-01-01 17:59:28,454 INFO L226 Difference]: Without dead ends: 120 [2019-01-01 17:59:28,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:59:28,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-01 17:59:28,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 99. [2019-01-01 17:59:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-01 17:59:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2019-01-01 17:59:28,468 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 9 [2019-01-01 17:59:28,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:28,468 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2019-01-01 17:59:28,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:59:28,468 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2019-01-01 17:59:28,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:59:28,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:28,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:28,470 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-01 17:59:28,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:28,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1396908833, now seen corresponding path program 1 times [2019-01-01 17:59:28,472 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:28,472 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:28,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:28,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:28,562 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 [2019-01-01 17:59:28,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:28,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:28,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 17:59:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:28,606 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:28,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:28,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:59:28,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:59:28,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:59:28,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:59:28,612 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 3 states. [2019-01-01 17:59:28,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:28,764 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-01-01 17:59:28,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:59:28,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:59:28,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:28,766 INFO L225 Difference]: With dead ends: 95 [2019-01-01 17:59:28,766 INFO L226 Difference]: Without dead ends: 95 [2019-01-01 17:59:28,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:59:28,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-01 17:59:28,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-01 17:59:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-01 17:59:28,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2019-01-01 17:59:28,778 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 10 [2019-01-01 17:59:28,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:28,779 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2019-01-01 17:59:28,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:59:28,779 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2019-01-01 17:59:28,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 17:59:28,779 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:28,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:28,781 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-01 17:59:28,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:28,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1396908834, now seen corresponding path program 1 times [2019-01-01 17:59:28,783 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:28,783 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:28,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:28,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:28,895 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 [2019-01-01 17:59:28,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:28,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:28,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 17:59:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:28,918 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:28,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:28,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:59:28,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:59:28,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:59:28,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:59:28,923 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand 3 states. [2019-01-01 17:59:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:29,091 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-01-01 17:59:29,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:59:29,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 17:59:29,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:29,093 INFO L225 Difference]: With dead ends: 91 [2019-01-01 17:59:29,094 INFO L226 Difference]: Without dead ends: 91 [2019-01-01 17:59:29,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:59:29,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-01 17:59:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-01 17:59:29,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-01 17:59:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2019-01-01 17:59:29,103 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 10 [2019-01-01 17:59:29,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:29,104 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2019-01-01 17:59:29,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:59:29,104 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2019-01-01 17:59:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 17:59:29,104 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:29,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:29,105 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-01 17:59:29,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:29,106 INFO L82 PathProgramCache]: Analyzing trace with hash 886002386, now seen corresponding path program 1 times [2019-01-01 17:59:29,106 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:29,106 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:29,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:29,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:29,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2019-01-01 17:59:29,382 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 24 treesize of output 23 [2019-01-01 17:59:29,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2019-01-01 17:59:29,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-01-01 17:59:29,520 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,573 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 20 treesize of output 19 [2019-01-01 17:59:29,573 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,594 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:29,615 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2019-01-01 17:59:29,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-01-01 17:59:29,834 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 22 treesize of output 15 [2019-01-01 17:59:29,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,907 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 15 treesize of output 8 [2019-01-01 17:59:29,908 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2019-01-01 17:59:29,944 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:29,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-01-01 17:59:30,001 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 22 treesize of output 15 [2019-01-01 17:59:30,002 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:30,027 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 15 treesize of output 8 [2019-01-01 17:59:30,027 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:30,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2019-01-01 17:59:30,065 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:30,072 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:30,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:30,078 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2019-01-01 17:59:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:30,102 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:30,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:30,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 17:59:30,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:59:30,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:59:30,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=38, Unknown=5, NotChecked=0, Total=56 [2019-01-01 17:59:30,108 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 8 states. [2019-01-01 17:59:31,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:31,024 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-01-01 17:59:31,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 17:59:31,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-01 17:59:31,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:31,026 INFO L225 Difference]: With dead ends: 99 [2019-01-01 17:59:31,026 INFO L226 Difference]: Without dead ends: 99 [2019-01-01 17:59:31,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=97, Unknown=13, NotChecked=0, Total=156 [2019-01-01 17:59:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-01 17:59:31,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-01-01 17:59:31,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-01 17:59:31,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2019-01-01 17:59:31,038 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 15 [2019-01-01 17:59:31,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:31,038 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2019-01-01 17:59:31,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:59:31,038 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2019-01-01 17:59:31,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:59:31,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:31,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:31,040 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-01 17:59:31,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:31,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1696548326, now seen corresponding path program 1 times [2019-01-01 17:59:31,042 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:31,042 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:31,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:31,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:31,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:31,283 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 14 treesize of output 17 [2019-01-01 17:59:31,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:31,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:31,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:31,335 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 [2019-01-01 17:59:31,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:31,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:31,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-01-01 17:59:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:31,387 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:31,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:31,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:59:31,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:59:31,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:59:31,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:59:31,392 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 7 states. [2019-01-01 17:59:32,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:32,072 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-01-01 17:59:32,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:59:32,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-01 17:59:32,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:32,075 INFO L225 Difference]: With dead ends: 99 [2019-01-01 17:59:32,075 INFO L226 Difference]: Without dead ends: 99 [2019-01-01 17:59:32,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:59:32,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-01 17:59:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-01 17:59:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-01 17:59:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2019-01-01 17:59:32,088 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 16 [2019-01-01 17:59:32,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:32,088 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2019-01-01 17:59:32,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:59:32,089 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2019-01-01 17:59:32,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 17:59:32,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:32,091 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, 1, 1] [2019-01-01 17:59:32,091 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-01 17:59:32,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:32,091 INFO L82 PathProgramCache]: Analyzing trace with hash -874828193, now seen corresponding path program 1 times [2019-01-01 17:59:32,093 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:32,093 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:32,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:32,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:32,396 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 [2019-01-01 17:59:32,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:32,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:32,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-01-01 17:59:32,428 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 [2019-01-01 17:59:32,432 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 [2019-01-01 17:59:32,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:32,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:32,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:32,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-01 17:59:32,476 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 19 treesize of output 15 [2019-01-01 17:59:32,478 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 15 treesize of output 7 [2019-01-01 17:59:32,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:32,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:32,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:32,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-01-01 17:59:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:32,495 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:32,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:32,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:59:32,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:59:32,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:59:32,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:59:32,505 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 8 states. [2019-01-01 17:59:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:33,124 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2019-01-01 17:59:33,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 17:59:33,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-01-01 17:59:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:33,126 INFO L225 Difference]: With dead ends: 115 [2019-01-01 17:59:33,126 INFO L226 Difference]: Without dead ends: 115 [2019-01-01 17:59:33,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-01-01 17:59:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-01 17:59:33,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2019-01-01 17:59:33,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-01 17:59:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2019-01-01 17:59:33,135 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 24 [2019-01-01 17:59:33,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:33,136 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2019-01-01 17:59:33,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:59:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2019-01-01 17:59:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 17:59:33,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:33,137 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, 1, 1] [2019-01-01 17:59:33,139 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-01 17:59:33,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:33,139 INFO L82 PathProgramCache]: Analyzing trace with hash -874828192, now seen corresponding path program 1 times [2019-01-01 17:59:33,139 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:33,139 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:33,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:33,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:33,342 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 [2019-01-01 17:59:33,348 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 [2019-01-01 17:59:33,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:33,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:33,376 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 [2019-01-01 17:59:33,383 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 [2019-01-01 17:59:33,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:33,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:33,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:33,402 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2019-01-01 17:59:33,456 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 15 treesize of output 11 [2019-01-01 17:59:33,461 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 [2019-01-01 17:59:33,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:33,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:33,481 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 17 treesize of output 13 [2019-01-01 17:59:33,485 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 13 treesize of output 5 [2019-01-01 17:59:33,485 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:33,488 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:33,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:33,496 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-01-01 17:59:33,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:33,522 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:33,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:33,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 17:59:33,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 17:59:33,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 17:59:33,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:59:33,525 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 8 states. [2019-01-01 17:59:34,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:34,131 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-01-01 17:59:34,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:59:34,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-01-01 17:59:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:34,134 INFO L225 Difference]: With dead ends: 110 [2019-01-01 17:59:34,135 INFO L226 Difference]: Without dead ends: 110 [2019-01-01 17:59:34,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-01 17:59:34,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-01 17:59:34,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2019-01-01 17:59:34,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-01 17:59:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-01-01 17:59:34,144 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 24 [2019-01-01 17:59:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:34,144 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-01-01 17:59:34,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 17:59:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-01-01 17:59:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 17:59:34,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:34,145 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, 1, 1] [2019-01-01 17:59:34,147 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-01 17:59:34,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:34,147 INFO L82 PathProgramCache]: Analyzing trace with hash -874842127, now seen corresponding path program 1 times [2019-01-01 17:59:34,147 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:34,147 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:34,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:34,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:34,275 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:34,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:34,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:59:34,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 17:59:34,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 17:59:34,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:59:34,279 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 4 states. [2019-01-01 17:59:34,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:34,347 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2019-01-01 17:59:34,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 17:59:34,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-01-01 17:59:34,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:34,350 INFO L225 Difference]: With dead ends: 122 [2019-01-01 17:59:34,350 INFO L226 Difference]: Without dead ends: 122 [2019-01-01 17:59:34,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 17:59:34,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-01 17:59:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2019-01-01 17:59:34,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-01 17:59:34,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2019-01-01 17:59:34,357 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 24 [2019-01-01 17:59:34,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:34,358 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2019-01-01 17:59:34,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 17:59:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2019-01-01 17:59:34,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 17:59:34,359 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:34,359 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, 1, 1, 1, 1, 1] [2019-01-01 17:59:34,360 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-01 17:59:34,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:34,361 INFO L82 PathProgramCache]: Analyzing trace with hash -145131599, now seen corresponding path program 1 times [2019-01-01 17:59:34,361 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:34,361 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:34,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:34,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:34,516 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 [2019-01-01 17:59:34,519 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 [2019-01-01 17:59:34,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:34,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:34,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:34,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-01-01 17:59:34,557 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 15 treesize of output 11 [2019-01-01 17:59:34,578 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 [2019-01-01 17:59:34,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:34,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:34,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:34,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-01 17:59:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:34,739 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:34,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:34,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:59:34,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:59:34,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:59:34,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:59:34,742 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 7 states. [2019-01-01 17:59:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:35,054 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2019-01-01 17:59:35,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:59:35,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-01-01 17:59:35,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:35,056 INFO L225 Difference]: With dead ends: 123 [2019-01-01 17:59:35,056 INFO L226 Difference]: Without dead ends: 123 [2019-01-01 17:59:35,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:59:35,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-01 17:59:35,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2019-01-01 17:59:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-01 17:59:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2019-01-01 17:59:35,061 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 27 [2019-01-01 17:59:35,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:35,061 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2019-01-01 17:59:35,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:59:35,062 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2019-01-01 17:59:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 17:59:35,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:35,064 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, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:35,064 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-01 17:59:35,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:35,065 INFO L82 PathProgramCache]: Analyzing trace with hash -204112192, now seen corresponding path program 1 times [2019-01-01 17:59:35,065 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:35,065 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:35,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:35,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:35,284 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 [2019-01-01 17:59:35,289 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 [2019-01-01 17:59:35,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:35,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:35,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:35,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-01 17:59:35,349 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 15 treesize of output 11 [2019-01-01 17:59:35,357 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 [2019-01-01 17:59:35,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:35,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:35,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:35,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-01 17:59:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:35,377 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 17:59:35,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:59:35,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:59:35,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:59:35,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:59:35,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:59:35,381 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 7 states. [2019-01-01 17:59:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:35,961 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2019-01-01 17:59:35,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 17:59:35,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-01-01 17:59:35,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:35,964 INFO L225 Difference]: With dead ends: 122 [2019-01-01 17:59:35,964 INFO L226 Difference]: Without dead ends: 122 [2019-01-01 17:59:35,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 17:59:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-01 17:59:35,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2019-01-01 17:59:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-01 17:59:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2019-01-01 17:59:35,969 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 28 [2019-01-01 17:59:35,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:35,969 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2019-01-01 17:59:35,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:59:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2019-01-01 17:59:35,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 17:59:35,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:35,972 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:35,972 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-01 17:59:35,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:35,974 INFO L82 PathProgramCache]: Analyzing trace with hash -401720221, now seen corresponding path program 1 times [2019-01-01 17:59:35,974 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:35,975 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:35,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:36,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:36,196 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 [2019-01-01 17:59:36,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:36,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:36,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-01-01 17:59:36,234 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 [2019-01-01 17:59:36,238 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 [2019-01-01 17:59:36,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:36,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:36,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:36,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-01 17:59:36,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-01 17:59:36,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:36,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:36,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2019-01-01 17:59:36,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2019-01-01 17:59:36,431 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 28 treesize of output 27 [2019-01-01 17:59:36,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:36,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:36,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:36,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2019-01-01 17:59:36,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2019-01-01 17:59:36,557 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 26 treesize of output 19 [2019-01-01 17:59:36,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:36,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-01-01 17:59:36,587 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:36,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:36,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:36,612 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2019-01-01 17:59:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:36,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-01 17:59:37,002 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 11 treesize of output 9 [2019-01-01 17:59:37,005 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2019-01-01 17:59:37,006 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:37,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:37,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-01 17:59:37,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:50 [2019-01-01 17:59:37,151 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2019-01-01 17:59:37,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,179 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2019-01-01 17:59:37,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:59:37,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2019-01-01 17:59:37,206 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 10 treesize of output 3 [2019-01-01 17:59:37,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,209 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 10 treesize of output 3 [2019-01-01 17:59:37,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:37,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 17:59:37,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-01-01 17:59:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:37,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:59:37,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-01-01 17:59:37,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 17:59:37,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 17:59:37,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-01-01 17:59:37,232 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand 17 states. [2019-01-01 17:59:37,919 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-01-01 17:59:38,612 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-01-01 17:59:40,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:59:40,367 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2019-01-01 17:59:40,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 17:59:40,368 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-01-01 17:59:40,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:59:40,370 INFO L225 Difference]: With dead ends: 127 [2019-01-01 17:59:40,370 INFO L226 Difference]: Without dead ends: 127 [2019-01-01 17:59:40,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-01-01 17:59:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-01 17:59:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2019-01-01 17:59:40,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 17:59:40,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-01-01 17:59:40,375 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 29 [2019-01-01 17:59:40,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:59:40,375 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-01-01 17:59:40,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 17:59:40,375 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-01-01 17:59:40,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 17:59:40,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:59:40,377 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:59:40,378 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-01 17:59:40,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:59:40,378 INFO L82 PathProgramCache]: Analyzing trace with hash -401720220, now seen corresponding path program 1 times [2019-01-01 17:59:40,378 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 17:59:40,379 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 17:59:40,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:59:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:59:40,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 17:59:40,591 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 [2019-01-01 17:59:40,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:40,615 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 [2019-01-01 17:59:40,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:40,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:40,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2019-01-01 17:59:40,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:40,664 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 12 treesize of output 15 [2019-01-01 17:59:40,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:40,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:40,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:40,698 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 [2019-01-01 17:59:40,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:40,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:40,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2019-01-01 17:59:40,838 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 [2019-01-01 17:59:40,845 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 [2019-01-01 17:59:40,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:40,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:41,049 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 [2019-01-01 17:59:41,053 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 8 treesize of output 7 [2019-01-01 17:59:41,053 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:41,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:41,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:41,077 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:41 [2019-01-01 17:59:41,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:41,232 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 21 treesize of output 36 [2019-01-01 17:59:41,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:41,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:41,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 17:59:41,268 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 15 treesize of output 8 [2019-01-01 17:59:41,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:41,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:41,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:46 [2019-01-01 17:59:41,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2019-01-01 17:59:41,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-01-01 17:59:41,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:41,517 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 20 treesize of output 19 [2019-01-01 17:59:41,518 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:41,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:41,695 INFO L303 Elim1Store]: Index analysis took 127 ms [2019-01-01 17:59:41,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2019-01-01 17:59:41,852 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 34 treesize of output 33 [2019-01-01 17:59:41,853 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:41,928 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:41,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:41,955 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2019-01-01 17:59:42,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-01-01 17:59:42,070 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 22 treesize of output 15 [2019-01-01 17:59:42,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:42,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2019-01-01 17:59:42,108 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:42,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:42,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2019-01-01 17:59:42,210 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 30 treesize of output 23 [2019-01-01 17:59:42,210 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:42,260 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 23 treesize of output 14 [2019-01-01 17:59:42,262 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:42,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-01-01 17:59:42,482 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:42,498 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:42,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:42,511 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:68, output treesize:20 [2019-01-01 17:59:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:42,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-01 17:59:44,407 WARN L181 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-01-01 17:59:44,413 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 25 treesize of output 21 [2019-01-01 17:59:44,417 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-01 17:59:44,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:44,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:44,432 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 25 treesize of output 21 [2019-01-01 17:59:44,441 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-01 17:59:44,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:44,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:44,459 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 29 treesize of output 25 [2019-01-01 17:59:44,464 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-01 17:59:44,466 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:44,476 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:44,735 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 19 treesize of output 17 [2019-01-01 17:59:44,754 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-01-01 17:59:44,769 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:44,839 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:44,854 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 19 treesize of output 17 [2019-01-01 17:59:44,868 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-01-01 17:59:44,874 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:44,880 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 17:59:45,057 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 28 treesize of output 26 [2019-01-01 17:59:45,062 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2019-01-01 17:59:45,063 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:45,082 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:45,086 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 28 treesize of output 26 [2019-01-01 17:59:45,091 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2019-01-01 17:59:45,091 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:45,118 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:45,300 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 24 treesize of output 22 [2019-01-01 17:59:45,305 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-01-01 17:59:45,306 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:45,324 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:45,330 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 24 treesize of output 22 [2019-01-01 17:59:45,334 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-01-01 17:59:45,335 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:45,353 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 17:59:45,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 13 dim-0 vars, and 9 xjuncts. [2019-01-01 17:59:45,549 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2019-01-01 17:59:46,052 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2019-01-01 17:59:46,066 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:59:46,067 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:59:46,068 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 26 treesize of output 17 [2019-01-01 17:59:46,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:46,190 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:59:46,191 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:59:46,191 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 23 treesize of output 14 [2019-01-01 17:59:46,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:46,314 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:59:46,315 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:59:46,316 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 20 treesize of output 11 [2019-01-01 17:59:46,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:46,429 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:59:46,430 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:59:46,431 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 18 treesize of output 9 [2019-01-01 17:59:46,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:46,538 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:59:46,539 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 17:59:46,541 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 16 treesize of output 7 [2019-01-01 17:59:46,541 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 17:59:46,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 5 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2019-01-01 17:59:46,645 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 12 variables, input treesize:104, output treesize:47 [2019-01-01 17:59:47,025 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2019-01-01 17:59:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:59:47,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 17:59:47,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2019-01-01 17:59:47,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-01 17:59:47,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 17:59:47,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-01-01 17:59:47,280 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 21 states. [2019-01-01 17:59:48,498 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-01-01 17:59:48,871 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2019-01-01 17:59:49,092 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2019-01-01 17:59:49,557 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 50 [2019-01-01 17:59:58,128 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-01-01 18:00:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:00:03,827 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2019-01-01 18:00:03,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 18:00:03,829 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-01-01 18:00:03,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:00:03,830 INFO L225 Difference]: With dead ends: 148 [2019-01-01 18:00:03,830 INFO L226 Difference]: Without dead ends: 148 [2019-01-01 18:00:03,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2019-01-01 18:00:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-01 18:00:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 108. [2019-01-01 18:00:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 18:00:03,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2019-01-01 18:00:03,837 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 29 [2019-01-01 18:00:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:00:03,837 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2019-01-01 18:00:03,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-01 18:00:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2019-01-01 18:00:03,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-01 18:00:03,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:00:03,840 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, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:00:03,841 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-01 18:00:03,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:00:03,841 INFO L82 PathProgramCache]: Analyzing trace with hash -2032510573, now seen corresponding path program 1 times [2019-01-01 18:00:03,841 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 18:00:03,841 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 18:00:03,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:00:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:00:03,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:00:04,014 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 [2019-01-01 18:00:04,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:04,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:04,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-01-01 18:00:04,054 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 [2019-01-01 18:00:04,066 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 [2019-01-01 18:00:04,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:04,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:04,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:04,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-01 18:00:04,118 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 19 treesize of output 15 [2019-01-01 18:00:04,121 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 15 treesize of output 7 [2019-01-01 18:00:04,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:04,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:04,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:04,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-01-01 18:00:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:00:04,138 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 18:00:04,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:00:04,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 18:00:04,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 18:00:04,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 18:00:04,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 18:00:04,142 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 8 states. [2019-01-01 18:00:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:00:04,693 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2019-01-01 18:00:04,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 18:00:04,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-01-01 18:00:04,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:00:04,696 INFO L225 Difference]: With dead ends: 120 [2019-01-01 18:00:04,696 INFO L226 Difference]: Without dead ends: 120 [2019-01-01 18:00:04,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-01 18:00:04,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-01 18:00:04,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2019-01-01 18:00:04,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-01 18:00:04,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2019-01-01 18:00:04,701 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 29 [2019-01-01 18:00:04,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:00:04,701 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2019-01-01 18:00:04,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 18:00:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2019-01-01 18:00:04,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 18:00:04,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:00:04,702 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:00:04,702 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-01 18:00:04,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:00:04,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1416681763, now seen corresponding path program 1 times [2019-01-01 18:00:04,707 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 18:00:04,707 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 18:00:04,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:00:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:00:04,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:00:04,868 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 [2019-01-01 18:00:04,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:04,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:04,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 18:00:04,927 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 [2019-01-01 18:00:04,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:04,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:04,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2019-01-01 18:00:04,954 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 [2019-01-01 18:00:04,956 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 [2019-01-01 18:00:04,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:04,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:04,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:04,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-01-01 18:00:04,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:04,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:04,993 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 15 treesize of output 8 [2019-01-01 18:00:04,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:05,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:05,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-01-01 18:00:05,025 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 16 treesize of output 12 [2019-01-01 18:00:05,027 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 12 treesize of output 4 [2019-01-01 18:00:05,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:05,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:05,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:00:05,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2019-01-01 18:00:05,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:00:05,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-01 18:00:05,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:00:05,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 18:00:05,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-01-01 18:00:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:00:05,097 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (16)] Exception during sending of exit command (exit): Broken pipe [2019-01-01 18:00:05,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:00:05,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 18:00:05,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 18:00:05,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 18:00:05,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-01 18:00:05,102 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 9 states. [2019-01-01 18:00:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:00:09,870 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2019-01-01 18:00:09,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 18:00:09,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-01-01 18:00:09,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:00:09,872 INFO L225 Difference]: With dead ends: 139 [2019-01-01 18:00:09,873 INFO L226 Difference]: Without dead ends: 139 [2019-01-01 18:00:09,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-01 18:00:09,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-01 18:00:09,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 112. [2019-01-01 18:00:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-01 18:00:09,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2019-01-01 18:00:09,880 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 30 [2019-01-01 18:00:09,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:00:09,881 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2019-01-01 18:00:09,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 18:00:09,881 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2019-01-01 18:00:09,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 18:00:09,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:00:09,881 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:00:09,885 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-01 18:00:09,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:00:09,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1416681764, now seen corresponding path program 1 times [2019-01-01 18:00:09,886 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 18:00:09,886 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 18:00:09,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:00:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:00:09,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:00:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:00:10,025 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-01 18:00:10,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:00:10,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 18:00:10,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 18:00:10,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 18:00:10,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:00:10,029 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 3 states. [2019-01-01 18:00:10,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:00:10,221 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-01-01 18:00:10,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 18:00:10,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-01-01 18:00:10,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:00:10,224 INFO L225 Difference]: With dead ends: 107 [2019-01-01 18:00:10,224 INFO L226 Difference]: Without dead ends: 107 [2019-01-01 18:00:10,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:00:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-01 18:00:10,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2019-01-01 18:00:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-01 18:00:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2019-01-01 18:00:10,228 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 30 [2019-01-01 18:00:10,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:00:10,228 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2019-01-01 18:00:10,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 18:00:10,229 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2019-01-01 18:00:10,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 18:00:10,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:00:10,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:00:10,230 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-01 18:00:10,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:00:10,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1873386355, now seen corresponding path program 1 times [2019-01-01 18:00:10,231 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-01 18:00:10,231 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 18:00:10,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:00:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 18:00:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 18:00:10,699 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 18:00:10,701 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-01 18:00:10,750 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-01 18:00:10,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 06:00:10 BoogieIcfgContainer [2019-01-01 18:00:10,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 18:00:10,813 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 18:00:10,813 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 18:00:10,814 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 18:00:10,814 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:59:25" (3/4) ... [2019-01-01 18:00:10,825 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 18:00:10,826 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 18:00:10,827 INFO L168 Benchmark]: Toolchain (without parser) took 47515.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.0 MB). Free memory was 952.7 MB in the beginning and 955.4 MB in the end (delta: -2.7 MB). Peak memory consumption was 310.3 MB. Max. memory is 11.5 GB. [2019-01-01 18:00:10,828 INFO L168 Benchmark]: CDTParser took 0.17 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. [2019-01-01 18:00:10,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 621.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-01-01 18:00:10,832 INFO L168 Benchmark]: Boogie Preprocessor took 77.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 18:00:10,832 INFO L168 Benchmark]: RCFGBuilder took 1188.22 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: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. [2019-01-01 18:00:10,833 INFO L168 Benchmark]: TraceAbstraction took 45610.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 955.4 MB in the end (delta: 117.1 MB). Peak memory consumption was 279.1 MB. Max. memory is 11.5 GB. [2019-01-01 18:00:10,833 INFO L168 Benchmark]: Witness Printer took 12.52 ms. Allocated memory is still 1.3 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 18:00:10,835 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 621.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1188.22 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: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45610.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 955.4 MB in the end (delta: 117.1 MB). Peak memory consumption was 279.1 MB. Max. memory is 11.5 GB. * Witness Printer took 12.52 ms. Allocated memory is still 1.3 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 635]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 635. Possible FailurePath: [L620] int c = 0; VAL [\old(c)=0, c=0] [L637] struct item *list = ((void *)0); [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={-2147483647:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={-2147483647:0}] [L627] c++ [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={-1359732046:0}, malloc(sizeof *item)={-1359732046:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L629] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-1359732046:0}, malloc(sizeof *item)={-1359732046:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L629] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-1359732046:0}, malloc(sizeof *item)={-1359732046:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L630] EXPR item->next VAL [\old(c)=0, c=1, item={-1359732046:0}, item->next={0:0}, malloc(sizeof *item)={-1359732046:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2146435072:0}, \old(c)=0, c=1, item={-1359732046:0}, item->next={0:0}, malloc(sizeof *item)={-1359732046:0}, malloc(sizeof *item)={-2146435072:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L630-L632] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2146435072:0}, \old(c)=0, c=1, item={-1359732046:0}, item->next={0:0}, malloc(sizeof *item)={-1359732046:0}, malloc(sizeof *item)={-2146435072:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L633] *plist = item VAL [\old(c)=0, c=1, item={-1359732046:0}, malloc(sizeof *item)={-1359732046:0}, malloc(sizeof *item)={-2146435072:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L640] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={-2147483647:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={-2147483647:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={-2147483647:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={-2147483647:0}] [L647] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-1359732046:0}, c=1, length=1, list={-2147483647:0}] [L647] EXPR list->next VAL [\old(c)=0, \read(*list)={-1359732046:0}, c=1, length=1, list={-2147483647:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-1359732046:0}, c=1, length=1, list={-2147483647:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={-1359732046:0}, c=1, length=1, list={-2147483647:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={-1359732046:0}, c=1, length=1, list={-2147483647:0}, next={0:0}] [L648] free(list) [L649] list = next VAL [\old(c)=0, c=1, length=1, list={-2147483647:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={-2147483647:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={-2147483647:0}, next={0:0}] [L658] return 0; [L637] struct item *list = ((void *)0); [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 44 error locations. UNSAFE Result, 45.5s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 31.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 918 SDtfs, 1314 SDslu, 2771 SDs, 0 SdLazy, 3039 SolverSat, 155 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 26.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 427 GetRequests, 290 SyntacticMatches, 4 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=9, 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, 16 MinimizatonAttempts, 185 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 377 NumberOfCodeBlocks, 377 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 383 ConstructedInterpolants, 46 QuantifiedInterpolants, 117797 SizeOfPredicates, 126 NumberOfNonLiveVariables, 1756 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...