./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/list-simple/sll2n_remove_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 a3189d7d4e71631c5441bd903e5049703e07b8be ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 19:38:44,112 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 19:38:44,114 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 19:38:44,130 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 19:38:44,132 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 19:38:44,133 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 19:38:44,136 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 19:38:44,138 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 19:38:44,140 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 19:38:44,143 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 19:38:44,145 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 19:38:44,146 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 19:38:44,147 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 19:38:44,147 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 19:38:44,149 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 19:38:44,151 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 19:38:44,152 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 19:38:44,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 19:38:44,156 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 19:38:44,162 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 19:38:44,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 19:38:44,170 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 19:38:44,173 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 19:38:44,173 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 19:38:44,174 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 19:38:44,174 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 19:38:44,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 19:38:44,179 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 19:38:44,181 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 19:38:44,182 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 19:38:44,182 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 19:38:44,182 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 19:38:44,183 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 19:38:44,183 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 19:38:44,184 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 19:38:44,185 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 19:38:44,185 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 19:38:44,217 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 19:38:44,219 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 19:38:44,220 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 19:38:44,222 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 19:38:44,222 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 19:38:44,222 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 19:38:44,223 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 19:38:44,223 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 19:38:44,223 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 19:38:44,223 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 19:38:44,223 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 19:38:44,223 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 19:38:44,225 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 19:38:44,225 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 19:38:44,225 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 19:38:44,225 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 19:38:44,226 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 19:38:44,226 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 19:38:44,226 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 19:38:44,226 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 19:38:44,226 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 19:38:44,229 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 19:38:44,229 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 19:38:44,229 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 19:38:44,230 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 19:38:44,230 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 19:38:44,231 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 -> a3189d7d4e71631c5441bd903e5049703e07b8be [2019-01-01 19:38:44,296 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 19:38:44,313 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 19:38:44,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 19:38:44,321 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 19:38:44,322 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 19:38:44,323 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2019-01-01 19:38:44,385 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc3db95d1/a5b81c3d5eed48d2aafb75fb76e0299c/FLAGd6b99e899 [2019-01-01 19:38:44,849 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 19:38:44,850 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2019-01-01 19:38:44,877 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc3db95d1/a5b81c3d5eed48d2aafb75fb76e0299c/FLAGd6b99e899 [2019-01-01 19:38:45,159 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc3db95d1/a5b81c3d5eed48d2aafb75fb76e0299c [2019-01-01 19:38:45,162 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 19:38:45,164 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 19:38:45,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 19:38:45,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 19:38:45,169 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 19:38:45,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:38:45" (1/1) ... [2019-01-01 19:38:45,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce7d925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:45, skipping insertion in model container [2019-01-01 19:38:45,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:38:45" (1/1) ... [2019-01-01 19:38:45,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 19:38:45,242 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 19:38:45,655 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:38:45,671 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 19:38:45,820 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:38:45,875 INFO L195 MainTranslator]: Completed translation [2019-01-01 19:38:45,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:45 WrapperNode [2019-01-01 19:38:45,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 19:38:45,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 19:38:45,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 19:38:45,877 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 19:38:45,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:45" (1/1) ... [2019-01-01 19:38:45,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:45" (1/1) ... [2019-01-01 19:38:45,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:45" (1/1) ... [2019-01-01 19:38:45,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:45" (1/1) ... [2019-01-01 19:38:45,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:45" (1/1) ... [2019-01-01 19:38:45,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:45" (1/1) ... [2019-01-01 19:38:45,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:45" (1/1) ... [2019-01-01 19:38:45,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 19:38:45,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 19:38:45,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 19:38:45,948 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 19:38:45,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 19:38:46,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 19:38:46,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 19:38:46,007 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 19:38:46,007 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 19:38:46,007 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-01 19:38:46,007 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-01-01 19:38:46,007 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-01-01 19:38:46,007 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_remove_first [2019-01-01 19:38:46,008 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 19:38:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 19:38:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 19:38:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 19:38:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 19:38:46,009 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 19:38:46,009 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 19:38:46,009 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 19:38:46,009 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 19:38:46,009 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 19:38:46,009 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 19:38:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 19:38:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 19:38:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 19:38:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 19:38:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 19:38:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 19:38:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 19:38:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 19:38:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 19:38:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 19:38:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 19:38:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 19:38:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 19:38:46,014 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 19:38:46,014 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 19:38:46,014 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 19:38:46,014 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 19:38:46,014 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 19:38:46,014 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 19:38:46,014 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 19:38:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 19:38:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 19:38:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 19:38:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 19:38:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 19:38:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 19:38:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 19:38:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 19:38:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 19:38:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 19:38:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 19:38:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 19:38:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 19:38:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 19:38:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 19:38:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 19:38:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 19:38:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 19:38:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 19:38:46,019 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 19:38:46,019 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 19:38:46,019 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 19:38:46,019 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 19:38:46,019 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 19:38:46,019 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 19:38:46,019 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 19:38:46,021 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 19:38:46,021 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 19:38:46,022 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 19:38:46,022 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 19:38:46,022 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 19:38:46,022 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-01 19:38:46,022 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 19:38:46,022 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 19:38:46,022 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-01 19:38:46,022 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 19:38:46,022 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 19:38:46,024 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-01 19:38:46,024 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 19:38:46,024 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 19:38:46,024 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 19:38:46,024 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 19:38:46,025 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 19:38:46,025 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 19:38:46,025 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 19:38:46,025 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 19:38:46,026 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 19:38:46,026 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 19:38:46,026 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 19:38:46,026 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 19:38:46,027 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 19:38:46,027 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 19:38:46,027 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 19:38:46,027 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 19:38:46,027 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 19:38:46,027 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 19:38:46,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 19:38:46,028 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 19:38:46,028 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 19:38:46,028 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 19:38:46,028 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 19:38:46,028 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 19:38:46,028 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 19:38:46,028 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 19:38:46,028 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 19:38:46,030 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 19:38:46,031 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 19:38:46,031 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 19:38:46,031 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 19:38:46,031 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 19:38:46,031 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 19:38:46,031 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 19:38:46,031 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 19:38:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 19:38:46,033 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 19:38:46,033 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 19:38:46,033 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-01 19:38:46,033 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-01-01 19:38:46,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 19:38:46,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 19:38:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 19:38:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-01-01 19:38:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure sll_remove_first [2019-01-01 19:38:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 19:38:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 19:38:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 19:38:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 19:38:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-01 19:38:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 19:38:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 19:38:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 19:38:46,874 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 19:38:46,874 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-01 19:38:46,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:38:46 BoogieIcfgContainer [2019-01-01 19:38:46,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 19:38:46,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 19:38:46,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 19:38:46,880 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 19:38:46,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 07:38:45" (1/3) ... [2019-01-01 19:38:46,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:38:46, skipping insertion in model container [2019-01-01 19:38:46,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:38:45" (2/3) ... [2019-01-01 19:38:46,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:38:46, skipping insertion in model container [2019-01-01 19:38:46,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:38:46" (3/3) ... [2019-01-01 19:38:46,885 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2019-01-01 19:38:46,897 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 19:38:46,906 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-01-01 19:38:46,930 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-01-01 19:38:46,962 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 19:38:46,963 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 19:38:46,963 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 19:38:46,963 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 19:38:46,963 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 19:38:46,964 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 19:38:46,964 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 19:38:46,964 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 19:38:46,964 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 19:38:46,980 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2019-01-01 19:38:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 19:38:46,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:46,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:38:46,995 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:47,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:47,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1645367829, now seen corresponding path program 1 times [2019-01-01 19:38:47,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:47,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:47,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:47,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:47,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:38:47,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:38:47,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:38:47,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:38:47,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:38:47,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:38:47,277 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2019-01-01 19:38:47,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:38:47,540 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-01-01 19:38:47,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:38:47,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-01 19:38:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:38:47,551 INFO L225 Difference]: With dead ends: 67 [2019-01-01 19:38:47,552 INFO L226 Difference]: Without dead ends: 60 [2019-01-01 19:38:47,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:38:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-01 19:38:47,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-01 19:38:47,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-01 19:38:47,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-01-01 19:38:47,596 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 13 [2019-01-01 19:38:47,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:38:47,596 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-01-01 19:38:47,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:38:47,597 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-01-01 19:38:47,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 19:38:47,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:47,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:38:47,598 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:47,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:47,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1645367828, now seen corresponding path program 1 times [2019-01-01 19:38:47,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:47,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:47,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:47,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:47,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:38:47,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:38:47,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:38:47,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:38:47,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:38:47,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:38:47,749 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 3 states. [2019-01-01 19:38:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:38:47,816 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-01-01 19:38:47,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:38:47,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-01 19:38:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:38:47,819 INFO L225 Difference]: With dead ends: 58 [2019-01-01 19:38:47,819 INFO L226 Difference]: Without dead ends: 58 [2019-01-01 19:38:47,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:38:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-01 19:38:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-01 19:38:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-01 19:38:47,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-01-01 19:38:47,831 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 13 [2019-01-01 19:38:47,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:38:47,831 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-01-01 19:38:47,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:38:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-01-01 19:38:47,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 19:38:47,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:47,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:38:47,833 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:47,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:47,833 INFO L82 PathProgramCache]: Analyzing trace with hash -247912000, now seen corresponding path program 1 times [2019-01-01 19:38:47,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:47,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:47,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:47,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:47,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:38:47,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:38:47,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 19:38:47,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 19:38:47,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 19:38:47,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 19:38:47,891 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 4 states. [2019-01-01 19:38:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:38:47,932 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-01-01 19:38:47,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 19:38:47,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-01 19:38:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:38:47,937 INFO L225 Difference]: With dead ends: 61 [2019-01-01 19:38:47,938 INFO L226 Difference]: Without dead ends: 61 [2019-01-01 19:38:47,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:38:47,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-01 19:38:47,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-01-01 19:38:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-01 19:38:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-01 19:38:47,951 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 15 [2019-01-01 19:38:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:38:47,951 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-01 19:38:47,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 19:38:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-01 19:38:47,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 19:38:47,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:47,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:38:47,954 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:47,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:47,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2020128309, now seen corresponding path program 1 times [2019-01-01 19:38:47,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:47,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:47,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:47,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:47,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:38:48,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:38:48,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:38:48,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:38:48,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:38:48,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:38:48,068 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 5 states. [2019-01-01 19:38:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:38:48,413 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-01-01 19:38:48,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:38:48,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-01 19:38:48,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:38:48,415 INFO L225 Difference]: With dead ends: 70 [2019-01-01 19:38:48,416 INFO L226 Difference]: Without dead ends: 67 [2019-01-01 19:38:48,417 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-01 19:38:48,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-01 19:38:48,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2019-01-01 19:38:48,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-01 19:38:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-01-01 19:38:48,426 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 17 [2019-01-01 19:38:48,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:38:48,427 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-01-01 19:38:48,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:38:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-01-01 19:38:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 19:38:48,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:48,429 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-01 19:38:48,429 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:48,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:48,430 INFO L82 PathProgramCache]: Analyzing trace with hash -278961335, now seen corresponding path program 1 times [2019-01-01 19:38:48,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:48,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:48,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:48,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:48,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:38:48,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:38:48,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:38:48,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:38:48,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:38:48,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:38:48,616 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 6 states. [2019-01-01 19:38:48,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:38:48,879 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-01-01 19:38:48,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:38:48,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-01 19:38:48,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:38:48,885 INFO L225 Difference]: With dead ends: 60 [2019-01-01 19:38:48,885 INFO L226 Difference]: Without dead ends: 60 [2019-01-01 19:38:48,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:38:48,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-01 19:38:48,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-01-01 19:38:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-01 19:38:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-01 19:38:48,891 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 19 [2019-01-01 19:38:48,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:38:48,892 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-01 19:38:48,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:38:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-01 19:38:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 19:38:48,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:48,893 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-01 19:38:48,896 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:48,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:48,896 INFO L82 PathProgramCache]: Analyzing trace with hash -278961334, now seen corresponding path program 1 times [2019-01-01 19:38:48,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:48,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:48,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:48,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:48,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:38:49,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:38:49,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:38:49,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:38:49,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:38:49,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:38:49,092 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 6 states. [2019-01-01 19:38:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:38:49,289 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-01-01 19:38:49,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:38:49,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-01 19:38:49,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:38:49,292 INFO L225 Difference]: With dead ends: 59 [2019-01-01 19:38:49,292 INFO L226 Difference]: Without dead ends: 59 [2019-01-01 19:38:49,292 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-01 19:38:49,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-01 19:38:49,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-01-01 19:38:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-01 19:38:49,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-01-01 19:38:49,298 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 19 [2019-01-01 19:38:49,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:38:49,298 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-01-01 19:38:49,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:38:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-01-01 19:38:49,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 19:38:49,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:49,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:38:49,300 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:49,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:49,301 INFO L82 PathProgramCache]: Analyzing trace with hash 312386304, now seen corresponding path program 1 times [2019-01-01 19:38:49,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:49,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:49,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:49,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:49,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:49,446 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-01 19:38:49,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:38:49,447 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:38:49,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:49,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:38:49,591 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-01 19:38:49,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:38:49,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 19:38:49,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:38:49,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:38:49,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:38:49,629 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 6 states. [2019-01-01 19:38:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:38:49,779 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2019-01-01 19:38:49,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:38:49,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-01-01 19:38:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:38:49,785 INFO L225 Difference]: With dead ends: 72 [2019-01-01 19:38:49,785 INFO L226 Difference]: Without dead ends: 69 [2019-01-01 19:38:49,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:38:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-01 19:38:49,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2019-01-01 19:38:49,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-01 19:38:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-01-01 19:38:49,796 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 30 [2019-01-01 19:38:49,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:38:49,797 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-01-01 19:38:49,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:38:49,797 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-01-01 19:38:49,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-01 19:38:49,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:49,799 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] [2019-01-01 19:38:49,800 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:49,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:49,800 INFO L82 PathProgramCache]: Analyzing trace with hash -923097109, now seen corresponding path program 2 times [2019-01-01 19:38:49,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:49,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:49,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:49,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:49,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-01 19:38:50,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:38:50,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:38:50,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:38:50,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 19:38:50,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:38:50,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:38:50,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 19:38:50,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:38:50,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:38:50,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-01 19:38:50,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:38:50,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:38:50,655 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-01 19:38:50,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-01 19:38:51,028 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |c_old(#length)| |node_create_#t~malloc2.base| 8) |c_#length|) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|))) is different from true [2019-01-01 19:38:51,571 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (store (store |c_old(#length)| |node_create_#t~malloc2.base| 8) v_prenex_1 8) |c_#length|) (< |c_#StackHeapBarrier| v_prenex_1) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|))) is different from true [2019-01-01 19:38:51,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:38:51,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:38:51,605 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-01 19:38:51,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:38:51,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 30 [2019-01-01 19:38:51,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:38:51,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:38:51,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:38:51,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2019-01-01 19:38:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2019-01-01 19:38:51,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:38:51,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-01 19:38:51,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 19:38:51,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 19:38:51,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=106, Unknown=2, NotChecked=42, Total=182 [2019-01-01 19:38:51,946 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 14 states. [2019-01-01 19:38:53,535 WARN L181 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 10 [2019-01-01 19:38:56,850 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2019-01-01 19:38:59,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:38:59,109 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-01-01 19:38:59,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 19:38:59,110 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2019-01-01 19:38:59,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:38:59,111 INFO L225 Difference]: With dead ends: 101 [2019-01-01 19:38:59,112 INFO L226 Difference]: Without dead ends: 101 [2019-01-01 19:38:59,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=61, Invalid=207, Unknown=12, NotChecked=62, Total=342 [2019-01-01 19:38:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-01 19:38:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2019-01-01 19:38:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-01 19:38:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2019-01-01 19:38:59,126 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 43 [2019-01-01 19:38:59,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:38:59,131 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2019-01-01 19:38:59,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 19:38:59,131 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2019-01-01 19:38:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-01 19:38:59,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:38:59,133 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] [2019-01-01 19:38:59,133 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:38:59,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:38:59,134 INFO L82 PathProgramCache]: Analyzing trace with hash -923097110, now seen corresponding path program 1 times [2019-01-01 19:38:59,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:38:59,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:38:59,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:59,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:38:59,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:38:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:59,660 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:38:59,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:38:59,661 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-01 19:38:59,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:38:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:38:59,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:38:59,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 19:38:59,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:38:59,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:38:59,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 19:38:59,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:38:59,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:38:59,770 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-01 19:38:59,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-01 19:39:00,144 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |c_old(#valid)| |node_create_#t~malloc2.base| 1) |c_#valid|) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|))) is different from true [2019-01-01 19:39:00,696 WARN L181 SmtUtils]: Spent 455.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 19:39:01,180 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| Int) (sll_create_~new_head~0.base Int)) (and (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| 1) sll_create_~new_head~0.base 1)) (< |c_#StackHeapBarrier| sll_create_~new_head~0.base) (< |c_#StackHeapBarrier| |node_create_#t~malloc2.base|))) is different from true [2019-01-01 19:39:01,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:01,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-01 19:39:01,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:01,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-01 19:39:01,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:01,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:01,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:01,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:26 [2019-01-01 19:39:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 14 not checked. [2019-01-01 19:39:01,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:39:01,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-01-01 19:39:01,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 19:39:01,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 19:39:01,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=252, Unknown=2, NotChecked=66, Total=380 [2019-01-01 19:39:01,767 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand 20 states. [2019-01-01 19:39:03,165 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-01-01 19:39:05,271 WARN L181 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-01-01 19:39:07,022 WARN L181 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 10 [2019-01-01 19:39:14,080 WARN L181 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 30 DAG size of output: 13 [2019-01-01 19:39:18,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:18,728 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2019-01-01 19:39:18,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 19:39:18,730 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2019-01-01 19:39:18,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:18,732 INFO L225 Difference]: With dead ends: 104 [2019-01-01 19:39:18,732 INFO L226 Difference]: Without dead ends: 104 [2019-01-01 19:39:18,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=145, Invalid=596, Unknown=23, NotChecked=106, Total=870 [2019-01-01 19:39:18,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-01 19:39:18,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2019-01-01 19:39:18,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-01 19:39:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2019-01-01 19:39:18,743 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 43 [2019-01-01 19:39:18,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:18,743 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2019-01-01 19:39:18,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 19:39:18,743 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2019-01-01 19:39:18,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 19:39:18,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:18,747 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-01 19:39:18,747 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:18,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1448760713, now seen corresponding path program 1 times [2019-01-01 19:39:18,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:18,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:18,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:18,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:18,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 19:39:18,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:39:18,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 19:39:18,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 19:39:18,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 19:39:18,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:39:18,923 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand 13 states. [2019-01-01 19:39:19,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:19,339 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2019-01-01 19:39:19,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 19:39:19,340 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-01-01 19:39:19,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:19,341 INFO L225 Difference]: With dead ends: 114 [2019-01-01 19:39:19,342 INFO L226 Difference]: Without dead ends: 114 [2019-01-01 19:39:19,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-01-01 19:39:19,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-01 19:39:19,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2019-01-01 19:39:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-01 19:39:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2019-01-01 19:39:19,351 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 44 [2019-01-01 19:39:19,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:19,353 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2019-01-01 19:39:19,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 19:39:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2019-01-01 19:39:19,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-01 19:39:19,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:19,354 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-01 19:39:19,354 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:19,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:19,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1448760714, now seen corresponding path program 1 times [2019-01-01 19:39:19,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:19,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:19,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:19,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:19,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:39:19,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:39:19,928 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-01 19:39:19,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:19,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:39:20,451 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-01 19:39:20,456 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 19 treesize of output 11 [2019-01-01 19:39:20,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:20,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:20,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2019-01-01 19:39:20,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-01-01 19:39:20,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:20,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:20,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:20,491 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:13 [2019-01-01 19:39:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 19:39:20,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:39:20,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 28 [2019-01-01 19:39:20,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-01 19:39:20,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-01 19:39:20,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-01-01 19:39:20,567 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand 29 states. [2019-01-01 19:39:23,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:23,068 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2019-01-01 19:39:23,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 19:39:23,069 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2019-01-01 19:39:23,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:23,071 INFO L225 Difference]: With dead ends: 117 [2019-01-01 19:39:23,071 INFO L226 Difference]: Without dead ends: 117 [2019-01-01 19:39:23,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=134, Invalid=1348, Unknown=0, NotChecked=0, Total=1482 [2019-01-01 19:39:23,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-01 19:39:23,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 97. [2019-01-01 19:39:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-01 19:39:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2019-01-01 19:39:23,087 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 44 [2019-01-01 19:39:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:23,088 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2019-01-01 19:39:23,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-01 19:39:23,088 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2019-01-01 19:39:23,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 19:39:23,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:23,089 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-01 19:39:23,089 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:23,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:23,090 INFO L82 PathProgramCache]: Analyzing trace with hash -95902865, now seen corresponding path program 1 times [2019-01-01 19:39:23,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:23,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:23,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:23,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:23,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:23,862 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-01 19:39:23,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:39:23,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 19:39:23,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 19:39:23,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 19:39:23,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:39:23,864 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand 13 states. [2019-01-01 19:39:24,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:24,482 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2019-01-01 19:39:24,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 19:39:24,483 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-01-01 19:39:24,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:24,485 INFO L225 Difference]: With dead ends: 116 [2019-01-01 19:39:24,485 INFO L226 Difference]: Without dead ends: 116 [2019-01-01 19:39:24,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-01-01 19:39:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-01 19:39:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2019-01-01 19:39:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-01 19:39:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2019-01-01 19:39:24,495 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 47 [2019-01-01 19:39:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:24,495 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2019-01-01 19:39:24,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 19:39:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2019-01-01 19:39:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 19:39:24,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:24,498 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] [2019-01-01 19:39:24,499 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:24,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:24,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1321978602, now seen corresponding path program 1 times [2019-01-01 19:39:24,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:24,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:24,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:24,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:24,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:24,723 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-01 19:39:24,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:39:24,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 19:39:24,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 19:39:24,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 19:39:24,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:39:24,725 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand 13 states. [2019-01-01 19:39:25,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:25,159 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2019-01-01 19:39:25,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 19:39:25,160 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-01-01 19:39:25,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:25,162 INFO L225 Difference]: With dead ends: 115 [2019-01-01 19:39:25,162 INFO L226 Difference]: Without dead ends: 115 [2019-01-01 19:39:25,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-01-01 19:39:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-01 19:39:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2019-01-01 19:39:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-01 19:39:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2019-01-01 19:39:25,172 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 48 [2019-01-01 19:39:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:25,172 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2019-01-01 19:39:25,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 19:39:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2019-01-01 19:39:25,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-01 19:39:25,173 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:25,174 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] [2019-01-01 19:39:25,174 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:25,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:25,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1968336175, now seen corresponding path program 1 times [2019-01-01 19:39:25,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:25,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:25,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:25,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:25,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:25,281 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-01 19:39:25,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:39:25,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 19:39:25,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:39:25,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:39:25,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:39:25,283 INFO L87 Difference]: Start difference. First operand 105 states and 123 transitions. Second operand 5 states. [2019-01-01 19:39:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:25,371 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2019-01-01 19:39:25,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:39:25,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-01-01 19:39:25,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:25,374 INFO L225 Difference]: With dead ends: 104 [2019-01-01 19:39:25,375 INFO L226 Difference]: Without dead ends: 104 [2019-01-01 19:39:25,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:39:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-01 19:39:25,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-01 19:39:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 19:39:25,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2019-01-01 19:39:25,380 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 49 [2019-01-01 19:39:25,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:25,380 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2019-01-01 19:39:25,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:39:25,381 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2019-01-01 19:39:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-01 19:39:25,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:25,382 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] [2019-01-01 19:39:25,382 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:25,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:25,382 INFO L82 PathProgramCache]: Analyzing trace with hash -888879155, now seen corresponding path program 1 times [2019-01-01 19:39:25,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:25,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:25,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:25,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:25,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:39:25,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:39:25,874 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-01 19:39:25,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:25,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:39:26,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:26,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:26,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-01 19:39:26,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:26,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:26,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2019-01-01 19:39:26,163 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-01 19:39:26,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:39:26,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [20] total 26 [2019-01-01 19:39:26,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-01 19:39:26,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-01 19:39:26,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2019-01-01 19:39:26,188 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand 27 states. [2019-01-01 19:39:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:27,650 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2019-01-01 19:39:27,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-01 19:39:27,651 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-01-01 19:39:27,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:27,653 INFO L225 Difference]: With dead ends: 109 [2019-01-01 19:39:27,653 INFO L226 Difference]: Without dead ends: 109 [2019-01-01 19:39:27,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=276, Invalid=2174, Unknown=0, NotChecked=0, Total=2450 [2019-01-01 19:39:27,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-01 19:39:27,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-01-01 19:39:27,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-01 19:39:27,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2019-01-01 19:39:27,659 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 50 [2019-01-01 19:39:27,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:27,660 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2019-01-01 19:39:27,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-01 19:39:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2019-01-01 19:39:27,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-01 19:39:27,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:27,662 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, 1] [2019-01-01 19:39:27,662 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:27,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:27,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1837440975, now seen corresponding path program 1 times [2019-01-01 19:39:27,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:27,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:27,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:27,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:27,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:27,909 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-01 19:39:27,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:39:27,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 19:39:27,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:39:27,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:39:27,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:39:27,910 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 5 states. [2019-01-01 19:39:28,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:28,043 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2019-01-01 19:39:28,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:39:28,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-01-01 19:39:28,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:28,047 INFO L225 Difference]: With dead ends: 103 [2019-01-01 19:39:28,047 INFO L226 Difference]: Without dead ends: 103 [2019-01-01 19:39:28,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:39:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-01 19:39:28,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-01-01 19:39:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-01 19:39:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2019-01-01 19:39:28,055 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 55 [2019-01-01 19:39:28,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:28,055 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2019-01-01 19:39:28,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:39:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2019-01-01 19:39:28,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 19:39:28,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:28,056 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:28,057 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:28,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:28,057 INFO L82 PathProgramCache]: Analyzing trace with hash 366819552, now seen corresponding path program 3 times [2019-01-01 19:39:28,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:28,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:28,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:28,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:28,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:28,557 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-01 19:39:28,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:39:28,558 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-01 19:39:28,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 19:39:28,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 19:39:28,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:39:28,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:39:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-01 19:39:28,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:39:28,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 19:39:28,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:39:28,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:39:28,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:39:28,770 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 7 states. [2019-01-01 19:39:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:28,941 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-01-01 19:39:28,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:39:28,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-01-01 19:39:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:28,944 INFO L225 Difference]: With dead ends: 72 [2019-01-01 19:39:28,944 INFO L226 Difference]: Without dead ends: 63 [2019-01-01 19:39:28,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:39:28,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-01 19:39:28,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-01 19:39:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-01 19:39:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-01-01 19:39:28,949 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 56 [2019-01-01 19:39:28,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:28,949 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-01-01 19:39:28,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:39:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-01-01 19:39:28,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-01 19:39:28,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:28,951 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, 1, 1, 1] [2019-01-01 19:39:28,951 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:28,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:28,951 INFO L82 PathProgramCache]: Analyzing trace with hash 549219633, now seen corresponding path program 1 times [2019-01-01 19:39:28,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:28,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:28,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:28,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:39:28,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:29,195 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-01 19:39:29,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:39:29,196 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-01 19:39:29,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:29,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:39:29,282 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-01 19:39:29,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:39:29,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 19:39:29,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:39:29,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:39:29,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:39:29,311 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 5 states. [2019-01-01 19:39:29,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:29,362 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2019-01-01 19:39:29,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:39:29,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-01-01 19:39:29,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:29,364 INFO L225 Difference]: With dead ends: 65 [2019-01-01 19:39:29,364 INFO L226 Difference]: Without dead ends: 65 [2019-01-01 19:39:29,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:39:29,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-01 19:39:29,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-01 19:39:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-01 19:39:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-01-01 19:39:29,367 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 57 [2019-01-01 19:39:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:29,368 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-01-01 19:39:29,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:39:29,368 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-01-01 19:39:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-01 19:39:29,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:29,369 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, 1, 1, 1] [2019-01-01 19:39:29,369 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:29,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:29,369 INFO L82 PathProgramCache]: Analyzing trace with hash -150926534, now seen corresponding path program 1 times [2019-01-01 19:39:29,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:29,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:29,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:29,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:29,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:39:30,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:39:30,170 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-01 19:39:30,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:30,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:39:30,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:30,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:30,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-01 19:39:30,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:30,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:30,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-01-01 19:39:30,546 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-01 19:39:30,551 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-01 19:39:30,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:30,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:30,566 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-01 19:39:30,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2019-01-01 19:39:31,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-01-01 19:39:31,575 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 21 treesize of output 13 [2019-01-01 19:39:31,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:31,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:31,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:31,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:33 [2019-01-01 19:39:31,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:31,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:31,824 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 72 [2019-01-01 19:39:31,853 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 53 [2019-01-01 19:39:31,855 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-01 19:39:31,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:31,965 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:39:31,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 54 [2019-01-01 19:39:31,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:32,007 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 19:39:32,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-01-01 19:39:32,064 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:173 [2019-01-01 19:39:32,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2019-01-01 19:39:32,526 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 37 treesize of output 30 [2019-01-01 19:39:32,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:32,547 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:39:32,549 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 30 treesize of output 22 [2019-01-01 19:39:32,549 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:32,651 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:39:32,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2019-01-01 19:39:32,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:32,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:32,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:32,688 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:18 [2019-01-01 19:39:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:39:32,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:39:32,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 49 [2019-01-01 19:39:32,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-01 19:39:32,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-01 19:39:32,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2300, Unknown=0, NotChecked=0, Total=2450 [2019-01-01 19:39:32,818 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 50 states. [2019-01-01 19:39:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:36,068 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2019-01-01 19:39:36,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-01 19:39:36,069 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 58 [2019-01-01 19:39:36,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:36,070 INFO L225 Difference]: With dead ends: 77 [2019-01-01 19:39:36,071 INFO L226 Difference]: Without dead ends: 77 [2019-01-01 19:39:36,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-01-01 19:39:36,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-01 19:39:36,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2019-01-01 19:39:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-01 19:39:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-01-01 19:39:36,076 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 58 [2019-01-01 19:39:36,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:36,077 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-01-01 19:39:36,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-01 19:39:36,077 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-01-01 19:39:36,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-01 19:39:36,078 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:36,078 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, 1, 1, 1] [2019-01-01 19:39:36,079 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:36,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:36,079 INFO L82 PathProgramCache]: Analyzing trace with hash -150926533, now seen corresponding path program 1 times [2019-01-01 19:39:36,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:36,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:36,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:36,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:36,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:37,078 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:39:37,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:39:37,079 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-01 19:39:37,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:37,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:39:37,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-01 19:39:37,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:37,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:37,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-01 19:39:37,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2019-01-01 19:39:37,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:37,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:37,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:25 [2019-01-01 19:39:37,720 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-01 19:39:37,723 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-01 19:39:37,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:37,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:37,748 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-01 19:39:37,755 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-01 19:39:37,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:37,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:37,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:37,777 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:51, output treesize:43 [2019-01-01 19:39:38,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2019-01-01 19:39:38,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:38,127 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 0 case distinctions, treesize of input 41 treesize of output 37 [2019-01-01 19:39:38,128 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:38,165 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 47 treesize of output 39 [2019-01-01 19:39:38,166 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-01 19:39:38,188 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 39 treesize of output 35 [2019-01-01 19:39:38,189 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-01 19:39:38,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-01 19:39:38,255 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 27 [2019-01-01 19:39:38,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 9 [2019-01-01 19:39:38,261 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:38,268 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:38,272 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 35 treesize of output 31 [2019-01-01 19:39:38,275 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 17 treesize of output 9 [2019-01-01 19:39:38,276 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:38,285 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:38,309 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 2 xjuncts. [2019-01-01 19:39:38,309 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:65, output treesize:35 [2019-01-01 19:39:39,292 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 103 treesize of output 102 [2019-01-01 19:39:39,298 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:39:39,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:39,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 100 [2019-01-01 19:39:39,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:39,392 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 0 case distinctions, treesize of input 88 treesize of output 75 [2019-01-01 19:39:39,395 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-01 19:39:39,475 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-01 19:39:39,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 19:39:39,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 110 [2019-01-01 19:39:39,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:39,702 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:39:39,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 100 [2019-01-01 19:39:39,710 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:39,806 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 99 treesize of output 92 [2019-01-01 19:39:39,807 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:39,846 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:39,850 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 86 treesize of output 69 [2019-01-01 19:39:39,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:39,874 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:39:39,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 74 [2019-01-01 19:39:39,880 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:39,898 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:39,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 84 [2019-01-01 19:39:39,963 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 77 treesize of output 70 [2019-01-01 19:39:39,964 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:40,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:40,039 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:39:40,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 82 [2019-01-01 19:39:40,057 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:40,112 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:39:40,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-01 19:39:40,198 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:124, output treesize:258 [2019-01-01 19:39:40,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2019-01-01 19:39:40,668 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:39:40,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-01-01 19:39:40,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:40,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:40,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2019-01-01 19:39:40,733 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:39:40,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2019-01-01 19:39:40,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:40,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2019-01-01 19:39:40,761 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:40,798 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:39:40,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2019-01-01 19:39:40,800 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:40,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:40,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:40,828 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:79, output treesize:19 [2019-01-01 19:39:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:39:41,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:39:41,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 57 [2019-01-01 19:39:41,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-01 19:39:41,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-01 19:39:41,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3127, Unknown=0, NotChecked=0, Total=3306 [2019-01-01 19:39:41,502 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 58 states. [2019-01-01 19:39:42,919 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-01-01 19:39:45,927 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-01-01 19:39:47,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:47,440 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2019-01-01 19:39:47,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-01 19:39:47,441 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-01-01 19:39:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:47,443 INFO L225 Difference]: With dead ends: 81 [2019-01-01 19:39:47,443 INFO L226 Difference]: Without dead ends: 81 [2019-01-01 19:39:47,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1566 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=608, Invalid=7764, Unknown=0, NotChecked=0, Total=8372 [2019-01-01 19:39:47,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-01 19:39:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2019-01-01 19:39:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-01 19:39:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-01-01 19:39:47,449 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 58 [2019-01-01 19:39:47,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:47,449 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-01-01 19:39:47,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-01 19:39:47,449 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-01-01 19:39:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-01 19:39:47,450 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:47,450 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-01 19:39:47,450 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:47,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:47,455 INFO L82 PathProgramCache]: Analyzing trace with hash 751714331, now seen corresponding path program 1 times [2019-01-01 19:39:47,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:47,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:47,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:47,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:47,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:39:49,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:39:49,069 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-01 19:39:49,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:49,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:39:49,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:39:49,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 19:39:49,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:49,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:49,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:49,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-01-01 19:39:49,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 21 [2019-01-01 19:39:49,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-01-01 19:39:49,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:49,425 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 6 treesize of output 4 [2019-01-01 19:39:49,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:49,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:49,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:49,431 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-01-01 19:39:49,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-01-01 19:39:49,587 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 21 treesize of output 13 [2019-01-01 19:39:49,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:49,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:49,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:49,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:23 [2019-01-01 19:39:49,744 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 33 treesize of output 40 [2019-01-01 19:39:49,749 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 32 treesize of output 25 [2019-01-01 19:39:49,750 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:49,774 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-01 19:39:49,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:49,808 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 23 treesize of output 25 [2019-01-01 19:39:49,809 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:49,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:39:49,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:39:49,845 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:36, output treesize:49 [2019-01-01 19:39:50,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2019-01-01 19:39:50,052 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 0 case distinctions, treesize of input 20 treesize of output 12 [2019-01-01 19:39:50,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:50,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:50,063 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-01 19:39:50,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2019-01-01 19:39:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:39:50,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:39:50,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 40 [2019-01-01 19:39:50,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-01 19:39:50,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-01 19:39:50,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1531, Unknown=0, NotChecked=0, Total=1640 [2019-01-01 19:39:50,098 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 41 states. [2019-01-01 19:39:51,797 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-01 19:39:52,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:39:52,507 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-01-01 19:39:52,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-01 19:39:52,508 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 62 [2019-01-01 19:39:52,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:39:52,510 INFO L225 Difference]: With dead ends: 79 [2019-01-01 19:39:52,510 INFO L226 Difference]: Without dead ends: 79 [2019-01-01 19:39:52,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=341, Invalid=3691, Unknown=0, NotChecked=0, Total=4032 [2019-01-01 19:39:52,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-01 19:39:52,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2019-01-01 19:39:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-01 19:39:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-01 19:39:52,515 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 62 [2019-01-01 19:39:52,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:39:52,515 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-01 19:39:52,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-01 19:39:52,515 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-01 19:39:52,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-01 19:39:52,516 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:39:52,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:39:52,520 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:39:52,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:39:52,520 INFO L82 PathProgramCache]: Analyzing trace with hash 935083808, now seen corresponding path program 2 times [2019-01-01 19:39:52,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:39:52,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:39:52,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:52,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:39:52,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:39:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:39:52,854 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-01-01 19:39:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:39:54,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:39:54,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 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-01 19:39:54,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:39:54,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 19:39:54,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:39:54,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:39:54,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:39:54,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:54,548 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-01 19:39:54,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-01-01 19:39:55,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:39:55,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:55,061 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-01 19:39:55,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-01-01 19:39:55,364 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-01 19:39:55,366 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-01 19:39:55,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:55,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:55,389 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-01 19:39:55,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:59 [2019-01-01 19:39:56,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2019-01-01 19:39:56,120 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 21 treesize of output 13 [2019-01-01 19:39:56,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:56,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:56,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:56,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:33 [2019-01-01 19:39:56,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:56,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:56,367 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 129 treesize of output 117 [2019-01-01 19:39:56,376 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 97 [2019-01-01 19:39:56,377 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:56,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:56,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:56,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:143, output treesize:99 [2019-01-01 19:39:56,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:56,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:57,022 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 103 treesize of output 89 [2019-01-01 19:39:57,046 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:39:57,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2019-01-01 19:39:57,049 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:57,252 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 70 treesize of output 56 [2019-01-01 19:39:57,253 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-01 19:39:57,427 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:57,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:57,705 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:124, output treesize:69 [2019-01-01 19:39:58,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:58,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:58,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:58,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:58,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 54 [2019-01-01 19:39:58,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:39:58,448 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:39:58,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2019-01-01 19:39:58,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:39:58,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:39:58,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-01 19:39:58,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:72, output treesize:45 [2019-01-01 19:39:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:39:58,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:39:58,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 57 [2019-01-01 19:39:58,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-01 19:39:58,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-01 19:39:58,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3127, Unknown=0, NotChecked=0, Total=3306 [2019-01-01 19:39:58,648 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 58 states. [2019-01-01 19:40:00,194 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-01 19:40:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:40:05,695 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-01-01 19:40:05,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-01 19:40:05,698 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 71 [2019-01-01 19:40:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:40:05,699 INFO L225 Difference]: With dead ends: 76 [2019-01-01 19:40:05,699 INFO L226 Difference]: Without dead ends: 73 [2019-01-01 19:40:05,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=254, Invalid=4168, Unknown=0, NotChecked=0, Total=4422 [2019-01-01 19:40:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-01 19:40:05,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-01-01 19:40:05,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-01 19:40:05,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-01-01 19:40:05,705 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 71 [2019-01-01 19:40:05,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:40:05,705 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-01-01 19:40:05,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-01 19:40:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-01-01 19:40:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-01 19:40:05,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:40:05,709 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:40:05,709 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, sll_remove_firstErr0REQUIRES_VIOLATION, sll_remove_firstErr1REQUIRES_VIOLATION, sll_remove_firstErr2REQUIRES_VIOLATION, sll_remove_firstErr3REQUIRES_VIOLATION, sll_remove_firstErr7ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr9REQUIRES_VIOLATION, sll_remove_firstErr4REQUIRES_VIOLATION, sll_remove_firstErr6ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr5REQUIRES_VIOLATION, sll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_remove_firstErr10REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2019-01-01 19:40:05,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:40:05,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1074038997, now seen corresponding path program 2 times [2019-01-01 19:40:05,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:40:05,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:40:05,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:05,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:40:05,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:40:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:40:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-01 19:40:06,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:40:06,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 19:40:06,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:40:06,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:40:06,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:40:06,004 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 6 states. [2019-01-01 19:40:06,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:40:06,039 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-01-01 19:40:06,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:40:06,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-01-01 19:40:06,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:40:06,041 INFO L225 Difference]: With dead ends: 50 [2019-01-01 19:40:06,041 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 19:40:06,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:40:06,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 19:40:06,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 19:40:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 19:40:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 19:40:06,042 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2019-01-01 19:40:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:40:06,047 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 19:40:06,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:40:06,047 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 19:40:06,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 19:40:06,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 07:40:06 BoogieIcfgContainer [2019-01-01 19:40:06,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 19:40:06,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 19:40:06,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 19:40:06,057 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 19:40:06,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:38:46" (3/4) ... [2019-01-01 19:40:06,065 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 19:40:06,075 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 19:40:06,075 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-01 19:40:06,075 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 19:40:06,075 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 19:40:06,075 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2019-01-01 19:40:06,076 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 19:40:06,076 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_remove_first [2019-01-01 19:40:06,076 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-01-01 19:40:06,082 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-01-01 19:40:06,083 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-01 19:40:06,083 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 19:40:06,129 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 19:40:06,129 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 19:40:06,130 INFO L168 Benchmark]: Toolchain (without parser) took 80967.60 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 459.8 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -268.3 MB). Peak memory consumption was 191.5 MB. Max. memory is 11.5 GB. [2019-01-01 19:40:06,132 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:40:06,133 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-01-01 19:40:06,133 INFO L168 Benchmark]: Boogie Preprocessor took 70.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:40:06,133 INFO L168 Benchmark]: RCFGBuilder took 927.16 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.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. [2019-01-01 19:40:06,133 INFO L168 Benchmark]: TraceAbstraction took 79180.00 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 324.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -161.6 MB). Peak memory consumption was 162.9 MB. Max. memory is 11.5 GB. [2019-01-01 19:40:06,135 INFO L168 Benchmark]: Witness Printer took 72.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:40:06,139 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 712.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 927.16 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.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79180.00 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 324.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -161.6 MB). Peak memory consumption was 162.9 MB. Max. memory is 11.5 GB. * Witness Printer took 72.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 584]: 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: 583]: 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]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 584]: 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: 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 9 procedures, 77 locations, 20 error locations. SAFE Result, 79.1s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 50.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1001 SDtfs, 1311 SDslu, 5806 SDs, 0 SdLazy, 9681 SolverSat, 275 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 16.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1021 GetRequests, 484 SyntacticMatches, 20 SemanticMatches, 517 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4865 ImplicationChecksByTransitivity, 51.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 128 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 26.7s InterpolantComputationTime, 1555 NumberOfCodeBlocks, 1555 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1521 ConstructedInterpolants, 122 QuantifiedInterpolants, 837329 SizeOfPredicates, 135 NumberOfNonLiveVariables, 3036 ConjunctsInSsa, 484 ConjunctsInUnsatCore, 34 InterpolantComputations, 14 PerfectInterpolantSequences, 318/543 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...