./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef034042979fe1e524a3655a8992190a25335ff0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 00:23:20,009 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 00:23:20,010 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 00:23:20,031 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 00:23:20,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 00:23:20,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 00:23:20,034 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 00:23:20,036 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 00:23:20,038 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 00:23:20,039 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 00:23:20,040 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 00:23:20,040 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 00:23:20,041 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 00:23:20,042 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 00:23:20,043 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 00:23:20,045 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 00:23:20,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 00:23:20,048 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 00:23:20,050 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 00:23:20,052 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 00:23:20,053 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 00:23:20,054 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 00:23:20,058 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 00:23:20,058 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 00:23:20,058 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 00:23:20,059 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 00:23:20,061 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 00:23:20,062 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 00:23:20,063 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 00:23:20,064 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 00:23:20,064 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 00:23:20,065 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 00:23:20,065 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 00:23:20,065 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 00:23:20,067 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 00:23:20,068 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 00:23:20,068 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 00:23:20,090 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 00:23:20,091 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 00:23:20,093 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 00:23:20,093 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 00:23:20,093 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 00:23:20,093 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 00:23:20,093 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 00:23:20,094 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 00:23:20,095 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 00:23:20,095 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 00:23:20,096 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 00:23:20,096 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 00:23:20,096 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 00:23:20,096 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 00:23:20,096 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 00:23:20,097 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 00:23:20,097 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 00:23:20,097 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 00:23:20,097 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 00:23:20,097 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 00:23:20,098 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 00:23:20,098 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:23:20,098 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 00:23:20,098 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 00:23:20,098 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 00:23:20,099 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 00:23:20,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef034042979fe1e524a3655a8992190a25335ff0 [2019-01-14 00:23:20,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 00:23:20,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 00:23:20,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 00:23:20,187 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 00:23:20,188 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 00:23:20,189 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2019-01-14 00:23:20,249 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c293dbd85/3a07c2aa045c44968754c49d5064c120/FLAG4f5dc86b4 [2019-01-14 00:23:20,778 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 00:23:20,779 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2019-01-14 00:23:20,793 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c293dbd85/3a07c2aa045c44968754c49d5064c120/FLAG4f5dc86b4 [2019-01-14 00:23:21,036 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c293dbd85/3a07c2aa045c44968754c49d5064c120 [2019-01-14 00:23:21,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 00:23:21,042 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 00:23:21,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 00:23:21,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 00:23:21,047 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 00:23:21,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:23:21" (1/1) ... [2019-01-14 00:23:21,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac8430a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:23:21, skipping insertion in model container [2019-01-14 00:23:21,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:23:21" (1/1) ... [2019-01-14 00:23:21,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 00:23:21,103 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 00:23:21,455 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:23:21,473 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 00:23:21,654 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:23:21,719 INFO L195 MainTranslator]: Completed translation [2019-01-14 00:23:21,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:23:21 WrapperNode [2019-01-14 00:23:21,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 00:23:21,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 00:23:21,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 00:23:21,721 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 00:23:21,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:23:21" (1/1) ... [2019-01-14 00:23:21,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:23:21" (1/1) ... [2019-01-14 00:23:21,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:23:21" (1/1) ... [2019-01-14 00:23:21,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:23:21" (1/1) ... [2019-01-14 00:23:21,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:23:21" (1/1) ... [2019-01-14 00:23:21,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:23:21" (1/1) ... [2019-01-14 00:23:21,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:23:21" (1/1) ... [2019-01-14 00:23:21,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 00:23:21,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 00:23:21,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 00:23:21,793 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 00:23:21,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:23:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:23:21,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 00:23:21,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 00:23:21,844 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 00:23:21,844 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 00:23:21,844 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-14 00:23:21,845 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-01-14 00:23:21,845 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-01-14 00:23:21,845 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-01-14 00:23:21,845 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2019-01-14 00:23:21,845 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2019-01-14 00:23:21,845 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 00:23:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 00:23:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 00:23:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 00:23:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 00:23:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 00:23:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 00:23:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 00:23:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 00:23:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 00:23:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 00:23:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 00:23:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 00:23:21,848 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 00:23:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 00:23:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 00:23:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 00:23:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 00:23:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 00:23:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 00:23:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 00:23:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 00:23:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 00:23:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 00:23:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 00:23:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 00:23:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 00:23:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 00:23:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 00:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 00:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 00:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 00:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 00:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 00:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 00:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 00:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 00:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 00:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 00:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 00:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 00:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 00:23:21,855 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 00:23:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 00:23:21,856 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 00:23:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 00:23:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 00:23:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 00:23:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 00:23:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 00:23:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 00:23:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 00:23:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 00:23:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 00:23:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 00:23:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 00:23:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 00:23:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 00:23:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 00:23:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 00:23:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 00:23:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 00:23:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-14 00:23:21,860 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 00:23:21,861 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 00:23:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-14 00:23:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 00:23:21,862 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 00:23:21,863 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-14 00:23:21,863 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 00:23:21,863 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 00:23:21,863 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 00:23:21,863 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 00:23:21,863 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 00:23:21,863 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 00:23:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 00:23:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 00:23:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 00:23:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 00:23:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 00:23:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 00:23:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 00:23:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 00:23:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 00:23:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 00:23:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 00:23:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 00:23:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 00:23:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 00:23:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 00:23:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 00:23:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 00:23:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 00:23:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 00:23:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 00:23:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 00:23:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 00:23:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 00:23:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 00:23:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 00:23:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 00:23:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 00:23:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 00:23:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 00:23:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 00:23:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 00:23:21,872 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 00:23:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-14 00:23:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-01-14 00:23:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 00:23:21,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 00:23:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 00:23:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-01-14 00:23:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-01-14 00:23:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 00:23:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 00:23:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2019-01-14 00:23:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 00:23:21,875 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2019-01-14 00:23:21,875 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 00:23:21,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 00:23:21,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 00:23:22,384 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-01-14 00:23:22,707 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 00:23:22,707 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 00:23:22,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:23:22 BoogieIcfgContainer [2019-01-14 00:23:22,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 00:23:22,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 00:23:22,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 00:23:22,715 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 00:23:22,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 12:23:21" (1/3) ... [2019-01-14 00:23:22,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2231b2a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:23:22, skipping insertion in model container [2019-01-14 00:23:22,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:23:21" (2/3) ... [2019-01-14 00:23:22,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2231b2a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:23:22, skipping insertion in model container [2019-01-14 00:23:22,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:23:22" (3/3) ... [2019-01-14 00:23:22,720 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2019-01-14 00:23:22,730 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 00:23:22,739 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-01-14 00:23:22,757 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-01-14 00:23:22,781 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 00:23:22,782 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 00:23:22,782 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 00:23:22,783 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 00:23:22,783 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 00:23:22,783 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 00:23:22,783 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 00:23:22,783 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 00:23:22,784 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 00:23:22,802 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-01-14 00:23:22,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 00:23:22,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:22,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:22,816 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:23:22,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:22,823 INFO L82 PathProgramCache]: Analyzing trace with hash 360562924, now seen corresponding path program 1 times [2019-01-14 00:23:22,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:22,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:22,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:22,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:22,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:23,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:23:23,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:23:23,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:23:23,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:23:23,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:23:23,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:23:23,068 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2019-01-14 00:23:23,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:23,399 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2019-01-14 00:23:23,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:23:23,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-14 00:23:23,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:23,414 INFO L225 Difference]: With dead ends: 86 [2019-01-14 00:23:23,415 INFO L226 Difference]: Without dead ends: 79 [2019-01-14 00:23:23,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:23:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-14 00:23:23,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-14 00:23:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 00:23:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-01-14 00:23:23,461 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 13 [2019-01-14 00:23:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:23,462 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-01-14 00:23:23,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:23:23,462 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-01-14 00:23:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 00:23:23,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:23,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:23,463 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:23:23,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:23,464 INFO L82 PathProgramCache]: Analyzing trace with hash 360562925, now seen corresponding path program 1 times [2019-01-14 00:23:23,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:23,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:23,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:23,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:23,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:23:23,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:23:23,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:23:23,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:23:23,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:23:23,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:23:23,601 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 3 states. [2019-01-14 00:23:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:23,666 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-01-14 00:23:23,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:23:23,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-14 00:23:23,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:23,668 INFO L225 Difference]: With dead ends: 77 [2019-01-14 00:23:23,669 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 00:23:23,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:23:23,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 00:23:23,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-14 00:23:23,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 00:23:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-01-14 00:23:23,680 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 13 [2019-01-14 00:23:23,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:23,681 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-01-14 00:23:23,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:23:23,681 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-01-14 00:23:23,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 00:23:23,682 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:23,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:23,682 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:23:23,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:23,683 INFO L82 PathProgramCache]: Analyzing trace with hash -611679416, now seen corresponding path program 1 times [2019-01-14 00:23:23,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:23,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:23,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:23,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:23,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:23:23,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:23:23,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:23:23,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:23:23,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:23:23,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:23:23,783 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-01-14 00:23:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:24,133 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2019-01-14 00:23:24,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:23:24,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-01-14 00:23:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:24,138 INFO L225 Difference]: With dead ends: 88 [2019-01-14 00:23:24,138 INFO L226 Difference]: Without dead ends: 85 [2019-01-14 00:23:24,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:23:24,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-14 00:23:24,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2019-01-14 00:23:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-14 00:23:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-01-14 00:23:24,154 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 18 [2019-01-14 00:23:24,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:24,155 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-01-14 00:23:24,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:23:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-01-14 00:23:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 00:23:24,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:24,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:24,156 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:23:24,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:24,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1012902948, now seen corresponding path program 1 times [2019-01-14 00:23:24,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:24,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:24,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:24,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:24,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:23:24,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:23:24,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:23:24,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:23:24,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:23:24,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:23:24,291 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 6 states. [2019-01-14 00:23:24,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:24,530 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-01-14 00:23:24,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:23:24,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 00:23:24,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:24,534 INFO L225 Difference]: With dead ends: 78 [2019-01-14 00:23:24,535 INFO L226 Difference]: Without dead ends: 78 [2019-01-14 00:23:24,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:23:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-14 00:23:24,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-01-14 00:23:24,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 00:23:24,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-01-14 00:23:24,543 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 19 [2019-01-14 00:23:24,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:24,543 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-01-14 00:23:24,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:23:24,544 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-01-14 00:23:24,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 00:23:24,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:24,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:24,545 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:23:24,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:24,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1012902949, now seen corresponding path program 1 times [2019-01-14 00:23:24,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:24,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:24,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:24,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:24,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:23:24,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:23:24,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:23:24,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:23:24,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:23:24,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:23:24,725 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2019-01-14 00:23:25,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:25,054 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-01-14 00:23:25,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:23:25,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 00:23:25,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:25,057 INFO L225 Difference]: With dead ends: 77 [2019-01-14 00:23:25,057 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 00:23:25,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:23:25,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 00:23:25,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-01-14 00:23:25,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-14 00:23:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-01-14 00:23:25,065 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 19 [2019-01-14 00:23:25,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:25,065 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-01-14 00:23:25,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:23:25,065 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-01-14 00:23:25,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 00:23:25,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:25,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:25,067 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:23:25,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:25,068 INFO L82 PathProgramCache]: Analyzing trace with hash -343567322, now seen corresponding path program 1 times [2019-01-14 00:23:25,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:25,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:25,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:25,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:25,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:23:25,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:23:25,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 00:23:25,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:23:25,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:23:25,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:23:25,325 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 12 states. [2019-01-14 00:23:25,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:25,914 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-01-14 00:23:25,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:23:25,915 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-01-14 00:23:25,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:25,917 INFO L225 Difference]: With dead ends: 82 [2019-01-14 00:23:25,917 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 00:23:25,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:23:25,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 00:23:25,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-01-14 00:23:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 00:23:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2019-01-14 00:23:25,925 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 31 [2019-01-14 00:23:25,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:25,926 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2019-01-14 00:23:25,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:23:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2019-01-14 00:23:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 00:23:25,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:25,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:25,927 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:23:25,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash -343567321, now seen corresponding path program 1 times [2019-01-14 00:23:25,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:25,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:25,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:25,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:25,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:23:26,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:23:26,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:23:26,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:26,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:23:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:23:26,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:23:26,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 00:23:26,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:23:26,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:23:26,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:23:26,331 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 6 states. [2019-01-14 00:23:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:26,601 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2019-01-14 00:23:26,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:23:26,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-01-14 00:23:26,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:26,603 INFO L225 Difference]: With dead ends: 93 [2019-01-14 00:23:26,603 INFO L226 Difference]: Without dead ends: 90 [2019-01-14 00:23:26,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:23:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-14 00:23:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2019-01-14 00:23:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-14 00:23:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-01-14 00:23:26,611 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 31 [2019-01-14 00:23:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:26,612 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-01-14 00:23:26,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:23:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-01-14 00:23:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 00:23:26,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:26,615 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:26,615 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:23:26,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:26,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1504093175, now seen corresponding path program 2 times [2019-01-14 00:23:26,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:26,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:26,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:26,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:23:27,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:23:27,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 00:23:27,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:23:27,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:23:27,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:23:27,233 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 13 states. [2019-01-14 00:23:27,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:27,703 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2019-01-14 00:23:27,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 00:23:27,705 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-01-14 00:23:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:27,706 INFO L225 Difference]: With dead ends: 88 [2019-01-14 00:23:27,706 INFO L226 Difference]: Without dead ends: 88 [2019-01-14 00:23:27,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-01-14 00:23:27,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-14 00:23:27,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2019-01-14 00:23:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-14 00:23:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2019-01-14 00:23:27,714 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 44 [2019-01-14 00:23:27,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:27,714 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2019-01-14 00:23:27,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:23:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2019-01-14 00:23:27,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-14 00:23:27,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:27,716 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:27,716 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:23:27,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:27,717 INFO L82 PathProgramCache]: Analyzing trace with hash -732402631, now seen corresponding path program 1 times [2019-01-14 00:23:27,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:27,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:27,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:27,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:23:27,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:23:28,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:23:28,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 00:23:28,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:23:28,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:23:28,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:23:28,018 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 12 states. [2019-01-14 00:23:28,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:28,524 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2019-01-14 00:23:28,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 00:23:28,525 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2019-01-14 00:23:28,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:28,527 INFO L225 Difference]: With dead ends: 98 [2019-01-14 00:23:28,527 INFO L226 Difference]: Without dead ends: 98 [2019-01-14 00:23:28,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:23:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-14 00:23:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2019-01-14 00:23:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-14 00:23:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2019-01-14 00:23:28,534 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 46 [2019-01-14 00:23:28,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:28,535 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2019-01-14 00:23:28,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:23:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2019-01-14 00:23:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-14 00:23:28,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:28,536 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:28,537 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:23:28,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:28,537 INFO L82 PathProgramCache]: Analyzing trace with hash -732402630, now seen corresponding path program 1 times [2019-01-14 00:23:28,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:28,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:28,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:28,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:28,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:23:28,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:23:28,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 00:23:28,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 00:23:28,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 00:23:28,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:23:28,747 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 4 states. [2019-01-14 00:23:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:28,820 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-01-14 00:23:28,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:23:28,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-01-14 00:23:28,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:28,822 INFO L225 Difference]: With dead ends: 94 [2019-01-14 00:23:28,822 INFO L226 Difference]: Without dead ends: 94 [2019-01-14 00:23:28,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 00:23:28,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-14 00:23:28,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2019-01-14 00:23:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-14 00:23:28,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-01-14 00:23:28,828 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 46 [2019-01-14 00:23:28,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:28,829 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-01-14 00:23:28,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 00:23:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-01-14 00:23:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 00:23:28,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:28,831 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:28,831 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:23:28,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:28,831 INFO L82 PathProgramCache]: Analyzing trace with hash 955614394, now seen corresponding path program 1 times [2019-01-14 00:23:28,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:28,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:28,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:28,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:28,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:23:29,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:23:29,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:23:29,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:23:29,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:23:29,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:23:29,117 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 5 states. [2019-01-14 00:23:29,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:29,549 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-01-14 00:23:29,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:23:29,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-14 00:23:29,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:29,552 INFO L225 Difference]: With dead ends: 99 [2019-01-14 00:23:29,552 INFO L226 Difference]: Without dead ends: 99 [2019-01-14 00:23:29,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:23:29,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-14 00:23:29,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2019-01-14 00:23:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-14 00:23:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2019-01-14 00:23:29,559 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 47 [2019-01-14 00:23:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:29,560 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2019-01-14 00:23:29,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:23:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2019-01-14 00:23:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 00:23:29,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:29,562 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:29,563 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:23:29,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:29,563 INFO L82 PathProgramCache]: Analyzing trace with hash 711885650, now seen corresponding path program 1 times [2019-01-14 00:23:29,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:29,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:29,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:29,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:29,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 00:23:29,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:23:29,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 00:23:29,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:23:29,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:23:29,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:23:29,836 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 12 states. [2019-01-14 00:23:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:30,785 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-01-14 00:23:30,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:23:30,786 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-01-14 00:23:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:30,787 INFO L225 Difference]: With dead ends: 99 [2019-01-14 00:23:30,787 INFO L226 Difference]: Without dead ends: 99 [2019-01-14 00:23:30,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-14 00:23:30,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-14 00:23:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-01-14 00:23:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 00:23:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-01-14 00:23:30,792 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 54 [2019-01-14 00:23:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:30,793 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-01-14 00:23:30,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:23:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-01-14 00:23:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 00:23:30,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:30,795 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:30,795 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:23:30,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:30,796 INFO L82 PathProgramCache]: Analyzing trace with hash 711885651, now seen corresponding path program 1 times [2019-01-14 00:23:30,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:30,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:30,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:30,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:30,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:23:31,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:23:31,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:23:31,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:31,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:23:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:23:31,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:23:31,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-14 00:23:31,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:23:31,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:23:31,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:23:31,318 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 7 states. [2019-01-14 00:23:31,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:23:31,443 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2019-01-14 00:23:31,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:23:31,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-01-14 00:23:31,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:23:31,445 INFO L225 Difference]: With dead ends: 110 [2019-01-14 00:23:31,446 INFO L226 Difference]: Without dead ends: 110 [2019-01-14 00:23:31,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:23:31,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-14 00:23:31,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2019-01-14 00:23:31,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 00:23:31,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2019-01-14 00:23:31,454 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 54 [2019-01-14 00:23:31,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:23:31,454 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2019-01-14 00:23:31,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:23:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2019-01-14 00:23:31,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-14 00:23:31,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:23:31,456 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:23:31,456 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:23:31,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:23:31,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1572237498, now seen corresponding path program 1 times [2019-01-14 00:23:31,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:23:31,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:23:31,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:31,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:31,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:23:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:31,890 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-14 00:23:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 00:23:32,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:23:32,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:23:32,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:23:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:23:32,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:23:39,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 00:23:39,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:39,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:39,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-14 00:23:39,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:23:39,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:23:39,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:23:39,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:39,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:23:39,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-01-14 00:23:43,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2019-01-14 00:23:43,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-14 00:23:43,037 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:43,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:43,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:23:43,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:9 [2019-01-14 00:24:13,607 WARN L181 SmtUtils]: Spent 899.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 00:24:13,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-01-14 00:24:13,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:24:13,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-14 00:24:13,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:13,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:13,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:24:13,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:17 [2019-01-14 00:24:14,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 00:24:14,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2019-01-14 00:24:14,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:24:14,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:14,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:24:14,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-01-14 00:24:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 00:24:14,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:24:14,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 36 [2019-01-14 00:24:14,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-14 00:24:14,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-14 00:24:14,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1187, Unknown=50, NotChecked=0, Total=1332 [2019-01-14 00:24:14,765 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand 37 states. [2019-01-14 00:24:15,984 WARN L181 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 00:24:16,376 WARN L181 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 00:24:16,910 WARN L181 SmtUtils]: Spent 459.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 00:24:43,823 WARN L181 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-01-14 00:25:07,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:25:07,971 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2019-01-14 00:25:07,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 00:25:07,972 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 55 [2019-01-14 00:25:07,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:25:07,974 INFO L225 Difference]: With dead ends: 170 [2019-01-14 00:25:07,974 INFO L226 Difference]: Without dead ends: 170 [2019-01-14 00:25:07,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 64.7s TimeCoverageRelationStatistics Valid=340, Invalid=3249, Unknown=71, NotChecked=0, Total=3660 [2019-01-14 00:25:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-14 00:25:07,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 119. [2019-01-14 00:25:07,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-14 00:25:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2019-01-14 00:25:07,985 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 55 [2019-01-14 00:25:07,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:25:07,985 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2019-01-14 00:25:07,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-14 00:25:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2019-01-14 00:25:07,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-14 00:25:07,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:25:07,989 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:25:07,989 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:25:07,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:25:07,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1572237497, now seen corresponding path program 1 times [2019-01-14 00:25:07,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:25:07,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:25:07,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:07,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:25:07,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:25:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:25:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 00:25:09,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:25:09,083 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:25:09,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:25:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:25:09,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:25:10,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:10,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:10,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:25:10,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:10,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-14 00:25:10,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:10,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:10,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-01-14 00:25:10,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:25:10,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:25:10,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:10,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:10,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:25:10,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:25:10,915 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:10,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:10,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:10,932 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:46, output treesize:44 [2019-01-14 00:25:11,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-01-14 00:25:11,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2019-01-14 00:25:11,290 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:11,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:11,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-14 00:25:11,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-14 00:25:11,321 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:11,323 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:11,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:11,334 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:50, output treesize:21 [2019-01-14 00:25:31,802 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 00:25:31,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2019-01-14 00:25:31,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:31,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2019-01-14 00:25:31,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:31,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:31,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2019-01-14 00:25:31,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:25:31,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2019-01-14 00:25:31,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:31,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:31,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:31,953 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:91, output treesize:58 [2019-01-14 00:25:32,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-01-14 00:25:32,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2019-01-14 00:25:32,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:32,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:32,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-01-14 00:25:32,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2019-01-14 00:25:32,309 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:25:32,315 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:25:32,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:25:32,324 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:62, output treesize:20 [2019-01-14 00:25:32,496 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 00:25:32,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:25:32,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2019-01-14 00:25:32,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-14 00:25:32,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-14 00:25:32,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1862, Unknown=11, NotChecked=0, Total=1980 [2019-01-14 00:25:32,520 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand 45 states. [2019-01-14 00:26:07,557 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-01-14 00:26:11,902 WARN L181 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-01-14 00:26:23,098 WARN L181 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-01-14 00:26:25,948 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2019-01-14 00:26:30,467 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-01-14 00:26:44,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:26:44,978 INFO L93 Difference]: Finished difference Result 215 states and 245 transitions. [2019-01-14 00:26:44,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-14 00:26:44,979 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 55 [2019-01-14 00:26:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:26:44,982 INFO L225 Difference]: With dead ends: 215 [2019-01-14 00:26:44,982 INFO L226 Difference]: Without dead ends: 215 [2019-01-14 00:26:44,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=330, Invalid=4214, Unknown=12, NotChecked=0, Total=4556 [2019-01-14 00:26:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-14 00:26:44,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 133. [2019-01-14 00:26:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-14 00:26:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 157 transitions. [2019-01-14 00:26:44,993 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 157 transitions. Word has length 55 [2019-01-14 00:26:44,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:26:44,994 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 157 transitions. [2019-01-14 00:26:44,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-14 00:26:44,994 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 157 transitions. [2019-01-14 00:26:44,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-14 00:26:44,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:26:44,996 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:26:44,998 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:26:44,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:26:44,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1907318596, now seen corresponding path program 2 times [2019-01-14 00:26:44,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:26:45,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:26:45,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:26:45,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:26:45,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:26:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:26:45,185 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 00:26:45,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:26:45,186 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:26:45,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:26:45,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:26:45,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:26:45,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:26:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 00:26:45,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:26:45,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 00:26:45,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:26:45,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:26:45,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:26:45,298 INFO L87 Difference]: Start difference. First operand 133 states and 157 transitions. Second operand 7 states. [2019-01-14 00:26:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:26:45,431 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2019-01-14 00:26:45,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:26:45,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-01-14 00:26:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:26:45,434 INFO L225 Difference]: With dead ends: 114 [2019-01-14 00:26:45,435 INFO L226 Difference]: Without dead ends: 114 [2019-01-14 00:26:45,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:26:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-14 00:26:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-14 00:26:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 00:26:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2019-01-14 00:26:45,444 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 58 [2019-01-14 00:26:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:26:45,444 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2019-01-14 00:26:45,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:26:45,444 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2019-01-14 00:26:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 00:26:45,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:26:45,445 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:26:45,445 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:26:45,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:26:45,448 INFO L82 PathProgramCache]: Analyzing trace with hash -176176313, now seen corresponding path program 2 times [2019-01-14 00:26:45,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:26:45,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:26:45,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:26:45,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:26:45,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:26:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:26:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-14 00:26:45,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:26:45,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:26:45,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:26:45,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:26:45,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:26:45,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:26:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 00:26:46,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:26:46,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-01-14 00:26:46,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 00:26:46,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 00:26:46,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:26:46,033 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 9 states. [2019-01-14 00:26:46,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:26:46,247 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2019-01-14 00:26:46,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:26:46,249 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-01-14 00:26:46,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:26:46,250 INFO L225 Difference]: With dead ends: 112 [2019-01-14 00:26:46,250 INFO L226 Difference]: Without dead ends: 106 [2019-01-14 00:26:46,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:26:46,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-14 00:26:46,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-14 00:26:46,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-14 00:26:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2019-01-14 00:26:46,255 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 62 [2019-01-14 00:26:46,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:26:46,255 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2019-01-14 00:26:46,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 00:26:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2019-01-14 00:26:46,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 00:26:46,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:26:46,256 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:26:46,257 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:26:46,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:26:46,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1721876207, now seen corresponding path program 1 times [2019-01-14 00:26:46,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:26:46,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:26:46,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:26:46,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:26:46,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:26:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:26:46,423 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 5 [2019-01-14 00:26:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 00:26:46,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:26:46,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:26:46,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:26:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:26:46,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:26:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-14 00:26:47,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:26:47,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 26 [2019-01-14 00:26:47,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-14 00:26:47,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-14 00:26:47,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2019-01-14 00:26:47,118 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 27 states. [2019-01-14 00:26:47,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:26:47,892 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2019-01-14 00:26:47,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 00:26:47,893 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 65 [2019-01-14 00:26:47,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:26:47,895 INFO L225 Difference]: With dead ends: 111 [2019-01-14 00:26:47,895 INFO L226 Difference]: Without dead ends: 111 [2019-01-14 00:26:47,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 00:26:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-14 00:26:47,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2019-01-14 00:26:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-14 00:26:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2019-01-14 00:26:47,900 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 65 [2019-01-14 00:26:47,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:26:47,901 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2019-01-14 00:26:47,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-14 00:26:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2019-01-14 00:26:47,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-14 00:26:47,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:26:47,902 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:26:47,902 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:26:47,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:26:47,903 INFO L82 PathProgramCache]: Analyzing trace with hash 290556232, now seen corresponding path program 3 times [2019-01-14 00:26:47,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:26:47,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:26:47,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:26:47,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:26:47,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:26:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:26:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 00:26:48,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:26:48,030 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:26:48,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 00:26:48,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 00:26:48,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:26:48,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:26:48,150 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-14 00:26:48,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:26:48,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2019-01-14 00:26:48,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:26:48,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:26:48,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:26:48,171 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 12 states. [2019-01-14 00:26:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:26:48,418 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-01-14 00:26:48,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 00:26:48,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-01-14 00:26:48,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:26:48,421 INFO L225 Difference]: With dead ends: 98 [2019-01-14 00:26:48,421 INFO L226 Difference]: Without dead ends: 98 [2019-01-14 00:26:48,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-01-14 00:26:48,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-14 00:26:48,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-14 00:26:48,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-14 00:26:48,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-01-14 00:26:48,425 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 66 [2019-01-14 00:26:48,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:26:48,426 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-01-14 00:26:48,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:26:48,426 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-01-14 00:26:48,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-14 00:26:48,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:26:48,427 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:26:48,427 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:26:48,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:26:48,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1618025308, now seen corresponding path program 1 times [2019-01-14 00:26:48,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:26:48,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:26:48,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:26:48,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:26:48,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:26:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:26:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-14 00:26:48,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:26:48,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:26:48,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:26:48,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:26:48,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:26:48,673 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 5 states. [2019-01-14 00:26:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:26:48,719 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2019-01-14 00:26:48,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:26:48,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-01-14 00:26:48,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:26:48,722 INFO L225 Difference]: With dead ends: 104 [2019-01-14 00:26:48,722 INFO L226 Difference]: Without dead ends: 104 [2019-01-14 00:26:48,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:26:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-14 00:26:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-14 00:26:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 00:26:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2019-01-14 00:26:48,727 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 68 [2019-01-14 00:26:48,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:26:48,727 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2019-01-14 00:26:48,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:26:48,727 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2019-01-14 00:26:48,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-14 00:26:48,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:26:48,728 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:26:48,729 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:26:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:26:48,729 INFO L82 PathProgramCache]: Analyzing trace with hash -812191990, now seen corresponding path program 1 times [2019-01-14 00:26:48,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:26:48,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:26:48,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:26:48,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:26:48,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:26:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:26:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 00:26:50,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:26:50,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:26:50,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:26:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:26:50,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:26:50,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:50,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:50,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:26:50,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:50,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:50,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-01-14 00:26:50,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:26:50,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:26:50,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:50,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:50,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:50,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2019-01-14 00:26:51,696 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2019-01-14 00:26:51,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-01-14 00:26:51,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:26:51,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 00:26:51,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:51,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:51,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:51,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:10 [2019-01-14 00:26:53,998 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 00:26:54,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2019-01-14 00:26:54,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-14 00:26:54,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:54,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:54,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:54,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:22 [2019-01-14 00:26:54,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-01-14 00:26:54,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2019-01-14 00:26:54,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:26:54,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:54,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:26:54,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:5 [2019-01-14 00:26:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2019-01-14 00:26:54,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:26:54,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 29] total 62 [2019-01-14 00:26:54,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-14 00:26:54,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-14 00:26:54,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=3632, Unknown=1, NotChecked=120, Total=3906 [2019-01-14 00:26:54,623 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 63 states. [2019-01-14 00:26:59,173 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 34 [2019-01-14 00:27:01,809 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 00:27:04,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:27:04,170 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2019-01-14 00:27:04,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-14 00:27:04,172 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 79 [2019-01-14 00:27:04,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:27:04,174 INFO L225 Difference]: With dead ends: 126 [2019-01-14 00:27:04,174 INFO L226 Difference]: Without dead ends: 126 [2019-01-14 00:27:04,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 94 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1584 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=506, Invalid=8427, Unknown=1, NotChecked=186, Total=9120 [2019-01-14 00:27:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-14 00:27:04,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2019-01-14 00:27:04,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 00:27:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-01-14 00:27:04,182 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 79 [2019-01-14 00:27:04,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:27:04,182 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-01-14 00:27:04,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-14 00:27:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2019-01-14 00:27:04,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-14 00:27:04,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:27:04,184 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:27:04,187 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:27:04,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:27:04,187 INFO L82 PathProgramCache]: Analyzing trace with hash -812191989, now seen corresponding path program 1 times [2019-01-14 00:27:04,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:27:04,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:27:04,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:27:04,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:27:04,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:27:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:27:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 00:27:05,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:27:05,353 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:27:05,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:27:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:27:05,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:27:05,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:27:05,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-14 00:27:05,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:27:06,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:27:06,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:27:06,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:27:06,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:27:06,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:27:06,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-01-14 00:27:06,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:27:06,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:27:06,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:27:06,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:27:06,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:27:06,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:27:06,179 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:27:06,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:27:06,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:27:06,196 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:44 [2019-01-14 00:27:06,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-01-14 00:27:06,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2019-01-14 00:27:06,518 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:27:06,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:27:06,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-14 00:27:06,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-14 00:27:06,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:27:06,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:27:06,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:27:06,570 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:21 [2019-01-14 00:27:27,386 WARN L181 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 00:27:27,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2019-01-14 00:27:27,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:27:27,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2019-01-14 00:27:27,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:27:27,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:27:27,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2019-01-14 00:27:27,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:27:27,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2019-01-14 00:27:27,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:27:27,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:27:27,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:27:27,492 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:91, output treesize:58 [2019-01-14 00:27:27,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-01-14 00:27:27,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2019-01-14 00:27:27,570 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:27:27,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:27:27,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-14 00:27:27,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-14 00:27:27,602 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:27:27,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:27:27,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:27:27,614 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:21 [2019-01-14 00:27:29,971 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~s~0.base_BEFORE_CALL_12 Int) (v_arrayElimCell_23 Int)) (and (<= 4 (select |c_#length| v_arrayElimCell_23)) (not (= v_main_~s~0.base_BEFORE_CALL_12 v_arrayElimCell_23)) (= (select |c_#length| v_main_~s~0.base_BEFORE_CALL_12) 8))) (exists ((sll_update_at_~head.offset Int)) (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (+ |c_sll_update_at_#in~head.offset| 4)))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| .cse0) sll_update_at_~head.offset)))) (= (store |c_old(#memory_$Pointer$.offset)| .cse0 (store (select |c_old(#memory_$Pointer$.offset)| .cse0) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.offset| .cse0) sll_update_at_~head.offset))) |c_#memory_$Pointer$.offset|))))) is different from true [2019-01-14 00:27:29,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2019-01-14 00:27:30,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-14 00:27:30,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:27:30,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:27:30,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2019-01-14 00:27:30,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-14 00:27:30,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:27:30,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:27:30,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:27:30,502 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:124, output treesize:58 [2019-01-14 00:27:30,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-01-14 00:27:30,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2019-01-14 00:27:30,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:27:30,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:27:30,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-01-14 00:27:30,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2019-01-14 00:27:30,994 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:27:30,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:27:31,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:27:31,006 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:20 [2019-01-14 00:27:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 2 not checked. [2019-01-14 00:27:31,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:27:31,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2019-01-14 00:27:31,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-14 00:27:31,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-14 00:27:31,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=3028, Unknown=10, NotChecked=110, Total=3306 [2019-01-14 00:27:31,387 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 58 states. [2019-01-14 00:27:38,903 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-01-14 00:27:45,159 WARN L181 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2019-01-14 00:27:50,064 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 56 [2019-01-14 00:27:50,443 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-01-14 00:27:55,006 WARN L181 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 60 [2019-01-14 00:27:55,862 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-01-14 00:27:56,608 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-01-14 00:27:57,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:27:57,508 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2019-01-14 00:27:57,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-14 00:27:57,510 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 79 [2019-01-14 00:27:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:27:57,511 INFO L225 Difference]: With dead ends: 129 [2019-01-14 00:27:57,511 INFO L226 Difference]: Without dead ends: 129 [2019-01-14 00:27:57,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 41.0s TimeCoverageRelationStatistics Valid=471, Invalid=6327, Unknown=12, NotChecked=162, Total=6972 [2019-01-14 00:27:57,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-14 00:27:57,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 107. [2019-01-14 00:27:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 00:27:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2019-01-14 00:27:57,518 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 79 [2019-01-14 00:27:57,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:27:57,519 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2019-01-14 00:27:57,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-14 00:27:57,519 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2019-01-14 00:27:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-14 00:27:57,522 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:27:57,522 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:27:57,522 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:27:57,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:27:57,523 INFO L82 PathProgramCache]: Analyzing trace with hash -812191934, now seen corresponding path program 1 times [2019-01-14 00:27:57,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:27:57,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:27:57,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:27:57,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:27:57,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:27:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:27:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-14 00:27:57,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:27:57,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:27:57,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:27:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:27:57,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:27:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-14 00:27:57,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:27:57,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 00:27:57,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 00:27:57,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 00:27:57,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:27:57,985 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand 8 states. [2019-01-14 00:27:58,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:27:58,137 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2019-01-14 00:27:58,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:27:58,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-01-14 00:27:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:27:58,139 INFO L225 Difference]: With dead ends: 98 [2019-01-14 00:27:58,139 INFO L226 Difference]: Without dead ends: 98 [2019-01-14 00:27:58,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:27:58,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-14 00:27:58,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-14 00:27:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-14 00:27:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2019-01-14 00:27:58,144 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 79 [2019-01-14 00:27:58,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:27:58,144 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2019-01-14 00:27:58,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 00:27:58,144 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2019-01-14 00:27:58,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-14 00:27:58,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:27:58,145 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:27:58,146 INFO L423 AbstractCegarLoop]: === Iteration 24 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:27:58,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:27:58,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1564565932, now seen corresponding path program 1 times [2019-01-14 00:27:58,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:27:58,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:27:58,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:27:58,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:27:58,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:27:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:27:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-14 00:27:58,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:27:58,403 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:27:58,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:27:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:27:58,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:27:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-14 00:27:58,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:27:58,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-01-14 00:27:58,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 00:27:58,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 00:27:58,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:27:58,545 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 9 states. [2019-01-14 00:27:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:27:58,686 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-01-14 00:27:58,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:27:58,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-01-14 00:27:58,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:27:58,689 INFO L225 Difference]: With dead ends: 102 [2019-01-14 00:27:58,689 INFO L226 Difference]: Without dead ends: 98 [2019-01-14 00:27:58,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:27:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-14 00:27:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-14 00:27:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-14 00:27:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2019-01-14 00:27:58,694 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 87 [2019-01-14 00:27:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:27:58,694 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2019-01-14 00:27:58,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 00:27:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2019-01-14 00:27:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-14 00:27:58,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:27:58,700 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:27:58,700 INFO L423 AbstractCegarLoop]: === Iteration 25 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:27:58,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:27:58,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1130115316, now seen corresponding path program 1 times [2019-01-14 00:27:58,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:27:58,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:27:58,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:27:58,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:27:58,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:27:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:27:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-14 00:27:59,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:27:59,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:27:59,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:27:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:27:59,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:27:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-14 00:27:59,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:27:59,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 20 [2019-01-14 00:27:59,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 00:27:59,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 00:27:59,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-01-14 00:27:59,510 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 21 states. [2019-01-14 00:28:00,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:28:00,318 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2019-01-14 00:28:00,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 00:28:00,319 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 90 [2019-01-14 00:28:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:28:00,321 INFO L225 Difference]: With dead ends: 106 [2019-01-14 00:28:00,321 INFO L226 Difference]: Without dead ends: 106 [2019-01-14 00:28:00,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 74 SyntacticMatches, 14 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-01-14 00:28:00,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-14 00:28:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2019-01-14 00:28:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 00:28:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-01-14 00:28:00,329 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 90 [2019-01-14 00:28:00,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:28:00,330 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-01-14 00:28:00,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 00:28:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-01-14 00:28:00,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-14 00:28:00,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:28:00,332 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:28:00,332 INFO L423 AbstractCegarLoop]: === Iteration 26 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:28:00,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:28:00,332 INFO L82 PathProgramCache]: Analyzing trace with hash 981906199, now seen corresponding path program 1 times [2019-01-14 00:28:00,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:28:00,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:28:00,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:28:00,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:28:00,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:28:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:28:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-14 00:28:00,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:28:00,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-14 00:28:00,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:28:00,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:28:00,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:28:00,491 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 13 states. [2019-01-14 00:28:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:28:00,741 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2019-01-14 00:28:00,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 00:28:00,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-01-14 00:28:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:28:00,744 INFO L225 Difference]: With dead ends: 105 [2019-01-14 00:28:00,745 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 00:28:00,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-01-14 00:28:00,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 00:28:00,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-01-14 00:28:00,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 00:28:00,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2019-01-14 00:28:00,749 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 93 [2019-01-14 00:28:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:28:00,753 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2019-01-14 00:28:00,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:28:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2019-01-14 00:28:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-14 00:28:00,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:28:00,754 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:28:00,754 INFO L423 AbstractCegarLoop]: === Iteration 27 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:28:00,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:28:00,755 INFO L82 PathProgramCache]: Analyzing trace with hash 983233598, now seen corresponding path program 1 times [2019-01-14 00:28:00,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:28:00,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:28:00,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:28:00,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:28:00,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:28:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:28:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-14 00:28:01,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:28:01,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 00:28:01,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:28:01,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:28:01,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:28:01,323 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 12 states. [2019-01-14 00:28:01,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:28:01,627 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2019-01-14 00:28:01,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 00:28:01,628 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-01-14 00:28:01,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:28:01,630 INFO L225 Difference]: With dead ends: 101 [2019-01-14 00:28:01,630 INFO L226 Difference]: Without dead ends: 101 [2019-01-14 00:28:01,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-01-14 00:28:01,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-14 00:28:01,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-14 00:28:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 00:28:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2019-01-14 00:28:01,634 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 93 [2019-01-14 00:28:01,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:28:01,634 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2019-01-14 00:28:01,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:28:01,635 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2019-01-14 00:28:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-14 00:28:01,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:28:01,635 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:28:01,636 INFO L423 AbstractCegarLoop]: === Iteration 28 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:28:01,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:28:01,636 INFO L82 PathProgramCache]: Analyzing trace with hash -164766544, now seen corresponding path program 1 times [2019-01-14 00:28:01,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:28:01,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:28:01,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:28:01,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:28:01,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:28:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:28:02,023 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 3 [2019-01-14 00:28:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-14 00:28:04,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:28:04,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:28:04,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:28:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:28:04,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:28:04,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:28:04,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:28:04,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:28:04,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:28:04,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:28:04,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-01-14 00:28:04,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:28:04,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:28:04,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:28:04,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:28:04,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:28:04,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-01-14 00:28:05,750 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2019-01-14 00:28:05,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-01-14 00:28:05,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:28:05,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 00:28:05,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:28:05,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:28:05,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:28:05,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-01-14 00:28:07,643 WARN L181 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 00:28:07,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2019-01-14 00:28:07,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-14 00:28:07,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:28:07,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:28:07,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:28:07,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:28 [2019-01-14 00:28:09,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-01-14 00:28:09,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2019-01-14 00:28:09,387 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:28:09,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:28:09,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:28:09,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-01-14 00:28:09,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:28:09,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-14 00:28:09,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:28:09,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:28:09,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-01-14 00:28:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2019-01-14 00:28:09,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:28:09,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 32] total 69 [2019-01-14 00:28:09,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-14 00:28:09,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-14 00:28:09,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=4511, Unknown=1, NotChecked=134, Total=4830 [2019-01-14 00:28:09,877 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 70 states. [2019-01-14 00:28:14,326 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 00:28:16,941 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 45 [2019-01-14 00:28:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:28:19,439 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-01-14 00:28:19,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-14 00:28:19,440 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 96 [2019-01-14 00:28:19,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:28:19,442 INFO L225 Difference]: With dead ends: 117 [2019-01-14 00:28:19,442 INFO L226 Difference]: Without dead ends: 117 [2019-01-14 00:28:19,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 69 SyntacticMatches, 11 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2194 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=571, Invalid=10562, Unknown=1, NotChecked=208, Total=11342 [2019-01-14 00:28:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-14 00:28:19,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2019-01-14 00:28:19,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 00:28:19,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2019-01-14 00:28:19,450 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 96 [2019-01-14 00:28:19,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:28:19,450 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2019-01-14 00:28:19,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-14 00:28:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2019-01-14 00:28:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-14 00:28:19,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:28:19,454 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:28:19,454 INFO L423 AbstractCegarLoop]: === Iteration 29 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:28:19,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:28:19,455 INFO L82 PathProgramCache]: Analyzing trace with hash -164766543, now seen corresponding path program 1 times [2019-01-14 00:28:19,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:28:19,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:28:19,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:28:19,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:28:19,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:28:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:28:19,849 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-14 00:28:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 00:28:22,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:28:22,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:28:22,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:28:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:28:22,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:28:23,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:28:23,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:28:23,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:28:23,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:28:23,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-14 00:28:23,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:28:23,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:28:23,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2019-01-14 00:28:23,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:28:23,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:28:23,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:28:23,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:28:23,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:28:23,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:28:23,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:28:23,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:28:23,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:28:23,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:59 [2019-01-14 00:28:24,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-01-14 00:28:24,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2019-01-14 00:28:24,406 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:28:24,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:28:24,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-01-14 00:28:24,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-01-14 00:28:24,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:28:24,439 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:28:24,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:28:24,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:65, output treesize:21 [2019-01-14 00:28:24,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2019-01-14 00:28:24,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:28:24,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2019-01-14 00:28:24,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:28:24,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:28:24,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2019-01-14 00:28:24,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:28:24,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2019-01-14 00:28:24,838 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:28:24,845 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:28:24,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:28:24,869 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:73 [2019-01-14 00:28:24,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-01-14 00:28:24,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2019-01-14 00:28:24,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:28:24,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:28:24,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-14 00:28:24,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 00:28:24,994 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:28:24,999 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:28:25,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:28:25,013 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:65, output treesize:21 [2019-01-14 00:29:23,452 WARN L181 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 00:29:23,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2019-01-14 00:29:23,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-14 00:29:23,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:29:23,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:29:23,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 72 [2019-01-14 00:29:23,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2019-01-14 00:29:23,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:29:23,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:29:23,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 00:29:23,553 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:139, output treesize:73 [2019-01-14 00:29:39,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-01-14 00:29:39,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 30 [2019-01-14 00:29:39,017 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:29:39,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:29:39,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2019-01-14 00:29:39,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:29:39,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 00:29:39,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:29:39,188 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:29:39,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2019-01-14 00:29:39,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2019-01-14 00:29:39,201 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-14 00:29:39,218 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:29:39,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-01-14 00:29:39,262 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:77, output treesize:72 [2019-01-14 00:29:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 00:29:48,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:29:48,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 33] total 74 [2019-01-14 00:29:48,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-14 00:29:48,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-14 00:29:48,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=5300, Unknown=30, NotChecked=0, Total=5550 [2019-01-14 00:29:48,204 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 75 states. [2019-01-14 00:30:18,949 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-01-14 00:30:32,142 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 64 [2019-01-14 00:30:50,403 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-01-14 00:31:01,553 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-01-14 00:31:01,808 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 72 [2019-01-14 00:31:08,256 WARN L181 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-01-14 00:31:28,370 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-01-14 00:31:28,681 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 68 [2019-01-14 00:31:38,633 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-01-14 00:31:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:31:40,901 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2019-01-14 00:31:40,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-14 00:31:40,902 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 96 [2019-01-14 00:31:40,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:31:40,903 INFO L225 Difference]: With dead ends: 115 [2019-01-14 00:31:40,904 INFO L226 Difference]: Without dead ends: 115 [2019-01-14 00:31:40,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 64 SyntacticMatches, 9 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2068 ImplicationChecksByTransitivity, 123.6s TimeCoverageRelationStatistics Valid=694, Invalid=11254, Unknown=42, NotChecked=0, Total=11990 [2019-01-14 00:31:40,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-14 00:31:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2019-01-14 00:31:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-14 00:31:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2019-01-14 00:31:40,908 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 96 [2019-01-14 00:31:40,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:31:40,909 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2019-01-14 00:31:40,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-14 00:31:40,909 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2019-01-14 00:31:40,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 00:31:40,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:31:40,910 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:31:40,910 INFO L423 AbstractCegarLoop]: === Iteration 30 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:31:40,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:31:40,911 INFO L82 PathProgramCache]: Analyzing trace with hash 586188626, now seen corresponding path program 1 times [2019-01-14 00:31:40,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:31:40,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:31:40,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:31:40,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:31:40,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:31:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:31:43,221 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-14 00:31:43,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:31:43,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:31:43,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:31:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:31:43,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:31:43,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:31:43,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:31:43,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-01-14 00:31:43,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:31:43,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:31:43,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:12 [2019-01-14 00:31:43,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:31:43,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:31:43,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:31:43,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:31:43,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:31:43,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2019-01-14 00:31:45,136 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2019-01-14 00:31:45,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-14 00:31:45,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:31:45,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-01-14 00:31:45,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:31:45,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:31:45,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:31:45,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-14 00:31:47,305 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (+ |c_sll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| .cse0) sll_update_at_~head.offset)))))) is different from true [2019-01-14 00:31:47,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-01-14 00:31:47,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-14 00:31:47,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:31:47,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:31:47,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:31:47,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:17 [2019-01-14 00:31:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2019-01-14 00:31:51,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:31:51,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 66 [2019-01-14 00:31:51,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-14 00:31:51,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-14 00:31:51,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=3826, Unknown=3, NotChecked=250, Total=4290 [2019-01-14 00:31:51,230 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand 66 states. [2019-01-14 00:32:02,839 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 00:32:03,227 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-01-14 00:32:13,771 WARN L181 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-01-14 00:32:16,298 WARN L181 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-01-14 00:32:16,725 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-01-14 00:32:25,990 WARN L181 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 36 DAG size of output: 20 [2019-01-14 00:32:28,309 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-14 00:32:29,076 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-14 00:32:29,598 WARN L181 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2019-01-14 00:32:29,993 WARN L181 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2019-01-14 00:32:30,395 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-01-14 00:32:30,724 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 00:32:31,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:32:31,341 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2019-01-14 00:32:31,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 00:32:31,343 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 99 [2019-01-14 00:32:31,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:32:31,345 INFO L225 Difference]: With dead ends: 115 [2019-01-14 00:32:31,345 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 00:32:31,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 90 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1901 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=541, Invalid=7471, Unknown=6, NotChecked=354, Total=8372 [2019-01-14 00:32:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 00:32:31,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2019-01-14 00:32:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-14 00:32:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2019-01-14 00:32:31,350 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 99 [2019-01-14 00:32:31,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:32:31,350 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2019-01-14 00:32:31,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-14 00:32:31,350 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2019-01-14 00:32:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-14 00:32:31,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:32:31,351 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:32:31,352 INFO L423 AbstractCegarLoop]: === Iteration 31 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:32:31,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:32:31,352 INFO L82 PathProgramCache]: Analyzing trace with hash 587516025, now seen corresponding path program 1 times [2019-01-14 00:32:31,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:32:31,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:32:31,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:31,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:32:31,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:32:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:32:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 00:32:33,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:32:33,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:32:33,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:32:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:32:33,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:32:33,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 00:32:33,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-01-14 00:32:33,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:32:33,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:32:33,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:32:33,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-01-14 00:32:33,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:32:33,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:32:33,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2019-01-14 00:32:33,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-01-14 00:32:33,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-01-14 00:32:33,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:33,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2019-01-14 00:32:36,085 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2019-01-14 00:32:36,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-01-14 00:32:36,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:32:36,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2019-01-14 00:32:36,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:36,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:36,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:36,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:19 [2019-01-14 00:32:36,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-01-14 00:32:36,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-01-14 00:32:36,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:36,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:36,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:36,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2019-01-14 00:32:38,399 WARN L860 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (+ |c_sll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| .cse0) sll_update_at_~head.offset)))))) is different from true [2019-01-14 00:32:38,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-14 00:32:38,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-14 00:32:38,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:32:38,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:38,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:32:38,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:16 [2019-01-14 00:32:38,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2019-01-14 00:32:38,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2019-01-14 00:32:38,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-01-14 00:32:38,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 00:32:38,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:32:38,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2019-01-14 00:32:39,001 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2019-01-14 00:32:39,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:32:39,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 59 [2019-01-14 00:32:39,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-14 00:32:39,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-14 00:32:39,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3135, Unknown=2, NotChecked=226, Total=3540 [2019-01-14 00:32:39,021 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand 60 states. [2019-01-14 00:32:51,869 WARN L181 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-01-14 00:32:57,384 WARN L181 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 36 DAG size of output: 20 [2019-01-14 00:33:00,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:33:00,688 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-01-14 00:33:00,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-14 00:33:00,690 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 99 [2019-01-14 00:33:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:33:00,691 INFO L225 Difference]: With dead ends: 111 [2019-01-14 00:33:00,691 INFO L226 Difference]: Without dead ends: 111 [2019-01-14 00:33:00,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 73 SyntacticMatches, 9 SemanticMatches, 85 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=519, Invalid=6626, Unknown=3, NotChecked=334, Total=7482 [2019-01-14 00:33:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-14 00:33:00,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2019-01-14 00:33:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 00:33:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2019-01-14 00:33:00,696 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 99 [2019-01-14 00:33:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:33:00,697 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2019-01-14 00:33:00,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-14 00:33:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2019-01-14 00:33:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-14 00:33:00,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:33:00,701 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:33:00,701 INFO L423 AbstractCegarLoop]: === Iteration 32 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:33:00,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:33:00,702 INFO L82 PathProgramCache]: Analyzing trace with hash 698243733, now seen corresponding path program 2 times [2019-01-14 00:33:00,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:33:00,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:33:00,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:33:00,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:33:00,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:33:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:33:01,428 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2019-01-14 00:33:02,271 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-14 00:33:02,735 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-14 00:33:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 00:33:03,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:33:03,538 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:33:03,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:33:03,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:33:03,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:33:03,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:33:03,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:33:03,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:33:03,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:03,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:03,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:33:03,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:33:03,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:03,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:03,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:03,837 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-01-14 00:33:04,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:04,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:04,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 00:33:04,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:04,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 00:33:04,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-14 00:33:04,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:04,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-01-14 00:33:04,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:04,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:04,280 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:04,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-14 00:33:04,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-14 00:33:04,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:04,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2019-01-14 00:33:04,317 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:04,323 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:04,332 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:04,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:04,351 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:78, output treesize:50 [2019-01-14 00:33:04,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-14 00:33:04,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2019-01-14 00:33:04,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:04,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:04,551 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:33:04,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2019-01-14 00:33:04,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2019-01-14 00:33:04,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:04,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:04,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:33:04,584 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:73, output treesize:56 [2019-01-14 00:33:05,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2019-01-14 00:33:05,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 15 [2019-01-14 00:33:05,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 00:33:05,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:33:05,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2019-01-14 00:33:05,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 38 [2019-01-14 00:33:05,302 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:33:05,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:33:05,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2019-01-14 00:33:05,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2019-01-14 00:33:05,338 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:33:05,347 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:33:05,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-01-14 00:33:05,392 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:86, output treesize:122 [2019-01-14 00:33:05,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 135 [2019-01-14 00:33:05,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 101 [2019-01-14 00:33:05,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 00:33:06,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 107 [2019-01-14 00:33:06,314 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 00:33:06,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 74 [2019-01-14 00:33:06,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:06,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 00:33:06,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 117 [2019-01-14 00:33:06,725 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 00:33:06,726 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:06,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 29 [2019-01-14 00:33:06,861 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:06,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 62 [2019-01-14 00:33:06,998 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-14 00:33:07,035 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:33:07,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 58 [2019-01-14 00:33:07,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2019-01-14 00:33:07,045 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:07,057 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:07,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 84 [2019-01-14 00:33:07,070 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:33:07,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2019-01-14 00:33:07,072 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:07,099 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:07,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 159 [2019-01-14 00:33:07,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 140 treesize of output 137 [2019-01-14 00:33:07,260 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-14 00:33:08,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 128 [2019-01-14 00:33:08,040 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2019-01-14 00:33:08,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 101 [2019-01-14 00:33:08,343 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:08,540 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2019-01-14 00:33:08,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 132 [2019-01-14 00:33:08,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:08,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 103 [2019-01-14 00:33:08,820 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 4 xjuncts. [2019-01-14 00:33:08,875 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 00:33:08,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 83 [2019-01-14 00:33:08,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:08,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 18 [2019-01-14 00:33:08,892 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:08,906 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:08,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 74 [2019-01-14 00:33:08,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:08,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:08,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 61 [2019-01-14 00:33:08,922 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:08,943 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:08,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 105 [2019-01-14 00:33:08,956 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:33:08,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2019-01-14 00:33:08,958 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:08,970 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:09,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 154 [2019-01-14 00:33:09,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:09,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 111 treesize of output 148 [2019-01-14 00:33:09,120 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 3 xjuncts. [2019-01-14 00:33:09,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2019-01-14 00:33:09,333 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:09,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 83 [2019-01-14 00:33:09,444 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2019-01-14 00:33:09,567 INFO L267 ElimStorePlain]: Start of recursive call 26: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 00:33:09,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2019-01-14 00:33:09,767 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 6 variables, input treesize:266, output treesize:501 [2019-01-14 00:33:10,190 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 77 [2019-01-14 00:33:13,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:13,176 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:33:13,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 69 [2019-01-14 00:33:13,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 00:33:13,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 00:33:13,205 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:33:13,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2019-01-14 00:33:13,206 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:33:13,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 00:33:13,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2019-01-14 00:33:13,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-14 00:33:13,252 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:13,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 00:33:13,268 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-14 00:33:13,275 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 00:33:13,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2019-01-14 00:33:13,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-14 00:33:13,284 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:13,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:13,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2019-01-14 00:33:13,297 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:13,300 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:13,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 00:33:13,326 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:82, output treesize:28 [2019-01-14 00:33:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 00:33:13,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:33:13,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 42] total 66 [2019-01-14 00:33:13,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-14 00:33:13,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-14 00:33:13,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=4024, Unknown=25, NotChecked=0, Total=4290 [2019-01-14 00:33:13,598 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 66 states. [2019-01-14 00:33:14,750 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-01-14 00:33:21,423 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 53 [2019-01-14 00:33:21,904 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 73 [2019-01-14 00:33:22,490 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 73 [2019-01-14 00:33:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:33:25,274 INFO L93 Difference]: Finished difference Result 184 states and 192 transitions. [2019-01-14 00:33:25,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-14 00:33:25,276 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 102 [2019-01-14 00:33:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:33:25,277 INFO L225 Difference]: With dead ends: 184 [2019-01-14 00:33:25,277 INFO L226 Difference]: Without dead ends: 184 [2019-01-14 00:33:25,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 69 SyntacticMatches, 18 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2348 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=613, Invalid=8861, Unknown=32, NotChecked=0, Total=9506 [2019-01-14 00:33:25,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-14 00:33:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 168. [2019-01-14 00:33:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-14 00:33:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 176 transitions. [2019-01-14 00:33:25,286 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 176 transitions. Word has length 102 [2019-01-14 00:33:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:33:25,289 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 176 transitions. [2019-01-14 00:33:25,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-14 00:33:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 176 transitions. [2019-01-14 00:33:25,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-14 00:33:25,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:33:25,293 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:33:25,293 INFO L423 AbstractCegarLoop]: === Iteration 33 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:33:25,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:33:25,294 INFO L82 PathProgramCache]: Analyzing trace with hash 851116877, now seen corresponding path program 2 times [2019-01-14 00:33:25,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:33:25,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:33:25,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:33:25,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:33:25,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:33:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:33:25,853 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2019-01-14 00:33:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 00:33:27,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:33:27,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:33:27,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:33:27,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:33:27,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:33:27,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:33:27,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 00:33:27,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 00:33:27,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:27,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:27,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:27,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:51 [2019-01-14 00:33:28,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:28,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2019-01-14 00:33:28,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2019-01-14 00:33:28,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:28,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:28,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-01-14 00:33:28,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-01-14 00:33:28,383 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:33:28,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:33:28,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:33:28,401 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:18 [2019-01-14 00:33:39,688 WARN L181 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 00:33:39,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2019-01-14 00:33:39,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 36 [2019-01-14 00:33:39,715 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:33:39,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:33:39,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-14 00:33:39,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:110 [2019-01-14 00:33:40,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:40,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2019-01-14 00:33:40,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2019-01-14 00:33:40,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:40,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:40,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:40,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2019-01-14 00:33:40,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:40,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2019-01-14 00:33:40,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:40,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:40,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2019-01-14 00:33:40,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-01-14 00:33:40,103 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:33:40,111 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:33:40,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-14 00:33:40,131 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:79, output treesize:37 [2019-01-14 00:33:57,341 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 00:33:57,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 87 [2019-01-14 00:33:57,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2019-01-14 00:33:57,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:57,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:57,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 93 [2019-01-14 00:33:57,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 69 [2019-01-14 00:33:57,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:57,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:57,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:57,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 83 [2019-01-14 00:33:57,636 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-14 00:33:57,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 00:33:57,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-14 00:33:57,825 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:173, output treesize:169 [2019-01-14 00:33:58,115 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-01-14 00:33:58,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:58,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2019-01-14 00:33:58,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:58,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2019-01-14 00:33:58,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:58,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:58,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:58,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2019-01-14 00:33:58,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:58,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2019-01-14 00:33:58,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:58,257 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:58,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:58,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2019-01-14 00:33:58,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:58,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2019-01-14 00:33:58,304 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:58,313 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:58,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-01-14 00:33:58,341 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:119, output treesize:70 [2019-01-14 00:33:58,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:58,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2019-01-14 00:33:58,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2019-01-14 00:33:58,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:58,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:58,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:58,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2019-01-14 00:33:58,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:58,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2019-01-14 00:33:58,789 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:58,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:58,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:58,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2019-01-14 00:33:58,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 00:33:58,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2019-01-14 00:33:58,844 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:58,851 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 00:33:58,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-01-14 00:33:58,880 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:119, output treesize:70 [2019-01-14 00:33:59,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 00:33:59,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2019-01-14 00:33:59,605 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 00:33:59,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-01-14 00:33:59,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:33:59,614 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 00:33:59,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 00:33:59,625 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:179, output treesize:26 [2019-01-14 00:34:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 24 refuted. 2 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 00:34:14,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:34:14,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 61 [2019-01-14 00:34:14,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-14 00:34:14,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-14 00:34:14,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3548, Unknown=33, NotChecked=0, Total=3782 [2019-01-14 00:34:14,026 INFO L87 Difference]: Start difference. First operand 168 states and 176 transitions. Second operand 62 states. [2019-01-14 00:34:39,623 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-01-14 00:35:04,592 WARN L181 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-01-14 00:35:19,489 WARN L181 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 00:35:37,597 WARN L181 SmtUtils]: Spent 746.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 00:35:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:35:45,432 INFO L93 Difference]: Finished difference Result 201 states and 208 transitions. [2019-01-14 00:35:45,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-14 00:35:45,433 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 105 [2019-01-14 00:35:45,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:35:45,434 INFO L225 Difference]: With dead ends: 201 [2019-01-14 00:35:45,434 INFO L226 Difference]: Without dead ends: 131 [2019-01-14 00:35:45,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 80 SyntacticMatches, 12 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 61.2s TimeCoverageRelationStatistics Valid=648, Invalid=9216, Unknown=36, NotChecked=0, Total=9900 [2019-01-14 00:35:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-14 00:35:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2019-01-14 00:35:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-14 00:35:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2019-01-14 00:35:45,443 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 105 [2019-01-14 00:35:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:35:45,443 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2019-01-14 00:35:45,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-14 00:35:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2019-01-14 00:35:45,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-14 00:35:45,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:35:45,449 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:35:45,449 INFO L423 AbstractCegarLoop]: === Iteration 34 === [sll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-14 00:35:45,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:35:45,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1543004275, now seen corresponding path program 3 times [2019-01-14 00:35:45,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:35:45,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:35:45,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:35:45,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:35:45,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:35:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:35:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-01-14 00:35:45,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:35:45,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:35:45,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 00:35:45,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 00:35:45,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:35:45,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:35:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-01-14 00:35:45,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:35:45,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 00:35:45,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:35:45,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:35:45,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:35:45,778 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 7 states. [2019-01-14 00:35:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:35:45,823 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-01-14 00:35:45,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:35:45,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-01-14 00:35:45,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:35:45,826 INFO L225 Difference]: With dead ends: 37 [2019-01-14 00:35:45,826 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 00:35:45,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:35:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 00:35:45,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 00:35:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 00:35:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 00:35:45,827 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2019-01-14 00:35:45,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:35:45,827 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 00:35:45,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:35:45,827 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 00:35:45,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 00:35:45,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:35:45 BoogieIcfgContainer [2019-01-14 00:35:45,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 00:35:45,834 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 00:35:45,834 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 00:35:45,834 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 00:35:45,836 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:23:22" (3/4) ... [2019-01-14 00:35:45,840 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 00:35:45,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 00:35:45,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-14 00:35:45,847 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2019-01-14 00:35:45,847 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_update_at [2019-01-14 00:35:45,847 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 00:35:45,847 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 00:35:45,847 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2019-01-14 00:35:45,847 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_get_data_at [2019-01-14 00:35:45,847 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 00:35:45,848 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-01-14 00:35:45,857 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-01-14 00:35:45,857 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-01-14 00:35:45,858 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 00:35:45,902 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 00:35:45,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 00:35:45,903 INFO L168 Benchmark]: Toolchain (without parser) took 744862.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 950.0 MB in the beginning and 1.0 GB in the end (delta: -54.7 MB). Peak memory consumption was 87.4 MB. Max. memory is 11.5 GB. [2019-01-14 00:35:45,903 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:35:45,907 INFO L168 Benchmark]: CACSL2BoogieTranslator took 677.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2019-01-14 00:35:45,907 INFO L168 Benchmark]: Boogie Preprocessor took 72.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-14 00:35:45,907 INFO L168 Benchmark]: RCFGBuilder took 916.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. [2019-01-14 00:35:45,908 INFO L168 Benchmark]: TraceAbstraction took 743123.03 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -6.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.1 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. [2019-01-14 00:35:45,908 INFO L168 Benchmark]: Witness Printer took 68.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 00:35:45,910 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 677.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 916.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 743123.03 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -6.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.1 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. * Witness Printer took 68.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 602]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 95 locations, 20 error locations. SAFE Result, 743.0s OverallTime, 34 OverallIterations, 3 TraceHistogramMax, 456.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2138 SDtfs, 3819 SDslu, 16024 SDs, 0 SdLazy, 31176 SolverSat, 1060 SolverUnsat, 191 SolverUnknown, 0 SolverNotchecked, 302.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2566 GetRequests, 1333 SyntacticMatches, 105 SemanticMatches, 1128 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 16199 ImplicationChecksByTransitivity, 417.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 305 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 282.9s InterpolantComputationTime, 3748 NumberOfCodeBlocks, 3748 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 3694 ConstructedInterpolants, 353 QuantifiedInterpolants, 4030423 SizeOfPredicates, 285 NumberOfNonLiveVariables, 7282 ConjunctsInSsa, 1081 ConjunctsInUnsatCore, 54 InterpolantComputations, 18 PerfectInterpolantSequences, 1161/1640 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...