./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3589167bbf5d7f5cd80f4f92aa27b7dbe19a0217 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:19:26,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:19:26,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:19:26,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:19:26,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:19:26,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:19:26,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:19:26,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:19:26,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:19:26,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:19:26,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:19:26,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:19:26,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:19:26,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:19:26,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:19:26,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:19:26,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:19:26,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:19:26,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:19:26,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:19:26,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:19:27,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:19:27,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:19:27,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:19:27,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:19:27,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:19:27,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:19:27,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:19:27,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:19:27,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:19:27,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:19:27,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:19:27,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:19:27,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:19:27,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:19:27,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:19:27,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:19:27,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:19:27,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:19:27,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:19:27,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:19:27,013 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2020-10-20 06:19:27,035 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:19:27,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:19:27,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:19:27,037 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:19:27,037 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:19:27,037 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:19:27,037 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 06:19:27,038 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:19:27,038 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:19:27,038 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 06:19:27,038 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:19:27,038 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-10-20 06:19:27,038 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-10-20 06:19:27,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 06:19:27,039 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-10-20 06:19:27,042 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 06:19:27,042 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:19:27,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:19:27,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:19:27,043 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 06:19:27,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 06:19:27,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 06:19:27,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:19:27,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 06:19:27,044 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:19:27,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 06:19:27,044 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:19:27,045 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3589167bbf5d7f5cd80f4f92aa27b7dbe19a0217 [2020-10-20 06:19:27,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:19:27,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:19:27,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:19:27,274 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:19:27,274 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:19:27,275 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i [2020-10-20 06:19:27,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f9fe19f/48269e59054c4916a553feaf47b232b9/FLAG918aa13e7 [2020-10-20 06:19:27,888 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:19:27,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i [2020-10-20 06:19:27,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f9fe19f/48269e59054c4916a553feaf47b232b9/FLAG918aa13e7 [2020-10-20 06:19:28,212 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f9fe19f/48269e59054c4916a553feaf47b232b9 [2020-10-20 06:19:28,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:19:28,223 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-20 06:19:28,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:19:28,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:19:28,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:19:28,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:19:28" (1/1) ... [2020-10-20 06:19:28,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b34fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28, skipping insertion in model container [2020-10-20 06:19:28,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:19:28" (1/1) ... [2020-10-20 06:19:28,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:19:28,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:19:28,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:19:28,674 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:19:28,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:19:28,781 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:19:28,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28 WrapperNode [2020-10-20 06:19:28,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:19:28,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:19:28,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:19:28,784 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:19:28,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28" (1/1) ... [2020-10-20 06:19:28,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28" (1/1) ... [2020-10-20 06:19:28,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28" (1/1) ... [2020-10-20 06:19:28,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28" (1/1) ... [2020-10-20 06:19:28,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28" (1/1) ... [2020-10-20 06:19:28,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28" (1/1) ... [2020-10-20 06:19:28,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28" (1/1) ... [2020-10-20 06:19:28,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:19:28,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:19:28,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:19:28,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:19:28,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28" (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 [2020-10-20 06:19:28,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-20 06:19:28,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:19:28,929 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-20 06:19:28,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-10-20 06:19:28,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-10-20 06:19:28,929 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-10-20 06:19:28,930 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2020-10-20 06:19:28,930 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2020-10-20 06:19:28,930 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2020-10-20 06:19:28,930 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-20 06:19:28,930 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-20 06:19:28,930 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-20 06:19:28,931 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-20 06:19:28,931 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-20 06:19:28,931 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-20 06:19:28,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:19:28,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-20 06:19:28,931 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-10-20 06:19:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-10-20 06:19:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-10-20 06:19:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-10-20 06:19:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-10-20 06:19:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-10-20 06:19:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-10-20 06:19:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-10-20 06:19:28,933 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-10-20 06:19:28,933 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-10-20 06:19:28,933 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-10-20 06:19:28,933 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-10-20 06:19:28,933 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-10-20 06:19:28,933 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-10-20 06:19:28,934 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-10-20 06:19:28,934 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-10-20 06:19:28,934 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-10-20 06:19:28,934 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-10-20 06:19:28,934 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-10-20 06:19:28,934 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-10-20 06:19:28,934 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-10-20 06:19:28,935 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-10-20 06:19:28,935 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-10-20 06:19:28,935 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-10-20 06:19:28,935 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-10-20 06:19:28,935 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-10-20 06:19:28,935 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-10-20 06:19:28,935 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-10-20 06:19:28,936 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-10-20 06:19:28,936 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-10-20 06:19:28,936 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-10-20 06:19:28,936 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-10-20 06:19:28,936 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-10-20 06:19:28,936 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-10-20 06:19:28,936 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-10-20 06:19:28,937 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-10-20 06:19:28,937 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-10-20 06:19:28,937 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-10-20 06:19:28,937 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-10-20 06:19:28,937 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-10-20 06:19:28,937 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-10-20 06:19:28,937 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-10-20 06:19:28,938 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-10-20 06:19:28,938 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-10-20 06:19:28,938 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-10-20 06:19:28,938 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-10-20 06:19:28,938 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-10-20 06:19:28,938 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-10-20 06:19:28,938 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-10-20 06:19:28,939 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-10-20 06:19:28,939 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-10-20 06:19:28,939 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-10-20 06:19:28,939 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-20 06:19:28,939 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-20 06:19:28,939 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-20 06:19:28,939 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-20 06:19:28,939 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-10-20 06:19:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-10-20 06:19:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-20 06:19:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-10-20 06:19:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-10-20 06:19:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-10-20 06:19:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-10-20 06:19:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-10-20 06:19:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-20 06:19:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-10-20 06:19:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-10-20 06:19:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-10-20 06:19:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-10-20 06:19:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-10-20 06:19:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-10-20 06:19:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-10-20 06:19:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-10-20 06:19:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-10-20 06:19:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-10-20 06:19:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-10-20 06:19:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-10-20 06:19:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-10-20 06:19:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-10-20 06:19:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-10-20 06:19:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-10-20 06:19:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-10-20 06:19:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-10-20 06:19:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-10-20 06:19:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-10-20 06:19:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-10-20 06:19:28,943 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-10-20 06:19:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-10-20 06:19:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-10-20 06:19:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-10-20 06:19:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-10-20 06:19:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-10-20 06:19:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-10-20 06:19:28,944 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-10-20 06:19:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-10-20 06:19:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-10-20 06:19:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-10-20 06:19:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-10-20 06:19:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-10-20 06:19:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-10-20 06:19:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-10-20 06:19:28,945 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-10-20 06:19:28,946 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-10-20 06:19:28,946 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-10-20 06:19:28,946 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-10-20 06:19:28,946 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2020-10-20 06:19:28,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 06:19:28,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 06:19:28,946 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2020-10-20 06:19:28,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 06:19:28,947 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2020-10-20 06:19:28,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:19:28,953 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-20 06:19:28,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-20 06:19:28,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 06:19:28,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:19:28,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:19:28,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:19:29,269 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-10-20 06:19:29,460 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:19:29,460 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-10-20 06:19:29,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:19:29 BoogieIcfgContainer [2020-10-20 06:19:29,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:19:29,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 06:19:29,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 06:19:29,468 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 06:19:29,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 06:19:28" (1/3) ... [2020-10-20 06:19:29,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8394554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 06:19:29, skipping insertion in model container [2020-10-20 06:19:29,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:19:28" (2/3) ... [2020-10-20 06:19:29,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8394554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 06:19:29, skipping insertion in model container [2020-10-20 06:19:29,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:19:29" (3/3) ... [2020-10-20 06:19:29,472 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_length_check-1.i [2020-10-20 06:19:29,484 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 06:19:29,491 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2020-10-20 06:19:29,506 INFO L253 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2020-10-20 06:19:29,527 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 06:19:29,527 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-20 06:19:29,527 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 06:19:29,528 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:19:29,528 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:19:29,528 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 06:19:29,528 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:19:29,529 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 06:19:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2020-10-20 06:19:29,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 06:19:29,558 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:29,559 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:29,560 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:19:29,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:29,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1778924751, now seen corresponding path program 1 times [2020-10-20 06:19:29,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:29,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012407142] [2020-10-20 06:19:29,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:29,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:29,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012407142] [2020-10-20 06:19:29,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:19:29,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:19:29,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463088305] [2020-10-20 06:19:29,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 06:19:29,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:29,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:19:29,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:19:29,852 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2020-10-20 06:19:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:30,045 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2020-10-20 06:19:30,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:19:30,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-20 06:19:30,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:30,063 INFO L225 Difference]: With dead ends: 87 [2020-10-20 06:19:30,063 INFO L226 Difference]: Without dead ends: 78 [2020-10-20 06:19:30,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:19:30,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-20 06:19:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2020-10-20 06:19:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-20 06:19:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2020-10-20 06:19:30,174 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 12 [2020-10-20 06:19:30,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:30,175 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2020-10-20 06:19:30,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 06:19:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2020-10-20 06:19:30,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 06:19:30,176 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:30,176 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:30,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 06:19:30,177 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:19:30,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:30,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1591559482, now seen corresponding path program 1 times [2020-10-20 06:19:30,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:30,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261690358] [2020-10-20 06:19:30,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:30,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:30,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261690358] [2020-10-20 06:19:30,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:19:30,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 06:19:30,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793360040] [2020-10-20 06:19:30,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 06:19:30,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:30,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:19:30,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:19:30,344 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 5 states. [2020-10-20 06:19:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:30,719 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2020-10-20 06:19:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:19:30,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-20 06:19:30,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:30,723 INFO L225 Difference]: With dead ends: 97 [2020-10-20 06:19:30,723 INFO L226 Difference]: Without dead ends: 97 [2020-10-20 06:19:30,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:19:30,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-20 06:19:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 69. [2020-10-20 06:19:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-20 06:19:30,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2020-10-20 06:19:30,743 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 14 [2020-10-20 06:19:30,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:30,743 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2020-10-20 06:19:30,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 06:19:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2020-10-20 06:19:30,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 06:19:30,744 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:30,744 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:30,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 06:19:30,745 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:19:30,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:30,746 INFO L82 PathProgramCache]: Analyzing trace with hash -183447880, now seen corresponding path program 1 times [2020-10-20 06:19:30,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:30,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484007978] [2020-10-20 06:19:30,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:30,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:30,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:30,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484007978] [2020-10-20 06:19:30,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:19:30,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:19:30,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599914030] [2020-10-20 06:19:30,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 06:19:30,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:30,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:19:30,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:19:30,828 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand 4 states. [2020-10-20 06:19:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:31,011 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2020-10-20 06:19:31,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:19:31,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-20 06:19:31,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:31,013 INFO L225 Difference]: With dead ends: 79 [2020-10-20 06:19:31,013 INFO L226 Difference]: Without dead ends: 79 [2020-10-20 06:19:31,014 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:19:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-20 06:19:31,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2020-10-20 06:19:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-20 06:19:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2020-10-20 06:19:31,023 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 14 [2020-10-20 06:19:31,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:31,024 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2020-10-20 06:19:31,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 06:19:31,024 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2020-10-20 06:19:31,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 06:19:31,025 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:31,025 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:31,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 06:19:31,026 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:19:31,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:31,026 INFO L82 PathProgramCache]: Analyzing trace with hash -183447879, now seen corresponding path program 1 times [2020-10-20 06:19:31,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:31,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224399551] [2020-10-20 06:19:31,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:31,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:31,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224399551] [2020-10-20 06:19:31,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:19:31,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:19:31,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718258470] [2020-10-20 06:19:31,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 06:19:31,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:31,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:19:31,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:19:31,115 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 4 states. [2020-10-20 06:19:31,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:31,283 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2020-10-20 06:19:31,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:19:31,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-20 06:19:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:31,285 INFO L225 Difference]: With dead ends: 78 [2020-10-20 06:19:31,285 INFO L226 Difference]: Without dead ends: 78 [2020-10-20 06:19:31,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:19:31,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-20 06:19:31,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2020-10-20 06:19:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-20 06:19:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2020-10-20 06:19:31,294 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 14 [2020-10-20 06:19:31,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:31,295 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2020-10-20 06:19:31,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 06:19:31,295 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2020-10-20 06:19:31,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 06:19:31,296 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:31,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:31,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 06:19:31,297 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:19:31,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:31,297 INFO L82 PathProgramCache]: Analyzing trace with hash 116018533, now seen corresponding path program 1 times [2020-10-20 06:19:31,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:31,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520444049] [2020-10-20 06:19:31,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:31,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:31,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 06:19:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:31,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:31,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520444049] [2020-10-20 06:19:31,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:19:31,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 06:19:31,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262268908] [2020-10-20 06:19:31,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 06:19:31,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:31,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 06:19:31,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:19:31,515 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 10 states. [2020-10-20 06:19:32,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:32,143 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2020-10-20 06:19:32,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 06:19:32,144 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-20 06:19:32,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:32,145 INFO L225 Difference]: With dead ends: 89 [2020-10-20 06:19:32,145 INFO L226 Difference]: Without dead ends: 89 [2020-10-20 06:19:32,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-20 06:19:32,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-20 06:19:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2020-10-20 06:19:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-20 06:19:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2020-10-20 06:19:32,153 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 20 [2020-10-20 06:19:32,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:32,154 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2020-10-20 06:19:32,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 06:19:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2020-10-20 06:19:32,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 06:19:32,155 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:32,155 INFO L422 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] [2020-10-20 06:19:32,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 06:19:32,155 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:19:32,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:32,156 INFO L82 PathProgramCache]: Analyzing trace with hash -498946436, now seen corresponding path program 1 times [2020-10-20 06:19:32,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:32,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972568341] [2020-10-20 06:19:32,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:32,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:32,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 06:19:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:32,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972568341] [2020-10-20 06:19:32,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:19:32,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 06:19:32,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293659602] [2020-10-20 06:19:32,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 06:19:32,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:32,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:19:32,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:19:32,308 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 11 states. [2020-10-20 06:19:32,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:32,920 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2020-10-20 06:19:32,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:19:32,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-10-20 06:19:32,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:32,924 INFO L225 Difference]: With dead ends: 95 [2020-10-20 06:19:32,924 INFO L226 Difference]: Without dead ends: 95 [2020-10-20 06:19:32,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-10-20 06:19:32,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-20 06:19:32,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 74. [2020-10-20 06:19:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-20 06:19:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2020-10-20 06:19:32,945 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 24 [2020-10-20 06:19:32,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:32,946 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2020-10-20 06:19:32,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 06:19:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2020-10-20 06:19:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 06:19:32,947 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:32,947 INFO L422 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] [2020-10-20 06:19:32,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 06:19:32,948 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:19:32,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:32,952 INFO L82 PathProgramCache]: Analyzing trace with hash -498946435, now seen corresponding path program 1 times [2020-10-20 06:19:32,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:32,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700742629] [2020-10-20 06:19:32,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:33,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:33,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 06:19:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:33,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700742629] [2020-10-20 06:19:33,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297001625] [2020-10-20 06:19:33,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:33,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:19:33,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:19:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:33,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:19:33,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2020-10-20 06:19:33,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815321486] [2020-10-20 06:19:33,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 06:19:33,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:33,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 06:19:33,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:19:33,316 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 10 states. [2020-10-20 06:19:33,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:33,738 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2020-10-20 06:19:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 06:19:33,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-20 06:19:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:33,744 INFO L225 Difference]: With dead ends: 95 [2020-10-20 06:19:33,744 INFO L226 Difference]: Without dead ends: 89 [2020-10-20 06:19:33,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2020-10-20 06:19:33,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-20 06:19:33,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2020-10-20 06:19:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-20 06:19:33,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2020-10-20 06:19:33,752 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 24 [2020-10-20 06:19:33,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:33,752 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2020-10-20 06:19:33,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 06:19:33,753 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2020-10-20 06:19:33,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-20 06:19:33,754 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:33,754 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:33,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-20 06:19:33,961 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:19:33,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:33,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1446597612, now seen corresponding path program 2 times [2020-10-20 06:19:33,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:33,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105956632] [2020-10-20 06:19:33,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:34,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:34,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 06:19:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:34,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105956632] [2020-10-20 06:19:34,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43196293] [2020-10-20 06:19:34,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:34,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:19:34,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:19:34,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:19:34,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:19:34,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:34,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:19:34,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2020-10-20 06:19:34,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806567808] [2020-10-20 06:19:34,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 06:19:34,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:34,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:19:34,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:19:34,302 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 11 states. [2020-10-20 06:19:34,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:34,747 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2020-10-20 06:19:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 06:19:34,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-10-20 06:19:34,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:34,749 INFO L225 Difference]: With dead ends: 96 [2020-10-20 06:19:34,749 INFO L226 Difference]: Without dead ends: 93 [2020-10-20 06:19:34,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-20 06:19:34,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-20 06:19:34,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 66. [2020-10-20 06:19:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-20 06:19:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2020-10-20 06:19:34,755 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 28 [2020-10-20 06:19:34,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:34,755 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2020-10-20 06:19:34,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 06:19:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2020-10-20 06:19:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-20 06:19:34,756 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:34,757 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:34,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:34,958 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:19:34,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:34,958 INFO L82 PathProgramCache]: Analyzing trace with hash -313260501, now seen corresponding path program 3 times [2020-10-20 06:19:34,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:34,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189954158] [2020-10-20 06:19:34,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:35,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:35,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 06:19:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 06:19:35,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189954158] [2020-10-20 06:19:35,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:19:35,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 06:19:35,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210490871] [2020-10-20 06:19:35,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 06:19:35,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:35,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:19:35,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:19:35,133 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 11 states. [2020-10-20 06:19:35,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:35,666 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2020-10-20 06:19:35,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:19:35,667 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2020-10-20 06:19:35,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:35,669 INFO L225 Difference]: With dead ends: 83 [2020-10-20 06:19:35,669 INFO L226 Difference]: Without dead ends: 83 [2020-10-20 06:19:35,670 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-10-20 06:19:35,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-20 06:19:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2020-10-20 06:19:35,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-20 06:19:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2020-10-20 06:19:35,682 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 32 [2020-10-20 06:19:35,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:35,682 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2020-10-20 06:19:35,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 06:19:35,683 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2020-10-20 06:19:35,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 06:19:35,684 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:35,684 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:35,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 06:19:35,684 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:19:35,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:35,685 INFO L82 PathProgramCache]: Analyzing trace with hash 620341838, now seen corresponding path program 1 times [2020-10-20 06:19:35,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:35,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747387703] [2020-10-20 06:19:35,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:35,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:35,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 06:19:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 06:19:35,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747387703] [2020-10-20 06:19:35,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307698465] [2020-10-20 06:19:35,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:36,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 44 conjunts are in the unsatisfiable core [2020-10-20 06:19:36,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:19:36,121 INFO L384 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 [2020-10-20 06:19:36,121 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:36,124 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:36,125 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:36,125 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-20 06:19:36,157 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:36,157 INFO L384 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-10-20 06:19:36,159 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:36,177 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2020-10-20 06:19:36,178 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:36,178 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2020-10-20 06:19:36,210 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 06:19:36,211 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:36,220 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:36,221 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:36,221 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2020-10-20 06:19:36,577 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 06:19:36,578 INFO L384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-10-20 06:19:36,579 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:36,597 INFO L625 ElimStorePlain]: treesize reduction 3, result has 87.0 percent of original size [2020-10-20 06:19:36,598 INFO L545 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. [2020-10-20 06:19:36,599 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:11 [2020-10-20 06:19:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 06:19:36,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:19:36,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2020-10-20 06:19:36,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506139753] [2020-10-20 06:19:36,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-20 06:19:36,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:36,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-20 06:19:36,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2020-10-20 06:19:36,618 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 24 states. [2020-10-20 06:19:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:37,983 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2020-10-20 06:19:37,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 06:19:37,984 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2020-10-20 06:19:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:37,986 INFO L225 Difference]: With dead ends: 92 [2020-10-20 06:19:37,986 INFO L226 Difference]: Without dead ends: 92 [2020-10-20 06:19:37,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2020-10-20 06:19:37,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-20 06:19:37,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 69. [2020-10-20 06:19:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-20 06:19:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2020-10-20 06:19:37,991 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 35 [2020-10-20 06:19:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:37,992 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2020-10-20 06:19:38,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-20 06:19:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2020-10-20 06:19:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 06:19:38,002 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:38,003 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:38,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-10-20 06:19:38,211 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:19:38,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:38,212 INFO L82 PathProgramCache]: Analyzing trace with hash 620341839, now seen corresponding path program 1 times [2020-10-20 06:19:38,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:38,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513533117] [2020-10-20 06:19:38,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:38,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:38,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 06:19:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 06:19:38,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513533117] [2020-10-20 06:19:38,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645368000] [2020-10-20 06:19:38,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:38,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 47 conjunts are in the unsatisfiable core [2020-10-20 06:19:38,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:19:38,654 INFO L384 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 [2020-10-20 06:19:38,654 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:38,658 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:38,659 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:38,659 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-20 06:19:38,740 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:38,740 INFO L384 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-10-20 06:19:38,742 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:38,762 INFO L625 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2020-10-20 06:19:38,763 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:38,763 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2020-10-20 06:19:38,802 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 06:19:38,803 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:38,824 INFO L625 ElimStorePlain]: treesize reduction 7, result has 83.3 percent of original size [2020-10-20 06:19:38,830 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 06:19:38,830 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:38,840 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:38,841 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:38,842 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:28 [2020-10-20 06:19:39,340 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 06:19:39,341 INFO L384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-10-20 06:19:39,341 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:39,370 INFO L625 ElimStorePlain]: treesize reduction 3, result has 91.9 percent of original size [2020-10-20 06:19:39,374 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 06:19:39,376 INFO L384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-10-20 06:19:39,376 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:39,388 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:39,391 INFO L545 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. [2020-10-20 06:19:39,391 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:14 [2020-10-20 06:19:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 06:19:39,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:19:39,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2020-10-20 06:19:39,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610888912] [2020-10-20 06:19:39,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-10-20 06:19:39,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:39,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-10-20 06:19:39,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2020-10-20 06:19:39,487 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 29 states. [2020-10-20 06:19:40,792 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2020-10-20 06:19:40,963 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2020-10-20 06:19:41,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:41,629 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2020-10-20 06:19:41,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 06:19:41,629 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2020-10-20 06:19:41,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:41,631 INFO L225 Difference]: With dead ends: 89 [2020-10-20 06:19:41,631 INFO L226 Difference]: Without dead ends: 89 [2020-10-20 06:19:41,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=206, Invalid=1516, Unknown=0, NotChecked=0, Total=1722 [2020-10-20 06:19:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-20 06:19:41,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 69. [2020-10-20 06:19:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-20 06:19:41,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2020-10-20 06:19:41,637 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 35 [2020-10-20 06:19:41,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:41,637 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2020-10-20 06:19:41,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-10-20 06:19:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2020-10-20 06:19:41,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-20 06:19:41,639 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:41,639 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:41,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:41,852 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:19:41,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:41,853 INFO L82 PathProgramCache]: Analyzing trace with hash -640556118, now seen corresponding path program 2 times [2020-10-20 06:19:41,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:41,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755483751] [2020-10-20 06:19:41,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:42,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:42,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 06:19:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:42,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755483751] [2020-10-20 06:19:42,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583438329] [2020-10-20 06:19:42,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:42,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:19:42,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:19:42,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 71 conjunts are in the unsatisfiable core [2020-10-20 06:19:42,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:19:42,449 INFO L384 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 [2020-10-20 06:19:42,449 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:42,457 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:42,458 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:42,458 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-10-20 06:19:42,508 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:42,509 INFO L384 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-10-20 06:19:42,510 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:42,528 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2020-10-20 06:19:42,529 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:42,529 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2020-10-20 06:19:42,579 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 06:19:42,579 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:42,587 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:42,588 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:42,589 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2020-10-20 06:19:42,748 INFO L350 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2020-10-20 06:19:42,749 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 89 [2020-10-20 06:19:42,751 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:42,796 INFO L625 ElimStorePlain]: treesize reduction 40, result has 52.4 percent of original size [2020-10-20 06:19:42,797 INFO L545 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. [2020-10-20 06:19:42,798 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:44 [2020-10-20 06:19:42,876 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_10|], 2=[|v_#memory_$Pointer$.base_12|]} [2020-10-20 06:19:42,881 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 06:19:42,881 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:42,907 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:42,916 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2020-10-20 06:19:42,917 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:42,976 INFO L625 ElimStorePlain]: treesize reduction 4, result has 93.4 percent of original size [2020-10-20 06:19:42,979 INFO L545 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. [2020-10-20 06:19:42,979 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:69, output treesize:59 [2020-10-20 06:19:43,606 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 06:19:43,607 INFO L384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-10-20 06:19:43,608 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:43,657 INFO L625 ElimStorePlain]: treesize reduction 3, result has 95.6 percent of original size [2020-10-20 06:19:43,666 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-20 06:19:43,666 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:65 [2020-10-20 06:19:43,940 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 06:19:43,943 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 06:19:43,944 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 06:19:43,956 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:43,957 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 48 [2020-10-20 06:19:43,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:19:43,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:19:43,964 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 06:19:44,012 INFO L625 ElimStorePlain]: treesize reduction 7, result has 85.7 percent of original size [2020-10-20 06:19:44,015 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:19:44,016 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:24 [2020-10-20 06:19:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:44,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:19:44,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2020-10-20 06:19:44,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203623024] [2020-10-20 06:19:44,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-10-20 06:19:44,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:44,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-10-20 06:19:44,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1164, Unknown=0, NotChecked=0, Total=1260 [2020-10-20 06:19:44,229 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 36 states. [2020-10-20 06:19:45,591 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-20 06:19:48,158 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 98 [2020-10-20 06:19:50,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:50,244 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2020-10-20 06:19:50,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-20 06:19:50,245 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 38 [2020-10-20 06:19:50,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:50,246 INFO L225 Difference]: With dead ends: 101 [2020-10-20 06:19:50,246 INFO L226 Difference]: Without dead ends: 101 [2020-10-20 06:19:50,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=318, Invalid=2543, Unknown=1, NotChecked=0, Total=2862 [2020-10-20 06:19:50,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-20 06:19:50,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 72. [2020-10-20 06:19:50,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-20 06:19:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2020-10-20 06:19:50,251 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 38 [2020-10-20 06:19:50,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:50,251 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2020-10-20 06:19:50,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-10-20 06:19:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2020-10-20 06:19:50,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-20 06:19:50,252 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:50,253 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:50,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-10-20 06:19:50,463 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:19:50,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:50,464 INFO L82 PathProgramCache]: Analyzing trace with hash -640556117, now seen corresponding path program 2 times [2020-10-20 06:19:50,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:50,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907207761] [2020-10-20 06:19:50,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:50,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:50,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 06:19:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:51,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907207761] [2020-10-20 06:19:51,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972500086] [2020-10-20 06:19:51,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:51,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:19:51,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:19:51,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 78 conjunts are in the unsatisfiable core [2020-10-20 06:19:51,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:19:51,424 INFO L384 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 [2020-10-20 06:19:51,425 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:51,432 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:51,436 INFO L384 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 [2020-10-20 06:19:51,437 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:51,445 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:51,445 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:51,446 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-10-20 06:19:51,595 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:51,595 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-20 06:19:51,596 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:51,607 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:51,612 INFO L384 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 12 treesize of output 14 [2020-10-20 06:19:51,612 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:51,624 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:51,625 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:51,625 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2020-10-20 06:19:51,689 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 06:19:51,690 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:51,712 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:51,718 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 06:19:51,718 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:51,763 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:51,764 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:19:51,764 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2020-10-20 06:19:51,940 INFO L441 ElimStorePlain]: Different costs {1=[|v_#valid_33|], 3=[|v_#length_22|]} [2020-10-20 06:19:51,953 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:51,953 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-20 06:19:51,954 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:51,980 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:52,002 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:52,003 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 52 [2020-10-20 06:19:52,004 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:52,069 INFO L625 ElimStorePlain]: treesize reduction 26, result has 66.2 percent of original size [2020-10-20 06:19:52,071 INFO L545 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. [2020-10-20 06:19:52,071 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:51 [2020-10-20 06:19:52,200 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-20 06:19:52,200 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:52,241 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:52,248 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2020-10-20 06:19:52,248 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:52,317 INFO L625 ElimStorePlain]: treesize reduction 4, result has 94.1 percent of original size [2020-10-20 06:19:52,320 INFO L545 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. [2020-10-20 06:19:52,320 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:74 [2020-10-20 06:19:53,473 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 06:19:53,475 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 06:19:53,476 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 06:19:53,492 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:53,493 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 62 [2020-10-20 06:19:53,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 06:19:53,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 06:19:53,496 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 06:19:53,568 INFO L625 ElimStorePlain]: treesize reduction 10, result has 87.0 percent of original size [2020-10-20 06:19:53,573 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 06:19:53,578 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:19:53,579 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2020-10-20 06:19:53,579 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:19:53,622 INFO L625 ElimStorePlain]: treesize reduction 5, result has 90.0 percent of original size [2020-10-20 06:19:53,626 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:19:53,627 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:27 [2020-10-20 06:19:53,826 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:19:53,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:19:53,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 38 [2020-10-20 06:19:53,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836856099] [2020-10-20 06:19:53,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-10-20 06:19:53,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:53,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-10-20 06:19:53,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1394, Unknown=0, NotChecked=0, Total=1482 [2020-10-20 06:19:53,829 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 39 states. [2020-10-20 06:19:55,611 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 98 [2020-10-20 06:19:55,853 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2020-10-20 06:19:56,761 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 107 [2020-10-20 06:19:57,134 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 121 [2020-10-20 06:19:57,713 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2020-10-20 06:19:58,063 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 110 [2020-10-20 06:19:58,337 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2020-10-20 06:19:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:59,230 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2020-10-20 06:19:59,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-20 06:19:59,231 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2020-10-20 06:19:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:59,232 INFO L225 Difference]: With dead ends: 98 [2020-10-20 06:19:59,233 INFO L226 Difference]: Without dead ends: 98 [2020-10-20 06:19:59,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=364, Invalid=3176, Unknown=0, NotChecked=0, Total=3540 [2020-10-20 06:19:59,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-20 06:19:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2020-10-20 06:19:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-20 06:19:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2020-10-20 06:19:59,239 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 38 [2020-10-20 06:19:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:59,239 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2020-10-20 06:19:59,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-10-20 06:19:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2020-10-20 06:19:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-20 06:19:59,240 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:59,241 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2020-10-20 06:19:59,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:19:59,450 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:19:59,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:59,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1466607831, now seen corresponding path program 1 times [2020-10-20 06:19:59,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:59,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893970148] [2020-10-20 06:19:59,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:19:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:59,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:19:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:59,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 06:19:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:59,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-20 06:19:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:19:59,578 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 06:19:59,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893970148] [2020-10-20 06:19:59,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:19:59,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-20 06:19:59,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926195260] [2020-10-20 06:19:59,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 06:19:59,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:19:59,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:19:59,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:19:59,581 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 11 states. [2020-10-20 06:19:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:19:59,987 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2020-10-20 06:19:59,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:19:59,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-10-20 06:19:59,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:19:59,989 INFO L225 Difference]: With dead ends: 88 [2020-10-20 06:19:59,989 INFO L226 Difference]: Without dead ends: 85 [2020-10-20 06:19:59,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-10-20 06:19:59,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-20 06:19:59,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2020-10-20 06:19:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-20 06:19:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2020-10-20 06:19:59,994 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 39 [2020-10-20 06:19:59,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:19:59,994 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2020-10-20 06:19:59,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 06:19:59,994 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2020-10-20 06:19:59,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-20 06:19:59,995 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:19:59,995 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:19:59,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 06:19:59,996 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:19:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:19:59,996 INFO L82 PathProgramCache]: Analyzing trace with hash -267592498, now seen corresponding path program 3 times [2020-10-20 06:19:59,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:19:59,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346618225] [2020-10-20 06:19:59,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:20:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:00,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:20:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:00,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 06:20:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:20:00,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346618225] [2020-10-20 06:20:00,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779438885] [2020-10-20 06:20:00,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:20:01,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-20 06:20:01,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:20:01,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 86 conjunts are in the unsatisfiable core [2020-10-20 06:20:01,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:20:01,105 INFO L384 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 [2020-10-20 06:20:01,105 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:20:01,112 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:20:01,112 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:20:01,113 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-10-20 06:20:01,166 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 06:20:01,166 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:20:01,176 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:20:01,180 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 06:20:01,180 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:20:01,190 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:20:01,191 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:20:01,191 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2020-10-20 06:20:01,301 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:20:01,301 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2020-10-20 06:20:01,302 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:20:01,334 INFO L625 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-10-20 06:20:01,334 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:20:01,334 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:35 [2020-10-20 06:20:01,414 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-20 06:20:01,414 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:20:01,441 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:20:01,449 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-20 06:20:01,450 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:20:01,466 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:20:01,467 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:20:01,468 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:58 [2020-10-20 06:20:01,650 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:20:01,650 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-10-20 06:20:01,651 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:20:01,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:20:01,672 INFO L545 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. [2020-10-20 06:20:01,672 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:62 [2020-10-20 06:20:01,790 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 06:20:01,809 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:20:01,809 INFO L384 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 75 [2020-10-20 06:20:01,811 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:20:01,880 INFO L625 ElimStorePlain]: treesize reduction 52, result has 60.6 percent of original size [2020-10-20 06:20:01,885 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2020-10-20 06:20:01,886 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:20:01,912 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:20:01,914 INFO L545 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. [2020-10-20 06:20:01,914 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:84, output treesize:94 [2020-10-20 06:20:03,813 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 06:20:03,816 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 06:20:03,817 INFO L173 IndexEqualityManager]: detected equality via solver [2020-10-20 06:20:03,926 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-10-20 06:20:03,927 INFO L350 Elim1Store]: treesize reduction 16, result has 82.6 percent of original size [2020-10-20 06:20:03,927 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 119 treesize of output 131 [2020-10-20 06:20:03,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-10-20 06:20:03,934 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-10-20 06:20:03,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-20 06:20:03,937 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-10-20 06:20:03,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 06:20:03,939 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-10-20 06:20:03,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-10-20 06:20:03,944 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-10-20 06:20:03,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-20 06:20:03,946 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-10-20 06:20:03,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 06:20:03,947 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-10-20 06:20:03,950 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 06:20:04,054 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2020-10-20 06:20:04,055 INFO L625 ElimStorePlain]: treesize reduction 68, result has 51.8 percent of original size [2020-10-20 06:20:04,071 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:20:04,072 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 35 [2020-10-20 06:20:04,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:20:04,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 06:20:04,076 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 06:20:04,136 INFO L625 ElimStorePlain]: treesize reduction 10, result has 80.0 percent of original size [2020-10-20 06:20:04,139 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:20:04,140 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:151, output treesize:7 [2020-10-20 06:20:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:20:04,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:20:04,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 45 [2020-10-20 06:20:04,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110236335] [2020-10-20 06:20:04,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 45 states [2020-10-20 06:20:04,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:20:04,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2020-10-20 06:20:04,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1886, Unknown=0, NotChecked=0, Total=1980 [2020-10-20 06:20:04,323 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 45 states. [2020-10-20 06:20:06,588 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 102 [2020-10-20 06:20:08,176 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 141 [2020-10-20 06:20:09,351 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-10-20 06:20:10,013 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 119 [2020-10-20 06:20:10,329 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-10-20 06:20:11,222 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 117 [2020-10-20 06:20:11,611 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-10-20 06:20:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:20:13,169 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2020-10-20 06:20:13,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-20 06:20:13,170 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2020-10-20 06:20:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:20:13,171 INFO L225 Difference]: With dead ends: 123 [2020-10-20 06:20:13,172 INFO L226 Difference]: Without dead ends: 123 [2020-10-20 06:20:13,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=330, Invalid=4782, Unknown=0, NotChecked=0, Total=5112 [2020-10-20 06:20:13,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-10-20 06:20:13,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 95. [2020-10-20 06:20:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-20 06:20:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2020-10-20 06:20:13,179 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 41 [2020-10-20 06:20:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:20:13,180 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2020-10-20 06:20:13,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2020-10-20 06:20:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2020-10-20 06:20:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-20 06:20:13,181 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:20:13,181 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2020-10-20 06:20:13,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-10-20 06:20:13,386 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:20:13,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:20:13,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1505329797, now seen corresponding path program 1 times [2020-10-20 06:20:13,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:20:13,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247393545] [2020-10-20 06:20:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:20:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:13,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:20:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:13,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 06:20:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:13,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-20 06:20:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 06:20:13,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247393545] [2020-10-20 06:20:13,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608201271] [2020-10-20 06:20:13,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:20:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:13,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 34 conjunts are in the unsatisfiable core [2020-10-20 06:20:13,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:20:13,817 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-20 06:20:13,817 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:20:13,824 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:20:13,825 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:20:13,825 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2020-10-20 06:20:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 06:20:14,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:20:14,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2020-10-20 06:20:14,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74925935] [2020-10-20 06:20:14,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-20 06:20:14,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:20:14,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-20 06:20:14,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2020-10-20 06:20:14,312 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 26 states. [2020-10-20 06:20:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:20:22,076 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2020-10-20 06:20:22,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-20 06:20:22,077 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2020-10-20 06:20:22,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:20:22,078 INFO L225 Difference]: With dead ends: 114 [2020-10-20 06:20:22,078 INFO L226 Difference]: Without dead ends: 108 [2020-10-20 06:20:22,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=183, Invalid=1377, Unknown=0, NotChecked=0, Total=1560 [2020-10-20 06:20:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-10-20 06:20:22,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2020-10-20 06:20:22,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-20 06:20:22,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2020-10-20 06:20:22,086 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 42 [2020-10-20 06:20:22,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:20:22,086 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2020-10-20 06:20:22,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-20 06:20:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2020-10-20 06:20:22,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-20 06:20:22,088 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:20:22,088 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:20:22,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-10-20 06:20:22,293 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:20:22,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:20:22,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2043365801, now seen corresponding path program 2 times [2020-10-20 06:20:22,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:20:22,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454995958] [2020-10-20 06:20:22,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:20:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:22,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:20:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:22,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 06:20:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:22,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-20 06:20:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:20:22,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454995958] [2020-10-20 06:20:22,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877677368] [2020-10-20 06:20:22,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:20:22,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:20:22,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:20:22,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 06:20:22,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:20:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:20:22,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:20:22,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 10 [2020-10-20 06:20:22,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520786244] [2020-10-20 06:20:22,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 06:20:22,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:20:22,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 06:20:22,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:20:22,662 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 10 states. [2020-10-20 06:20:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:20:23,172 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2020-10-20 06:20:23,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:20:23,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2020-10-20 06:20:23,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:20:23,175 INFO L225 Difference]: With dead ends: 129 [2020-10-20 06:20:23,175 INFO L226 Difference]: Without dead ends: 129 [2020-10-20 06:20:23,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-20 06:20:23,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-10-20 06:20:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2020-10-20 06:20:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-20 06:20:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2020-10-20 06:20:23,182 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 45 [2020-10-20 06:20:23,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:20:23,182 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2020-10-20 06:20:23,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 06:20:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2020-10-20 06:20:23,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-20 06:20:23,183 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:20:23,183 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:20:23,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-10-20 06:20:23,393 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:20:23,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:20:23,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1078371956, now seen corresponding path program 1 times [2020-10-20 06:20:23,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:20:23,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584655138] [2020-10-20 06:20:23,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:20:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:23,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:20:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:23,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 06:20:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:23,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-20 06:20:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:20:23,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584655138] [2020-10-20 06:20:23,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:20:23,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 06:20:23,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261986009] [2020-10-20 06:20:23,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 06:20:23,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:20:23,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:20:23,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:20:23,542 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand 11 states. [2020-10-20 06:20:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:20:24,004 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2020-10-20 06:20:24,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 06:20:24,005 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2020-10-20 06:20:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:20:24,006 INFO L225 Difference]: With dead ends: 122 [2020-10-20 06:20:24,006 INFO L226 Difference]: Without dead ends: 122 [2020-10-20 06:20:24,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-10-20 06:20:24,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-10-20 06:20:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2020-10-20 06:20:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-20 06:20:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2020-10-20 06:20:24,014 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 46 [2020-10-20 06:20:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:20:24,014 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2020-10-20 06:20:24,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 06:20:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2020-10-20 06:20:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-20 06:20:24,015 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:20:24,015 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:20:24,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 06:20:24,015 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:20:24,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:20:24,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1078371955, now seen corresponding path program 1 times [2020-10-20 06:20:24,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:20:24,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680100427] [2020-10-20 06:20:24,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:20:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:24,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:20:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:24,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 06:20:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:24,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-20 06:20:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-20 06:20:24,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680100427] [2020-10-20 06:20:24,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:20:24,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 06:20:24,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526137623] [2020-10-20 06:20:24,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 06:20:24,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:20:24,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:20:24,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:20:24,233 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 11 states. [2020-10-20 06:20:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:20:24,757 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2020-10-20 06:20:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 06:20:24,758 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2020-10-20 06:20:24,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:20:24,760 INFO L225 Difference]: With dead ends: 117 [2020-10-20 06:20:24,760 INFO L226 Difference]: Without dead ends: 117 [2020-10-20 06:20:24,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-10-20 06:20:24,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-20 06:20:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2020-10-20 06:20:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-20 06:20:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2020-10-20 06:20:24,766 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 46 [2020-10-20 06:20:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:20:24,767 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2020-10-20 06:20:24,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 06:20:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2020-10-20 06:20:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-20 06:20:24,768 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:20:24,768 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:20:24,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 06:20:24,768 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:20:24,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:20:24,768 INFO L82 PathProgramCache]: Analyzing trace with hash -579936233, now seen corresponding path program 4 times [2020-10-20 06:20:24,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:20:24,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934729066] [2020-10-20 06:20:24,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:20:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:24,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:20:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:24,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-20 06:20:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:20:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:20:24,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934729066] [2020-10-20 06:20:24,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810532673] [2020-10-20 06:20:24,913 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:20:25,029 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:20:25,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:20:25,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:20:25,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:20:25,063 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:20:25,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:20:25,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2020-10-20 06:20:25,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410383711] [2020-10-20 06:20:25,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 06:20:25,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:20:25,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:20:25,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:20:25,065 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 12 states. [2020-10-20 06:20:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:20:25,502 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2020-10-20 06:20:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 06:20:25,503 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2020-10-20 06:20:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:20:25,505 INFO L225 Difference]: With dead ends: 122 [2020-10-20 06:20:25,505 INFO L226 Difference]: Without dead ends: 122 [2020-10-20 06:20:25,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-20 06:20:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-10-20 06:20:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2020-10-20 06:20:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-20 06:20:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2020-10-20 06:20:25,511 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 45 [2020-10-20 06:20:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:20:25,511 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2020-10-20 06:20:25,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 06:20:25,512 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2020-10-20 06:20:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-20 06:20:25,512 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:20:25,513 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-10-20 06:20:25,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:20:25,719 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, sll_lengthErr1REQUIRES_VIOLATION, sll_lengthErr0REQUIRES_VIOLATION]=== [2020-10-20 06:20:25,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:20:25,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1856012293, now seen corresponding path program 3 times [2020-10-20 06:20:25,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:20:25,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951218415] [2020-10-20 06:20:25,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:20:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:20:25,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:20:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:20:25,758 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:20:25,809 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:20:25,809 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 06:20:25,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 06:20:25,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 06:20:25 BoogieIcfgContainer [2020-10-20 06:20:25,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 06:20:25,875 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:20:25,875 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:20:25,875 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:20:25,876 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:19:29" (3/4) ... [2020-10-20 06:20:25,878 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 06:20:25,941 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:20:25,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:20:25,943 INFO L168 Benchmark]: Toolchain (without parser) took 57726.12 ms. Allocated memory was 35.7 MB in the beginning and 164.6 MB in the end (delta: 129.0 MB). Free memory was 11.0 MB in the beginning and 37.7 MB in the end (delta: -26.7 MB). Peak memory consumption was 102.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:20:25,943 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 33.6 MB. Free memory is still 18.3 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 06:20:25,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 558.70 ms. Allocated memory was 35.7 MB in the beginning and 45.6 MB in the end (delta: 10.0 MB). Free memory was 10.0 MB in the beginning and 27.0 MB in the end (delta: -17.0 MB). Peak memory consumption was 10.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:20:25,944 INFO L168 Benchmark]: Boogie Preprocessor took 67.76 ms. Allocated memory is still 45.6 MB. Free memory was 27.0 MB in the beginning and 24.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:20:25,944 INFO L168 Benchmark]: RCFGBuilder took 611.41 ms. Allocated memory was 45.6 MB in the beginning and 50.3 MB in the end (delta: 4.7 MB). Free memory was 23.9 MB in the beginning and 29.4 MB in the end (delta: -5.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 14.3 GB. [2020-10-20 06:20:25,945 INFO L168 Benchmark]: TraceAbstraction took 56410.31 ms. Allocated memory was 50.3 MB in the beginning and 164.6 MB in the end (delta: 114.3 MB). Free memory was 29.0 MB in the beginning and 43.1 MB in the end (delta: -14.1 MB). Peak memory consumption was 100.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:20:25,945 INFO L168 Benchmark]: Witness Printer took 67.06 ms. Allocated memory is still 164.6 MB. Free memory was 43.1 MB in the beginning and 37.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:20:25,947 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 33.6 MB. Free memory is still 18.3 MB. There was no memory consumed. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 558.70 ms. Allocated memory was 35.7 MB in the beginning and 45.6 MB in the end (delta: 10.0 MB). Free memory was 10.0 MB in the beginning and 27.0 MB in the end (delta: -17.0 MB). Peak memory consumption was 10.2 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 67.76 ms. Allocated memory is still 45.6 MB. Free memory was 27.0 MB in the beginning and 24.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 14.3 GB. * RCFGBuilder took 611.41 ms. Allocated memory was 45.6 MB in the beginning and 50.3 MB in the end (delta: 4.7 MB). Free memory was 23.9 MB in the beginning and 29.4 MB in the end (delta: -5.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 14.3 GB. * TraceAbstraction took 56410.31 ms. Allocated memory was 50.3 MB in the beginning and 164.6 MB in the end (delta: 114.3 MB). Free memory was 29.0 MB in the beginning and 43.1 MB in the end (delta: -14.1 MB). Peak memory consumption was 100.2 MB. Max. memory is 14.3 GB. * Witness Printer took 67.06 ms. Allocated memory is still 164.6 MB. Free memory was 43.1 MB in the beginning and 37.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L603] int len = 2; VAL [len=2] [L604] len < 32 && __VERIFIER_nondet_int() [L604] len < 32 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, len=2, len < 32 && __VERIFIER_nondet_int()=0] [L604] COND FALSE !(len < 32 && __VERIFIER_nondet_int()) [L607] CALL, EXPR sll_create(len + 1) VAL [\old(len)=3] [L575] SLL head = ((void *)0); VAL [\old(len)=3, head={0:0}, len=3] [L576] COND TRUE len > 0 [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L578] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L581] new_head->next = head VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L576] COND TRUE len > 0 [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L578] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L581] new_head->next = head VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L576] COND TRUE len > 0 [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L578] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L581] new_head->next = head VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=3, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L576] COND FALSE !(len > 0) VAL [\old(len)=3, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L585] return head; VAL [\old(len)=3, \result={-3:0}, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L607] RET, EXPR sll_create(len + 1) VAL [len=2, sll_create(len + 1)={-3:0}] [L607] SLL s = sll_create(len + 1); [L608] CALL, EXPR sll_length(s) VAL [head={-3:0}] [L588] int len = 0; VAL [head={-3:0}, head={-3:0}, len=0] [L589] COND TRUE \read(head) [L590] len++ VAL [head={-3:0}, head={-3:0}, len=1] [L591] EXPR head->next VAL [head={-3:0}, head={-3:0}, head->next={-2:0}, len=1] [L591] head = head->next [L589] COND TRUE \read(head) [L590] len++ VAL [head={-2:0}, head={-3:0}, len=2] [L591] EXPR head->next VAL [head={-2:0}, head={-3:0}, head->next={-1:0}, len=2] [L591] head = head->next [L589] COND TRUE \read(head) [L590] len++ VAL [head={-1:0}, head={-3:0}, len=3] [L591] EXPR head->next VAL [head={-3:0}, head={-1:0}, head->next={0:0}, len=3] [L591] head = head->next [L589] COND FALSE !(\read(head)) VAL [head={0:0}, head={-3:0}, len=3] [L593] return len; VAL [\result=3, head={0:0}, head={-3:0}, len=3] [L608] RET, EXPR sll_length(s) VAL [len=2, s={-3:0}, sll_length(s)=3] [L608] COND TRUE len != sll_length(s) [L613] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "sll_length_check-1.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 71 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 56.2s, OverallIterations: 21, TraceHistogramMax: 4, AutomataDifference: 37.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 852 SDtfs, 2303 SDslu, 2756 SDs, 0 SdLazy, 13416 SolverSat, 542 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 20.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 812 GetRequests, 362 SyntacticMatches, 6 SemanticMatches, 444 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1844 ImplicationChecksByTransitivity, 23.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 374 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 1051 NumberOfCodeBlocks, 1048 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 973 ConstructedInterpolants, 89 QuantifiedInterpolants, 416690 SizeOfPredicates, 146 NumberOfNonLiveVariables, 2209 ConjunctsInSsa, 391 ConjunctsInUnsatCore, 30 InterpolantComputations, 10 PerfectInterpolantSequences, 257/459 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...