./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer --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 dd9e7bf35989cde866740706d77fd71a632fd664 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 13:05:42,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 13:05:42,143 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 13:05:42,149 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 13:05:42,149 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 13:05:42,150 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 13:05:42,150 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 13:05:42,151 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 13:05:42,152 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 13:05:42,152 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 13:05:42,153 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 13:05:42,153 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 13:05:42,153 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 13:05:42,154 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 13:05:42,154 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 13:05:42,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 13:05:42,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 13:05:42,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 13:05:42,157 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 13:05:42,157 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 13:05:42,158 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 13:05:42,159 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 13:05:42,160 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 13:05:42,160 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 13:05:42,160 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 13:05:42,160 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 13:05:42,161 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 13:05:42,161 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 13:05:42,162 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 13:05:42,162 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 13:05:42,162 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 13:05:42,163 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 13:05:42,163 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 13:05:42,163 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 13:05:42,163 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 13:05:42,164 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 13:05:42,164 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-01 13:05:42,171 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 13:05:42,171 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 13:05:42,171 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 13:05:42,171 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 13:05:42,172 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 13:05:42,172 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 13:05:42,172 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 13:05:42,172 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 13:05:42,172 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 13:05:42,172 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 13:05:42,172 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 13:05:42,172 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 13:05:42,172 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 13:05:42,172 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 13:05:42,173 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 13:05:42,173 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-01 13:05:42,173 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 13:05:42,173 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 13:05:42,173 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 13:05:42,173 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 13:05:42,173 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 13:05:42,173 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 13:05:42,173 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 13:05:42,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 13:05:42,173 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 13:05:42,174 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 13:05:42,174 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 13:05:42,174 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 13:05:42,174 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer 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 -> dd9e7bf35989cde866740706d77fd71a632fd664 [2018-12-01 13:05:42,191 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 13:05:42,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 13:05:42,200 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 13:05:42,201 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 13:05:42,201 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 13:05:42,201 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-01 13:05:42,236 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/data/1f19db89a/ad2d25df61544f2aa2f65e4dba502c25/FLAG7301c4448 [2018-12-01 13:05:42,655 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 13:05:42,656 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-01 13:05:42,662 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/data/1f19db89a/ad2d25df61544f2aa2f65e4dba502c25/FLAG7301c4448 [2018-12-01 13:05:42,670 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/data/1f19db89a/ad2d25df61544f2aa2f65e4dba502c25 [2018-12-01 13:05:42,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 13:05:42,673 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-01 13:05:42,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 13:05:42,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 13:05:42,677 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 13:05:42,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:05:42" (1/1) ... [2018-12-01 13:05:42,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@417514c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:42, skipping insertion in model container [2018-12-01 13:05:42,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 01:05:42" (1/1) ... [2018-12-01 13:05:42,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 13:05:42,710 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 13:05:42,877 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 13:05:42,916 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 13:05:42,943 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 13:05:42,976 INFO L195 MainTranslator]: Completed translation [2018-12-01 13:05:42,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:42 WrapperNode [2018-12-01 13:05:42,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 13:05:42,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 13:05:42,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 13:05:42,976 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 13:05:42,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:42" (1/1) ... [2018-12-01 13:05:42,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:42" (1/1) ... [2018-12-01 13:05:42,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:42" (1/1) ... [2018-12-01 13:05:42,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:42" (1/1) ... [2018-12-01 13:05:43,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:42" (1/1) ... [2018-12-01 13:05:43,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:42" (1/1) ... [2018-12-01 13:05:43,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:42" (1/1) ... [2018-12-01 13:05:43,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 13:05:43,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 13:05:43,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 13:05:43,011 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 13:05:43,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 13:05:43,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 13:05:43,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 13:05:43,042 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-01 13:05:43,042 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-01 13:05:43,042 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-01 13:05:43,042 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-01 13:05:43,043 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-01 13:05:43,043 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-12-01 13:05:43,043 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-12-01 13:05:43,043 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-12-01 13:05:43,043 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 13:05:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-01 13:05:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-01 13:05:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-01 13:05:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-01 13:05:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-01 13:05:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-01 13:05:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-01 13:05:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-01 13:05:43,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-01 13:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-01 13:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-01 13:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-01 13:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-01 13:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-01 13:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-01 13:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-01 13:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-01 13:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-01 13:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-01 13:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-01 13:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-01 13:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-01 13:05:43,044 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-01 13:05:43,045 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-01 13:05:43,045 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-01 13:05:43,045 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-01 13:05:43,045 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-01 13:05:43,045 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-01 13:05:43,045 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-01 13:05:43,045 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-01 13:05:43,045 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-01 13:05:43,045 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-01 13:05:43,045 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-01 13:05:43,046 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-01 13:05:43,046 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-01 13:05:43,046 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-01 13:05:43,046 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-01 13:05:43,046 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-01 13:05:43,046 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-01 13:05:43,046 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-01 13:05:43,046 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-01 13:05:43,046 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-01 13:05:43,047 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-01 13:05:43,047 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-01 13:05:43,047 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-01 13:05:43,047 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-01 13:05:43,047 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-01 13:05:43,047 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-01 13:05:43,047 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-01 13:05:43,047 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-01 13:05:43,047 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-01 13:05:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-01 13:05:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-01 13:05:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-01 13:05:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-01 13:05:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-01 13:05:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-01 13:05:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-01 13:05:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-01 13:05:43,048 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-01 13:05:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-01 13:05:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-01 13:05:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-01 13:05:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-01 13:05:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-01 13:05:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-01 13:05:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-01 13:05:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-01 13:05:43,049 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-01 13:05:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-01 13:05:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-01 13:05:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-01 13:05:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-01 13:05:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-01 13:05:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-01 13:05:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-01 13:05:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-01 13:05:43,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-01 13:05:43,051 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-01 13:05:43,051 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-01 13:05:43,051 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-01 13:05:43,051 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-01 13:05:43,051 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-01 13:05:43,051 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-01 13:05:43,051 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-01 13:05:43,051 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-01 13:05:43,051 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-01 13:05:43,052 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-01 13:05:43,052 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-01 13:05:43,052 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-01 13:05:43,052 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-01 13:05:43,052 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-01 13:05:43,052 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-01 13:05:43,052 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-01 13:05:43,052 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-01 13:05:43,052 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-01 13:05:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-01 13:05:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-01 13:05:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-01 13:05:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-01 13:05:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-01 13:05:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-01 13:05:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-01 13:05:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-01 13:05:43,053 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-01 13:05:43,054 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-01 13:05:43,054 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-01 13:05:43,054 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-01 13:05:43,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 13:05:43,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 13:05:43,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 13:05:43,054 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-01 13:05:43,054 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-12-01 13:05:43,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 13:05:43,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 13:05:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-12-01 13:05:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 13:05:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-12-01 13:05:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 13:05:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 13:05:43,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 13:05:43,287 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 13:05:43,288 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-01 13:05:43,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:05:43 BoogieIcfgContainer [2018-12-01 13:05:43,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 13:05:43,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 13:05:43,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 13:05:43,290 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 13:05:43,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 01:05:42" (1/3) ... [2018-12-01 13:05:43,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b3dcfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 01:05:43, skipping insertion in model container [2018-12-01 13:05:43,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 01:05:42" (2/3) ... [2018-12-01 13:05:43,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b3dcfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 01:05:43, skipping insertion in model container [2018-12-01 13:05:43,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:05:43" (3/3) ... [2018-12-01 13:05:43,292 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-01 13:05:43,298 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 13:05:43,303 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-12-01 13:05:43,312 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-12-01 13:05:43,326 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 13:05:43,327 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 13:05:43,327 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-01 13:05:43,327 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 13:05:43,327 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 13:05:43,327 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 13:05:43,327 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 13:05:43,327 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 13:05:43,327 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 13:05:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-12-01 13:05:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 13:05:43,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:43,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:05:43,343 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:43,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:43,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1323720086, now seen corresponding path program 1 times [2018-12-01 13:05:43,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:43,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:43,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:43,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:43,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:05:43,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:05:43,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 13:05:43,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 13:05:43,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 13:05:43,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 13:05:43,464 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2018-12-01 13:05:43,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:43,513 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-12-01 13:05:43,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 13:05:43,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-01 13:05:43,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:43,521 INFO L225 Difference]: With dead ends: 84 [2018-12-01 13:05:43,521 INFO L226 Difference]: Without dead ends: 77 [2018-12-01 13:05:43,522 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 [2018-12-01 13:05:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-01 13:05:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-01 13:05:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-01 13:05:43,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-12-01 13:05:43,548 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 13 [2018-12-01 13:05:43,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:43,549 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-12-01 13:05:43,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 13:05:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-12-01 13:05:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 13:05:43,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:43,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:05:43,549 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:43,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:43,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1323720085, now seen corresponding path program 1 times [2018-12-01 13:05:43,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:43,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:43,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:43,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:43,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:05:43,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:05:43,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 13:05:43,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 13:05:43,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 13:05:43,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 13:05:43,590 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 3 states. [2018-12-01 13:05:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:43,612 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-12-01 13:05:43,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 13:05:43,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-01 13:05:43,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:43,612 INFO L225 Difference]: With dead ends: 75 [2018-12-01 13:05:43,612 INFO L226 Difference]: Without dead ends: 75 [2018-12-01 13:05:43,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 13:05:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-01 13:05:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-01 13:05:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-01 13:05:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-12-01 13:05:43,617 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 13 [2018-12-01 13:05:43,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:43,617 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-12-01 13:05:43,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 13:05:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-12-01 13:05:43,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 13:05:43,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:43,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:05:43,618 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:43,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:43,618 INFO L82 PathProgramCache]: Analyzing trace with hash 303614154, now seen corresponding path program 1 times [2018-12-01 13:05:43,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:43,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:43,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:43,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:43,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:05:43,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:05:43,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:05:43,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 13:05:43,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 13:05:43,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:05:43,653 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2018-12-01 13:05:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:43,685 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-12-01 13:05:43,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 13:05:43,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-01 13:05:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:43,686 INFO L225 Difference]: With dead ends: 86 [2018-12-01 13:05:43,686 INFO L226 Difference]: Without dead ends: 83 [2018-12-01 13:05:43,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:05:43,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-01 13:05:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2018-12-01 13:05:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-01 13:05:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-12-01 13:05:43,695 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 18 [2018-12-01 13:05:43,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:43,695 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-12-01 13:05:43,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 13:05:43,695 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-12-01 13:05:43,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-01 13:05:43,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:43,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:05:43,696 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:43,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:43,696 INFO L82 PathProgramCache]: Analyzing trace with hash -677829022, now seen corresponding path program 1 times [2018-12-01 13:05:43,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:43,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:43,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:43,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:43,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:05:43,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:05:43,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:05:43,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:05:43,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:05:43,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:05:43,745 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 6 states. [2018-12-01 13:05:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:43,833 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-12-01 13:05:43,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 13:05:43,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-01 13:05:43,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:43,835 INFO L225 Difference]: With dead ends: 76 [2018-12-01 13:05:43,835 INFO L226 Difference]: Without dead ends: 76 [2018-12-01 13:05:43,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:05:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-01 13:05:43,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-12-01 13:05:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-01 13:05:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-12-01 13:05:43,840 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 19 [2018-12-01 13:05:43,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:43,841 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-12-01 13:05:43,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:05:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-12-01 13:05:43,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-01 13:05:43,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:43,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:05:43,842 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:43,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:43,842 INFO L82 PathProgramCache]: Analyzing trace with hash -677829021, now seen corresponding path program 1 times [2018-12-01 13:05:43,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:43,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:43,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:43,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:43,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:05:43,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:05:43,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 13:05:43,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:05:43,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:05:43,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:05:43,895 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 6 states. [2018-12-01 13:05:43,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:43,962 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-12-01 13:05:43,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 13:05:43,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-01 13:05:43,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:43,963 INFO L225 Difference]: With dead ends: 75 [2018-12-01 13:05:43,963 INFO L226 Difference]: Without dead ends: 75 [2018-12-01 13:05:43,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:05:43,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-01 13:05:43,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-12-01 13:05:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-01 13:05:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-12-01 13:05:43,967 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 19 [2018-12-01 13:05:43,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:43,967 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-12-01 13:05:43,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:05:43,967 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-12-01 13:05:43,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 13:05:43,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:43,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:05:43,968 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:43,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:43,968 INFO L82 PathProgramCache]: Analyzing trace with hash 649435046, now seen corresponding path program 1 times [2018-12-01 13:05:43,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:43,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:43,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:43,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:43,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:05:44,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:05:44,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-01 13:05:44,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 13:05:44,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 13:05:44,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-01 13:05:44,045 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 12 states. [2018-12-01 13:05:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:44,244 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-12-01 13:05:44,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 13:05:44,245 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-01 13:05:44,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:44,245 INFO L225 Difference]: With dead ends: 80 [2018-12-01 13:05:44,245 INFO L226 Difference]: Without dead ends: 80 [2018-12-01 13:05:44,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-01 13:05:44,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-01 13:05:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-12-01 13:05:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-01 13:05:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-12-01 13:05:44,250 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 31 [2018-12-01 13:05:44,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:44,250 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-12-01 13:05:44,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 13:05:44,250 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-12-01 13:05:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 13:05:44,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:44,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:05:44,251 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:44,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:44,251 INFO L82 PathProgramCache]: Analyzing trace with hash 649435047, now seen corresponding path program 1 times [2018-12-01 13:05:44,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:44,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:44,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:44,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:44,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:05:44,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:05:44,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:05:44,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:44,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:05:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:05:44,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:05:44,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-01 13:05:44,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:05:44,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:05:44,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:05:44,363 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 6 states. [2018-12-01 13:05:44,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:44,400 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-12-01 13:05:44,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 13:05:44,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-01 13:05:44,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:44,401 INFO L225 Difference]: With dead ends: 91 [2018-12-01 13:05:44,401 INFO L226 Difference]: Without dead ends: 88 [2018-12-01 13:05:44,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:05:44,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-01 13:05:44,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2018-12-01 13:05:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-01 13:05:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-12-01 13:05:44,405 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 31 [2018-12-01 13:05:44,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:44,405 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-12-01 13:05:44,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:05:44,405 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-12-01 13:05:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-01 13:05:44,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:44,406 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] [2018-12-01 13:05:44,407 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:44,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:44,407 INFO L82 PathProgramCache]: Analyzing trace with hash 40947275, now seen corresponding path program 2 times [2018-12-01 13:05:44,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:44,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:44,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:44,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:44,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-01 13:05:44,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:05:44,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 13:05:44,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:05:44,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:05:44,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:05:44,449 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 6 states. [2018-12-01 13:05:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:44,500 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2018-12-01 13:05:44,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 13:05:44,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-12-01 13:05:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:44,501 INFO L225 Difference]: With dead ends: 104 [2018-12-01 13:05:44,501 INFO L226 Difference]: Without dead ends: 104 [2018-12-01 13:05:44,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-01 13:05:44,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-01 13:05:44,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2018-12-01 13:05:44,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-01 13:05:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2018-12-01 13:05:44,505 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 44 [2018-12-01 13:05:44,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:44,506 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-12-01 13:05:44,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:05:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-12-01 13:05:44,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-01 13:05:44,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:44,507 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] [2018-12-01 13:05:44,507 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:44,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:44,507 INFO L82 PathProgramCache]: Analyzing trace with hash 40947330, now seen corresponding path program 1 times [2018-12-01 13:05:44,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:44,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:44,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:44,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:05:44,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 13:05:44,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:05:44,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-01 13:05:44,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 13:05:44,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 13:05:44,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-01 13:05:44,635 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 13 states. [2018-12-01 13:05:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:44,832 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2018-12-01 13:05:44,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 13:05:44,832 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-12-01 13:05:44,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:44,833 INFO L225 Difference]: With dead ends: 99 [2018-12-01 13:05:44,833 INFO L226 Difference]: Without dead ends: 99 [2018-12-01 13:05:44,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-12-01 13:05:44,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-01 13:05:44,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-12-01 13:05:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-01 13:05:44,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-12-01 13:05:44,836 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 44 [2018-12-01 13:05:44,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:44,837 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-12-01 13:05:44,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 13:05:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-12-01 13:05:44,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-01 13:05:44,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:44,838 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] [2018-12-01 13:05:44,838 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:44,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:44,838 INFO L82 PathProgramCache]: Analyzing trace with hash 91149112, now seen corresponding path program 1 times [2018-12-01 13:05:44,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:44,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:44,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:44,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:44,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:05:45,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:05:45,145 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:05:45,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:45,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:05:45,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:05:45,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:05:45,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:05:45,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-01 13:05:45,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:05:45,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:05:45,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-01 13:05:45,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:05:45,782 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. [2018-12-01 13:05:45,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-01 13:05:45,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 13:05:45,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-01 13:05:45,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:05:45,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:05:45,816 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. [2018-12-01 13:05:45,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:27 [2018-12-01 13:05:46,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-12-01 13:05:46,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-12-01 13:05:46,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:05:46,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:05:46,053 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. [2018-12-01 13:05:46,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:15 [2018-12-01 13:05:46,120 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:05:46,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:05:46,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 32 [2018-12-01 13:05:46,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-01 13:05:46,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-01 13:05:46,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=984, Unknown=2, NotChecked=0, Total=1056 [2018-12-01 13:05:46,136 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 33 states. [2018-12-01 13:05:46,567 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2018-12-01 13:05:47,172 WARN L180 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2018-12-01 13:05:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:48,923 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2018-12-01 13:05:48,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-01 13:05:48,924 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-12-01 13:05:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:48,925 INFO L225 Difference]: With dead ends: 118 [2018-12-01 13:05:48,925 INFO L226 Difference]: Without dead ends: 118 [2018-12-01 13:05:48,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=215, Invalid=2435, Unknown=2, NotChecked=0, Total=2652 [2018-12-01 13:05:48,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-01 13:05:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2018-12-01 13:05:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-01 13:05:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2018-12-01 13:05:48,930 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 47 [2018-12-01 13:05:48,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:48,930 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2018-12-01 13:05:48,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-01 13:05:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2018-12-01 13:05:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-01 13:05:48,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:48,931 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] [2018-12-01 13:05:48,932 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:48,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:48,932 INFO L82 PathProgramCache]: Analyzing trace with hash 91149113, now seen corresponding path program 1 times [2018-12-01 13:05:48,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:48,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:48,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:48,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:48,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:05:49,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:05:49,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:05:49,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:49,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:05:49,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:05:49,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:05:49,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:05:49,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:05:49,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:05:49,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-01 13:05:50,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:05:50,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 13:05:50,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:05:50,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:05:50,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:05:50,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 13:05:50,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:05:50,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:05:50,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-12-01 13:05:50,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 13:05:50,368 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 [2018-12-01 13:05:50,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:05:50,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:05:50,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 13:05:50,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-01 13:05:50,378 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:05:50,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:05:50,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:05:50,384 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:36 [2018-12-01 13:05:50,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-12-01 13:05:50,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-12-01 13:05:50,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:05:50,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:05:50,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-01 13:05:50,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-01 13:05:50,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:05:50,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:05:50,655 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. [2018-12-01 13:05:50,655 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:54, output treesize:18 [2018-12-01 13:05:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 13:05:50,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:05:50,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 34 [2018-12-01 13:05:50,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-01 13:05:50,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-01 13:05:50,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1116, Unknown=2, NotChecked=0, Total=1190 [2018-12-01 13:05:50,738 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand 35 states. [2018-12-01 13:05:52,223 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2018-12-01 13:05:54,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:54,197 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2018-12-01 13:05:54,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-01 13:05:54,198 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 47 [2018-12-01 13:05:54,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:54,198 INFO L225 Difference]: With dead ends: 151 [2018-12-01 13:05:54,198 INFO L226 Difference]: Without dead ends: 151 [2018-12-01 13:05:54,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=194, Invalid=2354, Unknown=2, NotChecked=0, Total=2550 [2018-12-01 13:05:54,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-01 13:05:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 114. [2018-12-01 13:05:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-01 13:05:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2018-12-01 13:05:54,202 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 47 [2018-12-01 13:05:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:54,202 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2018-12-01 13:05:54,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-01 13:05:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2018-12-01 13:05:54,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-01 13:05:54,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:54,203 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-01 13:05:54,203 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:54,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:54,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1005485962, now seen corresponding path program 2 times [2018-12-01 13:05:54,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:54,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:54,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-01 13:05:54,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:05:54,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 13:05:54,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 13:05:54,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 13:05:54,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:05:54,233 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand 7 states. [2018-12-01 13:05:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:54,272 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-12-01 13:05:54,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 13:05:54,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-12-01 13:05:54,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:54,273 INFO L225 Difference]: With dead ends: 90 [2018-12-01 13:05:54,273 INFO L226 Difference]: Without dead ends: 90 [2018-12-01 13:05:54,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-01 13:05:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-01 13:05:54,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-01 13:05:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-01 13:05:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-12-01 13:05:54,275 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 50 [2018-12-01 13:05:54,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:54,275 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-12-01 13:05:54,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 13:05:54,275 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-12-01 13:05:54,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-01 13:05:54,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:54,276 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] [2018-12-01 13:05:54,276 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:54,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:54,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1201553280, now seen corresponding path program 1 times [2018-12-01 13:05:54,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:54,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:54,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:54,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:05:54,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:54,342 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-01 13:05:54,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:05:54,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-01 13:05:54,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 13:05:54,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 13:05:54,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-01 13:05:54,344 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 12 states. [2018-12-01 13:05:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:54,481 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-12-01 13:05:54,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 13:05:54,481 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-12-01 13:05:54,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:54,482 INFO L225 Difference]: With dead ends: 95 [2018-12-01 13:05:54,482 INFO L226 Difference]: Without dead ends: 95 [2018-12-01 13:05:54,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-01 13:05:54,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-01 13:05:54,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-12-01 13:05:54,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-01 13:05:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-12-01 13:05:54,485 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 57 [2018-12-01 13:05:54,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:54,485 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-12-01 13:05:54,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 13:05:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-12-01 13:05:54,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-01 13:05:54,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:54,486 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] [2018-12-01 13:05:54,486 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:54,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:54,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1201553281, now seen corresponding path program 1 times [2018-12-01 13:05:54,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:54,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:54,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:54,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:54,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:54,514 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-01 13:05:54,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:05:54,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:05:54,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:54,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:05:54,557 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-01 13:05:54,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:05:54,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-01 13:05:54,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 13:05:54,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 13:05:54,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 13:05:54,583 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 5 states. [2018-12-01 13:05:54,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:54,619 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-12-01 13:05:54,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 13:05:54,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-01 13:05:54,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:54,620 INFO L225 Difference]: With dead ends: 100 [2018-12-01 13:05:54,620 INFO L226 Difference]: Without dead ends: 100 [2018-12-01 13:05:54,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:05:54,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-01 13:05:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-01 13:05:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-01 13:05:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-12-01 13:05:54,623 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 57 [2018-12-01 13:05:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:54,624 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-12-01 13:05:54,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 13:05:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-12-01 13:05:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-01 13:05:54,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:54,624 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:05:54,625 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:54,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:54,625 INFO L82 PathProgramCache]: Analyzing trace with hash 781724054, now seen corresponding path program 1 times [2018-12-01 13:05:54,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:54,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:54,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:54,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:54,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-01 13:05:54,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:05:54,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 13:05:54,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 13:05:54,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 13:05:54,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:05:54,660 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 7 states. [2018-12-01 13:05:54,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:54,720 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-12-01 13:05:54,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 13:05:54,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2018-12-01 13:05:54,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:54,721 INFO L225 Difference]: With dead ends: 95 [2018-12-01 13:05:54,721 INFO L226 Difference]: Without dead ends: 95 [2018-12-01 13:05:54,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-01 13:05:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-01 13:05:54,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-01 13:05:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-01 13:05:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2018-12-01 13:05:54,723 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 58 [2018-12-01 13:05:54,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:54,723 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-12-01 13:05:54,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 13:05:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2018-12-01 13:05:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-01 13:05:54,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:54,724 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:05:54,724 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:54,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:54,724 INFO L82 PathProgramCache]: Analyzing trace with hash 456093685, now seen corresponding path program 2 times [2018-12-01 13:05:54,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:54,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:54,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:54,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:54,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-01 13:05:54,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:05:54,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 13:05:54,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 13:05:54,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 13:05:54,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 13:05:54,752 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 6 states. [2018-12-01 13:05:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:54,784 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2018-12-01 13:05:54,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 13:05:54,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-01 13:05:54,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:54,785 INFO L225 Difference]: With dead ends: 109 [2018-12-01 13:05:54,785 INFO L226 Difference]: Without dead ends: 109 [2018-12-01 13:05:54,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-01 13:05:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-01 13:05:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-12-01 13:05:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-01 13:05:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2018-12-01 13:05:54,788 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 65 [2018-12-01 13:05:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:54,788 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2018-12-01 13:05:54,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 13:05:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2018-12-01 13:05:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-01 13:05:54,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:54,789 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:05:54,789 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:54,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:54,789 INFO L82 PathProgramCache]: Analyzing trace with hash 456093740, now seen corresponding path program 1 times [2018-12-01 13:05:54,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:54,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:54,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:54,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:05:54,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-01 13:05:54,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:05:54,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/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 [2018-12-01 13:05:54,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:54,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:05:54,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:05:54,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:05:54,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:05:54,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 13:05:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-01 13:05:55,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 13:05:55,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 27 [2018-12-01 13:05:55,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-01 13:05:55,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-01 13:05:55,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2018-12-01 13:05:55,203 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 28 states. [2018-12-01 13:05:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:05:55,611 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2018-12-01 13:05:55,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 13:05:55,611 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 65 [2018-12-01 13:05:55,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:05:55,612 INFO L225 Difference]: With dead ends: 111 [2018-12-01 13:05:55,612 INFO L226 Difference]: Without dead ends: 111 [2018-12-01 13:05:55,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=1184, Unknown=0, NotChecked=0, Total=1332 [2018-12-01 13:05:55,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-01 13:05:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2018-12-01 13:05:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-01 13:05:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2018-12-01 13:05:55,615 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 65 [2018-12-01 13:05:55,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:05:55,616 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2018-12-01 13:05:55,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-01 13:05:55,616 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2018-12-01 13:05:55,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-01 13:05:55,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:05:55,616 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:05:55,616 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:05:55,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:05:55,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1787915394, now seen corresponding path program 1 times [2018-12-01 13:05:55,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:05:55,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:05:55,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:55,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:55,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:05:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 13:05:56,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:05:56,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/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 [2018-12-01 13:05:56,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:05:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:05:56,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:05:56,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:05:56,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:05:56,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:05:56,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-01 13:05:56,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:05:56,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:05:56,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 13:05:56,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:05:56,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:05:56,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-01 13:05:56,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 13:05:56,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-01 13:05:56,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:05:56,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:05:56,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:05:56,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2018-12-01 13:05:57,922 WARN L180 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-01 13:05:57,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-12-01 13:05:57,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-12-01 13:05:57,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:05:57,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:05:57,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:05:57,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:22 [2018-12-01 13:05:57,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-01 13:05:57,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-01 13:05:57,968 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:05:57,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:05:57,974 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. [2018-12-01 13:05:57,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:9 [2018-12-01 13:06:13,285 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-01 13:06:13,290 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 37 treesize of output 30 [2018-12-01 13:06:13,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:06:13,296 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 30 treesize of output 28 [2018-12-01 13:06:13,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:06:13,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:06:13,304 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. [2018-12-01 13:06:13,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-01 13:06:13,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-12-01 13:06:13,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-12-01 13:06:13,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:06:13,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:06:13,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:06:13,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:5 [2018-12-01 13:06:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-01 13:06:13,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:06:13,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 49 [2018-12-01 13:06:13,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-01 13:06:13,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-01 13:06:13,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2306, Unknown=13, NotChecked=0, Total=2450 [2018-12-01 13:06:13,464 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand 50 states. [2018-12-01 13:06:16,133 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-01 13:06:18,374 WARN L180 SmtUtils]: Spent 950.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-01 13:06:19,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:06:19,006 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2018-12-01 13:06:19,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-01 13:06:19,007 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 68 [2018-12-01 13:06:19,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:06:19,007 INFO L225 Difference]: With dead ends: 134 [2018-12-01 13:06:19,007 INFO L226 Difference]: Without dead ends: 134 [2018-12-01 13:06:19,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=383, Invalid=5006, Unknown=13, NotChecked=0, Total=5402 [2018-12-01 13:06:19,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-01 13:06:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 113. [2018-12-01 13:06:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-01 13:06:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2018-12-01 13:06:19,011 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 68 [2018-12-01 13:06:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:06:19,012 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2018-12-01 13:06:19,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-01 13:06:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2018-12-01 13:06:19,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-01 13:06:19,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:06:19,012 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:06:19,013 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:06:19,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:06:19,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1787915393, now seen corresponding path program 1 times [2018-12-01 13:06:19,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:06:19,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:06:19,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:06:19,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:06:19,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:06:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:06:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 13:06:19,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:06:19,641 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/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 [2018-12-01 13:06:19,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:06:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:06:19,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:06:19,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:06:19,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:06:19,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:06:19,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-01 13:06:19,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:06:19,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:06:19,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 13:06:19,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:06:19,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:06:19,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-01 13:06:19,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 13:06:19,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-01 13:06:19,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:06:19,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:06:19,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 13:06:19,958 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 [2018-12-01 13:06:19,959 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:06:19,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:06:19,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:06:19,970 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:20 [2018-12-01 13:06:20,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-12-01 13:06:20,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-12-01 13:06:20,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:06:20,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:06:20,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-12-01 13:06:20,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-12-01 13:06:20,726 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:06:20,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:06:20,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:06:20,743 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:108, output treesize:39 [2018-12-01 13:06:20,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-01 13:06:20,871 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 25 treesize of output 17 [2018-12-01 13:06:20,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:06:20,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:06:20,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-01 13:06:20,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-01 13:06:20,891 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:06:20,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:06:20,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:06:20,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:12 [2018-12-01 13:07:47,072 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-01 13:07:47,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-12-01 13:07:47,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:07:47,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-12-01 13:07:47,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:47,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:47,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-12-01 13:07:47,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:07:47,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-12-01 13:07:47,109 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:47,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:47,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:07:47,119 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:44 [2018-12-01 13:07:47,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-12-01 13:07:47,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2018-12-01 13:07:47,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:47,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:47,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-12-01 13:07:47,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-12-01 13:07:47,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:47,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:47,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:47,270 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:11 [2018-12-01 13:07:47,356 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-01 13:07:47,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:07:47,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 57 [2018-12-01 13:07:47,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-01 13:07:47,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-01 13:07:47,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3101, Unknown=38, NotChecked=0, Total=3306 [2018-12-01 13:07:47,372 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 58 states. [2018-12-01 13:07:51,482 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2018-12-01 13:07:52,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:07:52,683 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2018-12-01 13:07:52,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-01 13:07:52,684 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 68 [2018-12-01 13:07:52,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:07:52,685 INFO L225 Difference]: With dead ends: 137 [2018-12-01 13:07:52,685 INFO L226 Difference]: Without dead ends: 137 [2018-12-01 13:07:52,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 91.5s TimeCoverageRelationStatistics Valid=466, Invalid=5976, Unknown=38, NotChecked=0, Total=6480 [2018-12-01 13:07:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-01 13:07:52,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2018-12-01 13:07:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-01 13:07:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2018-12-01 13:07:52,691 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 68 [2018-12-01 13:07:52,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:07:52,691 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2018-12-01 13:07:52,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-01 13:07:52,691 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2018-12-01 13:07:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-01 13:07:52,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:07:52,692 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:07:52,692 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:07:52,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:07:52,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1896395852, now seen corresponding path program 2 times [2018-12-01 13:07:52,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:07:52,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:07:52,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:52,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:07:52,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:07:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-01 13:07:52,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:07:52,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 13:07:52,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 13:07:52,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 13:07:52,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:07:52,731 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 7 states. [2018-12-01 13:07:52,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:07:52,785 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-12-01 13:07:52,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 13:07:52,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-12-01 13:07:52,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:07:52,785 INFO L225 Difference]: With dead ends: 98 [2018-12-01 13:07:52,786 INFO L226 Difference]: Without dead ends: 98 [2018-12-01 13:07:52,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-01 13:07:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-01 13:07:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-01 13:07:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-01 13:07:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-12-01 13:07:52,788 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 71 [2018-12-01 13:07:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:07:52,789 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-12-01 13:07:52,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 13:07:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-12-01 13:07:52,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-01 13:07:52,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:07:52,790 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:07:52,790 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:07:52,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:07:52,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1466991259, now seen corresponding path program 1 times [2018-12-01 13:07:52,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:07:52,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:07:52,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:52,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:07:52,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:07:52,838 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-01 13:07:52,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:07:52,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 13:07:52,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 13:07:52,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 13:07:52,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:07:52,839 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 7 states. [2018-12-01 13:07:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:07:52,925 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-12-01 13:07:52,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 13:07:52,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2018-12-01 13:07:52,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:07:52,926 INFO L225 Difference]: With dead ends: 113 [2018-12-01 13:07:52,926 INFO L226 Difference]: Without dead ends: 113 [2018-12-01 13:07:52,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-01 13:07:52,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-01 13:07:52,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2018-12-01 13:07:52,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-01 13:07:52,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-12-01 13:07:52,928 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 90 [2018-12-01 13:07:52,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:07:52,928 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-12-01 13:07:52,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 13:07:52,929 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-12-01 13:07:52,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-01 13:07:52,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:07:52,929 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:07:52,930 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:07:52,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:07:52,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1466991260, now seen corresponding path program 1 times [2018-12-01 13:07:52,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:07:52,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:07:52,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:52,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:07:52,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:07:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-01 13:07:53,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:07:53,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/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 [2018-12-01 13:07:53,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:07:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:07:53,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:07:53,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:07:53,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:53,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:53,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 13:07:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-01 13:07:53,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 13:07:53,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 25 [2018-12-01 13:07:53,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-01 13:07:53,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-01 13:07:53,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-12-01 13:07:53,444 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 26 states. [2018-12-01 13:07:53,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:07:53,770 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-12-01 13:07:53,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 13:07:53,771 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 90 [2018-12-01 13:07:53,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:07:53,772 INFO L225 Difference]: With dead ends: 105 [2018-12-01 13:07:53,772 INFO L226 Difference]: Without dead ends: 105 [2018-12-01 13:07:53,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 73 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2018-12-01 13:07:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-01 13:07:53,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2018-12-01 13:07:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-01 13:07:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-01 13:07:53,775 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 90 [2018-12-01 13:07:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:07:53,775 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-01 13:07:53,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-01 13:07:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-01 13:07:53,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 13:07:53,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:07:53,776 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:07:53,776 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:07:53,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:07:53,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1842980103, now seen corresponding path program 1 times [2018-12-01 13:07:53,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:07:53,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:07:53,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:53,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:07:53,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:07:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-01 13:07:53,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 13:07:53,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-01 13:07:53,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 13:07:53,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 13:07:53,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-01 13:07:53,848 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 12 states. [2018-12-01 13:07:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:07:53,940 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-12-01 13:07:53,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 13:07:53,940 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-12-01 13:07:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:07:53,941 INFO L225 Difference]: With dead ends: 104 [2018-12-01 13:07:53,941 INFO L226 Difference]: Without dead ends: 102 [2018-12-01 13:07:53,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-12-01 13:07:53,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-01 13:07:53,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-12-01 13:07:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-01 13:07:53,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-12-01 13:07:53,944 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 93 [2018-12-01 13:07:53,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:07:53,944 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-12-01 13:07:53,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 13:07:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-12-01 13:07:53,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-01 13:07:53,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:07:53,945 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:07:53,945 INFO L423 AbstractCegarLoop]: === Iteration 24 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:07:53,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:07:53,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1382814895, now seen corresponding path program 1 times [2018-12-01 13:07:53,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:07:53,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:07:53,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:53,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:07:53,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:07:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:07:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-01 13:07:54,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:07:54,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/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 [2018-12-01 13:07:54,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:07:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:07:54,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:07:54,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:07:54,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 13:07:54,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 13:07:54,724 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 [2018-12-01 13:07:54,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 13:07:54,738 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 [2018-12-01 13:07:54,738 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,744 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-12-01 13:07:54,776 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 25 treesize of output 20 [2018-12-01 13:07:54,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:07:54,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-01 13:07:54,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-01 13:07:54,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:07:54,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-01 13:07:54,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,802 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:30 [2018-12-01 13:07:54,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:07:54,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:07:54,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 13:07:54,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-12-01 13:07:54,948 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:07:54,949 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 23 treesize of output 18 [2018-12-01 13:07:54,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-01 13:07:54,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,963 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 23 treesize of output 18 [2018-12-01 13:07:54,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-01 13:07:54,965 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,967 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:54,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:26 [2018-12-01 13:07:57,881 WARN L180 SmtUtils]: Spent 2.47 s on a formula simplification that was a NOOP. DAG size: 30 [2018-12-01 13:07:57,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2018-12-01 13:07:57,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-12-01 13:07:57,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:57,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:57,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-12-01 13:07:57,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-12-01 13:07:57,915 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:57,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:57,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:57,924 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:37 [2018-12-01 13:07:57,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-01 13:07:57,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-01 13:07:57,982 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:07:57,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:07:57,997 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 9 treesize of output 7 [2018-12-01 13:07:57,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-01 13:07:57,998 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:57,999 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:58,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:07:58,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:12 [2018-12-01 13:07:58,159 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 37 treesize of output 30 [2018-12-01 13:07:58,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:07:58,162 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 30 treesize of output 28 [2018-12-01 13:07:58,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:58,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:58,180 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 25 treesize of output 20 [2018-12-01 13:07:58,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:07:58,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-01 13:07:58,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:58,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:07:58,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:07:58,194 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:72, output treesize:42 [2018-12-01 13:07:58,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-12-01 13:07:58,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2018-12-01 13:07:58,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 13:07:58,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 13:07:58,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-01 13:07:58,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-12-01 13:07:58,711 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-01 13:07:58,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 13:07:58,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-01 13:07:58,728 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:74 [2018-12-01 13:07:58,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:07:58,908 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 [2018-12-01 13:07:58,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:07:58,913 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. [2018-12-01 13:07:58,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:14 [2018-12-01 13:07:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-01 13:07:59,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:07:59,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 37] total 65 [2018-12-01 13:07:59,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-01 13:07:59,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-01 13:07:59,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4090, Unknown=5, NotChecked=0, Total=4290 [2018-12-01 13:07:59,037 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 66 states. [2018-12-01 13:08:02,405 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-01 13:08:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:08:05,998 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-12-01 13:08:05,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-01 13:08:05,998 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 95 [2018-12-01 13:08:05,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:08:05,999 INFO L225 Difference]: With dead ends: 115 [2018-12-01 13:08:05,999 INFO L226 Difference]: Without dead ends: 115 [2018-12-01 13:08:06,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=516, Invalid=8032, Unknown=8, NotChecked=0, Total=8556 [2018-12-01 13:08:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-01 13:08:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2018-12-01 13:08:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-01 13:08:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2018-12-01 13:08:06,002 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 95 [2018-12-01 13:08:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:08:06,002 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2018-12-01 13:08:06,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-01 13:08:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2018-12-01 13:08:06,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-01 13:08:06,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:08:06,003 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:08:06,003 INFO L423 AbstractCegarLoop]: === Iteration 25 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:08:06,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:08:06,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1382814894, now seen corresponding path program 1 times [2018-12-01 13:08:06,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:08:06,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:08:06,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:08:06,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:08:06,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:08:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:08:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-01 13:08:07,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:08:07,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/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 [2018-12-01 13:08:07,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:08:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:08:07,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:08:07,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:08:07,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:08:07,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:08:07,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:08:07,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:08:07,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-01 13:08:07,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:08:07,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:08:07,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 13:08:07,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:08:07,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 13:08:07,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:08:07,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:08:07,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-12-01 13:08:07,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 13:08:07,465 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 [2018-12-01 13:08:07,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:08:07,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:08:07,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 13:08:07,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-01 13:08:07,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:08:07,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:08:07,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:08:07,490 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:51 [2018-12-01 13:08:07,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-01 13:08:07,752 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 15 treesize of output 7 [2018-12-01 13:08:07,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:08:07,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:08:07,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-01 13:08:07,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-01 13:08:07,765 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:08:07,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:08:07,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:08:07,777 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:21 [2018-12-01 13:08:33,647 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 38 [2018-12-01 13:08:33,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2018-12-01 13:08:33,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-12-01 13:08:33,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:08:33,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:08:33,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-12-01 13:08:33,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-12-01 13:08:33,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:08:33,692 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:08:33,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:08:33,704 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:131, output treesize:65 [2018-12-01 13:08:33,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-01 13:08:33,758 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 15 treesize of output 7 [2018-12-01 13:08:33,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:08:33,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:08:33,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-01 13:08:33,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-01 13:08:33,768 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:08:33,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:08:33,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:08:33,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:21 [2018-12-01 13:09:07,559 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-01 13:09:07,567 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 37 treesize of output 30 [2018-12-01 13:09:07,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:09:07,573 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 30 treesize of output 28 [2018-12-01 13:09:07,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:09:07,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:09:07,600 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 34 treesize of output 27 [2018-12-01 13:09:07,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:09:07,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-12-01 13:09:07,604 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:09:07,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:09:07,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:09:07,620 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:98, output treesize:65 [2018-12-01 13:09:08,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-12-01 13:09:08,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2018-12-01 13:09:08,014 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 13:09:08,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 13:09:08,035 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 [2018-12-01 13:09:08,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 19 [2018-12-01 13:09:08,040 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-01 13:09:08,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 13:09:08,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-12-01 13:09:08,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:100 [2018-12-01 13:09:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-01 13:09:08,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:09:08,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 65 [2018-12-01 13:09:08,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-01 13:09:08,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-01 13:09:08,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4060, Unknown=23, NotChecked=0, Total=4290 [2018-12-01 13:09:08,388 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 66 states. [2018-12-01 13:09:55,460 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 43 [2018-12-01 13:10:09,869 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 40 [2018-12-01 13:11:11,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:11:11,587 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-12-01 13:11:11,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-01 13:11:11,588 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 95 [2018-12-01 13:11:11,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:11:11,588 INFO L225 Difference]: With dead ends: 117 [2018-12-01 13:11:11,588 INFO L226 Difference]: Without dead ends: 117 [2018-12-01 13:11:11,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1862 ImplicationChecksByTransitivity, 67.6s TimeCoverageRelationStatistics Valid=600, Invalid=8119, Unknown=23, NotChecked=0, Total=8742 [2018-12-01 13:11:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-01 13:11:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2018-12-01 13:11:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-01 13:11:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2018-12-01 13:11:11,591 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 95 [2018-12-01 13:11:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:11:11,591 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2018-12-01 13:11:11,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-01 13:11:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2018-12-01 13:11:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-01 13:11:11,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:11:11,592 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:11:11,592 INFO L423 AbstractCegarLoop]: === Iteration 26 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:11:11,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:11:11,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1886386321, now seen corresponding path program 1 times [2018-12-01 13:11:11,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:11:11,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:11:11,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:11:11,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:11:11,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:11:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:11:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-01 13:11:12,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:11:12,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/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 [2018-12-01 13:11:12,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:11:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:11:12,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:11:12,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 13:11:12,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-01 13:11:12,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:11:12,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:11:12,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:11:12,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:57 [2018-12-01 13:11:12,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:11:12,748 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-01 13:11:12,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:11:12,750 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 39 [2018-12-01 13:11:12,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:11:12,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:11:12,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-12-01 13:11:12,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-12-01 13:11:12,764 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:11:12,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:11:12,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:11:12,774 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:22 [2018-12-01 13:11:27,004 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-01 13:11:27,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:11:27,013 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 84 treesize of output 88 [2018-12-01 13:11:27,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-12-01 13:11:27,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:11:27,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:11:27,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:11:27,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:108, output treesize:75 [2018-12-01 13:11:27,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:11:27,108 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-01 13:11:27,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:11:27,110 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 39 [2018-12-01 13:11:27,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:11:27,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:11:27,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-12-01 13:11:27,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-12-01 13:11:27,131 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:11:27,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:11:27,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:11:27,141 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:22 [2018-12-01 13:11:27,246 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 66 treesize of output 55 [2018-12-01 13:11:27,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:11:27,252 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 55 treesize of output 57 [2018-12-01 13:11:27,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:11:27,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:11:27,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-01 13:11:27,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:75 [2018-12-01 13:11:27,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:11:27,371 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-12-01 13:11:27,373 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 29 treesize of output 27 [2018-12-01 13:11:27,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:11:27,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:11:27,382 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. [2018-12-01 13:11:27,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:43 [2018-12-01 13:11:27,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:11:27,532 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-01 13:11:27,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:11:27,535 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 39 [2018-12-01 13:11:27,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:11:27,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:11:27,546 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. [2018-12-01 13:11:27,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:43 [2018-12-01 13:11:27,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-12-01 13:11:27,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:11:27,719 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. [2018-12-01 13:11:27,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:30 [2018-12-01 13:11:29,841 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-01 13:11:32,094 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2018-12-01 13:11:34,159 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2018-12-01 13:11:34,163 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-01 13:11:34,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:11:34,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:11:34,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:90, output treesize:1 [2018-12-01 13:11:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-01 13:11:34,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:11:34,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 62 [2018-12-01 13:11:34,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-01 13:11:34,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-01 13:11:34,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3570, Unknown=8, NotChecked=0, Total=3782 [2018-12-01 13:11:34,209 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 62 states. [2018-12-01 13:11:41,803 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2018-12-01 13:11:52,610 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2018-12-01 13:11:54,662 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-01 13:11:56,067 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-01 13:11:56,320 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-12-01 13:12:02,711 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-01 13:12:03,362 WARN L180 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-01 13:12:03,694 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-12-01 13:12:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:12:03,716 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2018-12-01 13:12:03,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-01 13:12:03,716 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 98 [2018-12-01 13:12:03,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:12:03,717 INFO L225 Difference]: With dead ends: 172 [2018-12-01 13:12:03,717 INFO L226 Difference]: Without dead ends: 170 [2018-12-01 13:12:03,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=655, Invalid=9036, Unknown=11, NotChecked=0, Total=9702 [2018-12-01 13:12:03,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-01 13:12:03,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 106. [2018-12-01 13:12:03,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-01 13:12:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-12-01 13:12:03,720 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 98 [2018-12-01 13:12:03,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:12:03,720 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-12-01 13:12:03,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-01 13:12:03,720 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-12-01 13:12:03,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 13:12:03,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:12:03,721 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:12:03,721 INFO L423 AbstractCegarLoop]: === Iteration 27 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:12:03,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:12:03,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1675854939, now seen corresponding path program 2 times [2018-12-01 13:12:03,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:12:03,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:12:03,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:12:03,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 13:12:03,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:12:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:12:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-01 13:12:05,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:12:05,505 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:12:05,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 13:12:05,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 13:12:05,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 13:12:05,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:12:05,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:12:05,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:05,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:05,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 13:12:05,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 13:12:05,634 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 [2018-12-01 13:12:05,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:05,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:05,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-01 13:12:05,643 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 [2018-12-01 13:12:05,643 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:05,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:05,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:05,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-12-01 13:12:05,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:05,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:05,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 13:12:05,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:05,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-01 13:12:05,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-01 13:12:05,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:05,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-01 13:12:05,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:05,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:05,974 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:05,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-01 13:12:05,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-01 13:12:05,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:05,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-01 13:12:05,994 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:05,999 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,003 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,011 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:78, output treesize:50 [2018-12-01 13:12:06,123 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:12:06,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-12-01 13:12:06,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-01 13:12:06,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-12-01 13:12:06,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-01 13:12:06,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,148 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,156 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:56 [2018-12-01 13:12:06,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:06,420 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:12:06,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 142 [2018-12-01 13:12:06,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:06,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2018-12-01 13:12:06,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:06,447 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:12:06,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 78 [2018-12-01 13:12:06,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:06,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2018-12-01 13:12:06,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,460 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,466 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:143, output treesize:53 [2018-12-01 13:12:06,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-12-01 13:12:06,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:06,579 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 47 treesize of output 64 [2018-12-01 13:12:06,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2018-12-01 13:12:06,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:06,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-01 13:12:06,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,602 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:06,608 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:53 [2018-12-01 13:12:07,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-01 13:12:07,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:07,112 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. [2018-12-01 13:12:07,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:63, output treesize:62 [2018-12-01 13:12:07,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:07,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:07,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-01 13:12:07,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:07,217 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:12:07,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2018-12-01 13:12:07,221 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 13:12:07,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-12-01 13:12:07,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:12:07,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-12-01 13:12:07,233 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-01 13:12:07,239 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 13:12:07,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-12-01 13:12:07,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:07,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-01 13:12:07,257 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:07,259 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:07,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-12-01 13:12:07,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-12-01 13:12:07,270 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-01 13:12:07,275 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 13:12:07,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-01 13:12:07,286 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-12-01 13:12:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-01 13:12:07,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:12:07,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39] total 58 [2018-12-01 13:12:07,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-01 13:12:07,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-01 13:12:07,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3108, Unknown=2, NotChecked=0, Total=3306 [2018-12-01 13:12:07,427 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 58 states. [2018-12-01 13:12:08,045 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-12-01 13:12:10,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:12:10,847 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2018-12-01 13:12:10,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-01 13:12:10,847 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 100 [2018-12-01 13:12:10,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:12:10,848 INFO L225 Difference]: With dead ends: 184 [2018-12-01 13:12:10,848 INFO L226 Difference]: Without dead ends: 184 [2018-12-01 13:12:10,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 64 SyntacticMatches, 25 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=524, Invalid=6956, Unknown=2, NotChecked=0, Total=7482 [2018-12-01 13:12:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-01 13:12:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 168. [2018-12-01 13:12:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-01 13:12:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2018-12-01 13:12:10,851 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 100 [2018-12-01 13:12:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:12:10,851 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2018-12-01 13:12:10,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-01 13:12:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2018-12-01 13:12:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-01 13:12:10,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:12:10,851 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 13:12:10,852 INFO L423 AbstractCegarLoop]: === Iteration 28 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:12:10,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:12:10,852 INFO L82 PathProgramCache]: Analyzing trace with hash 693259079, now seen corresponding path program 2 times [2018-12-01 13:12:10,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:12:10,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:12:10,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:12:10,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:12:10,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:12:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:12:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-01 13:12:12,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:12:12,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:12:12,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 13:12:12,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 13:12:12,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 13:12:12,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:12:12,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:12,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:12,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2018-12-01 13:12:12,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 13:12:12,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-01 13:12:12,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:12,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:12,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:12,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:42 [2018-12-01 13:12:13,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:13,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-01 13:12:13,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:13,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-12-01 13:12:13,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:13,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:13,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-01 13:12:13,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-12-01 13:12:13,071 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:12:13,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:12:13,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:12:13,091 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:18 [2018-12-01 13:12:28,785 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-01 13:12:28,806 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 70 treesize of output 71 [2018-12-01 13:12:28,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:28,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:28,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 61 [2018-12-01 13:12:28,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-01 13:12:28,872 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 61 treesize of output 37 [2018-12-01 13:12:28,872 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:28,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 13:12:28,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-01 13:12:28,920 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:89, output treesize:116 [2018-12-01 13:12:29,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:29,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-12-01 13:12:29,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-12-01 13:12:29,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:29,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:29,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:29,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-12-01 13:12:29,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:29,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-12-01 13:12:29,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:29,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:29,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-12-01 13:12:29,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-12-01 13:12:29,127 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:12:29,132 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:12:29,145 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 31 treesize of output 29 [2018-12-01 13:12:29,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-01 13:12:29,146 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:29,151 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:29,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-01 13:12:29,161 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:92, output treesize:37 [2018-12-01 13:12:39,736 WARN L180 SmtUtils]: Spent 755.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-01 13:12:39,742 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 74 treesize of output 65 [2018-12-01 13:12:39,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 36 [2018-12-01 13:12:39,751 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 13:12:39,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-01 13:12:39,841 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 75 treesize of output 70 [2018-12-01 13:12:39,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:39,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-01 13:12:39,845 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:39,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:39,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-12-01 13:12:39,911 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:150, output treesize:161 [2018-12-01 13:12:40,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:40,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2018-12-01 13:12:40,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-12-01 13:12:40,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:40,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:40,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:40,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2018-12-01 13:12:40,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-12-01 13:12:40,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:40,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:40,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:40,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-12-01 13:12:40,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:40,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-12-01 13:12:40,190 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:40,194 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:40,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-01 13:12:40,208 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:116, output treesize:67 [2018-12-01 13:12:42,298 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 44 DAG size of output: 12 [2018-12-01 13:12:42,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:42,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2018-12-01 13:12:42,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-12-01 13:12:42,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:42,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:42,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:42,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-12-01 13:12:42,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:42,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-12-01 13:12:42,463 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:42,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:42,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:42,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-12-01 13:12:42,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 13:12:42,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-12-01 13:12:42,492 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:42,495 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 13:12:42,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-01 13:12:42,508 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:116, output treesize:67 [2018-12-01 13:12:42,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 13:12:42,977 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 42 treesize of output 34 [2018-12-01 13:12:42,978 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 34 treesize of output 26 [2018-12-01 13:12:42,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:12:42,983 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 13:12:42,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 13:12:42,987 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:55, output treesize:26 [2018-12-01 13:12:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-01 13:12:53,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:12:53,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 58 [2018-12-01 13:12:53,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-01 13:12:53,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-01 13:12:53,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=3185, Unknown=32, NotChecked=0, Total=3422 [2018-12-01 13:12:53,458 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand 59 states. [2018-12-01 13:13:02,852 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-01 13:13:04,413 WARN L180 SmtUtils]: Spent 727.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-01 13:13:08,320 WARN L180 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-01 13:13:08,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:13:08,825 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2018-12-01 13:13:08,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-01 13:13:08,826 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 103 [2018-12-01 13:13:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:13:08,826 INFO L225 Difference]: With dead ends: 197 [2018-12-01 13:13:08,827 INFO L226 Difference]: Without dead ends: 135 [2018-12-01 13:13:08,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 78 SyntacticMatches, 13 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 46.0s TimeCoverageRelationStatistics Valid=496, Invalid=6612, Unknown=32, NotChecked=0, Total=7140 [2018-12-01 13:13:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-01 13:13:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2018-12-01 13:13:08,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-01 13:13:08,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2018-12-01 13:13:08,831 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 103 [2018-12-01 13:13:08,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:13:08,831 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2018-12-01 13:13:08,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-01 13:13:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2018-12-01 13:13:08,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-01 13:13:08,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 13:13:08,832 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 13:13:08,832 INFO L423 AbstractCegarLoop]: === Iteration 29 === [sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr1REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION]=== [2018-12-01 13:13:08,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 13:13:08,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1054346185, now seen corresponding path program 3 times [2018-12-01 13:13:08,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 13:13:08,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 13:13:08,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:13:08,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 13:13:08,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 13:13:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 13:13:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-01 13:13:08,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 13:13:08,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 13:13:08,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-01 13:13:08,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-01 13:13:08,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 13:13:08,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 13:13:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-01 13:13:09,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 13:13:09,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-01 13:13:09,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 13:13:09,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 13:13:09,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-01 13:13:09,004 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand 7 states. [2018-12-01 13:13:09,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 13:13:09,036 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-12-01 13:13:09,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 13:13:09,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-01 13:13:09,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 13:13:09,036 INFO L225 Difference]: With dead ends: 44 [2018-12-01 13:13:09,036 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 13:13:09,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-01 13:13:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 13:13:09,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 13:13:09,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 13:13:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 13:13:09,037 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2018-12-01 13:13:09,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 13:13:09,037 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 13:13:09,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 13:13:09,037 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 13:13:09,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 13:13:09,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 01:13:09 BoogieIcfgContainer [2018-12-01 13:13:09,041 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 13:13:09,042 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 13:13:09,042 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 13:13:09,042 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 13:13:09,042 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 01:05:43" (3/4) ... [2018-12-01 13:13:09,045 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 13:13:09,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 13:13:09,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-01 13:13:09,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-12-01 13:13:09,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_update_at [2018-12-01 13:13:09,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-01 13:13:09,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-01 13:13:09,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-12-01 13:13:09,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_get_data_at [2018-12-01 13:13:09,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 13:13:09,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-12-01 13:13:09,056 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-01 13:13:09,056 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-01 13:13:09,056 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-01 13:13:09,097 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_29a87266-908a-4557-92f4-37c1da1eb568/bin-2019/uautomizer/witness.graphml [2018-12-01 13:13:09,098 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 13:13:09,098 INFO L168 Benchmark]: Toolchain (without parser) took 446425.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 951.7 MB in the beginning and 1.2 GB in the end (delta: -216.6 MB). Peak memory consumption was 354.6 MB. Max. memory is 11.5 GB. [2018-12-01 13:13:09,098 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 13:13:09,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-01 13:13:09,099 INFO L168 Benchmark]: Boogie Preprocessor took 34.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-01 13:13:09,099 INFO L168 Benchmark]: RCFGBuilder took 277.33 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: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. [2018-12-01 13:13:09,099 INFO L168 Benchmark]: TraceAbstraction took 445753.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.2 MB). Free memory was 1.1 GB in the beginning and 786.5 MB in the end (delta: 269.6 MB). Peak memory consumption was 316.8 MB. Max. memory is 11.5 GB. [2018-12-01 13:13:09,099 INFO L168 Benchmark]: Witness Printer took 55.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -7.3 MB). Free memory was 786.5 MB in the beginning and 1.2 GB in the end (delta: -381.8 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-12-01 13:13:09,100 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 302.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 277.33 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: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 445753.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.2 MB). Free memory was 1.1 GB in the beginning and 786.5 MB in the end (delta: 269.6 MB). Peak memory consumption was 316.8 MB. Max. memory is 11.5 GB. * Witness Printer took 55.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -7.3 MB). Free memory was 786.5 MB in the beginning and 1.2 GB in the end (delta: -381.8 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 602]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 94 locations, 19 error locations. SAFE Result, 445.7s OverallTime, 29 OverallIterations, 3 TraceHistogramMax, 197.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1791 SDtfs, 2631 SDslu, 14231 SDs, 0 SdLazy, 26395 SolverSat, 755 SolverUnsat, 81 SolverUnknown, 0 SolverNotchecked, 152.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1843 GetRequests, 861 SyntacticMatches, 87 SemanticMatches, 895 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12471 ImplicationChecksByTransitivity, 282.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=27, 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.0s AutomataMinimizationTime, 29 MinimizatonAttempts, 279 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 246.4s InterpolantComputationTime, 2839 NumberOfCodeBlocks, 2839 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2796 ConstructedInterpolants, 308 QuantifiedInterpolants, 3120418 SizeOfPredicates, 254 NumberOfNonLiveVariables, 4979 ConjunctsInSsa, 979 ConjunctsInUnsatCore, 43 InterpolantComputations, 17 PerfectInterpolantSequences, 807/1206 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...