./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/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 ef034042979fe1e524a3655a8992190a25335ff0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 10:26:46,276 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 10:26:46,277 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 10:26:46,285 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 10:26:46,285 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 10:26:46,285 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 10:26:46,286 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 10:26:46,287 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 10:26:46,288 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 10:26:46,289 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 10:26:46,290 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 10:26:46,290 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 10:26:46,290 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 10:26:46,291 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 10:26:46,292 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 10:26:46,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 10:26:46,293 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 10:26:46,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 10:26:46,295 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 10:26:46,296 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 10:26:46,297 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 10:26:46,298 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 10:26:46,299 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 10:26:46,299 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 10:26:46,300 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 10:26:46,300 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 10:26:46,301 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 10:26:46,302 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 10:26:46,302 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 10:26:46,302 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 10:26:46,303 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 10:26:46,303 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 10:26:46,303 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 10:26:46,303 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 10:26:46,303 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 10:26:46,304 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 10:26:46,304 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-08 10:26:46,310 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 10:26:46,311 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 10:26:46,311 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 10:26:46,311 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 10:26:46,311 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 10:26:46,311 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 10:26:46,311 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 10:26:46,312 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 10:26:46,312 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 10:26:46,312 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 10:26:46,312 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 10:26:46,312 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 10:26:46,312 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 10:26:46,312 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 10:26:46,312 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 10:26:46,312 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 10:26:46,312 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 10:26:46,312 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 10:26:46,312 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 10:26:46,313 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 10:26:46,313 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 10:26:46,313 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 10:26:46,313 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 10:26:46,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 10:26:46,313 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 10:26:46,313 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 10:26:46,313 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 10:26:46,313 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 10:26:46,313 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_742f1cd9-303f-4c69-8403-a449c61338da/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 -> ef034042979fe1e524a3655a8992190a25335ff0 [2018-12-08 10:26:46,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 10:26:46,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 10:26:46,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 10:26:46,343 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 10:26:46,343 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 10:26:46,344 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 10:26:46,379 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/bin-2019/uautomizer/data/d6b797a8b/e0f88ecfb1d54b38aedb7a9ba0a588a5/FLAG1e766e531 [2018-12-08 10:26:46,693 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 10:26:46,694 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 10:26:46,700 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/bin-2019/uautomizer/data/d6b797a8b/e0f88ecfb1d54b38aedb7a9ba0a588a5/FLAG1e766e531 [2018-12-08 10:26:47,105 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/bin-2019/uautomizer/data/d6b797a8b/e0f88ecfb1d54b38aedb7a9ba0a588a5 [2018-12-08 10:26:47,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 10:26:47,108 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-08 10:26:47,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 10:26:47,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 10:26:47,111 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 10:26:47,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:26:47" (1/1) ... [2018-12-08 10:26:47,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2985f7ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:26:47, skipping insertion in model container [2018-12-08 10:26:47,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:26:47" (1/1) ... [2018-12-08 10:26:47,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 10:26:47,136 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 10:26:47,284 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:26:47,291 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 10:26:47,360 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:26:47,380 INFO L195 MainTranslator]: Completed translation [2018-12-08 10:26:47,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:26:47 WrapperNode [2018-12-08 10:26:47,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 10:26:47,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 10:26:47,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 10:26:47,381 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 10:26:47,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:26:47" (1/1) ... [2018-12-08 10:26:47,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:26:47" (1/1) ... [2018-12-08 10:26:47,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:26:47" (1/1) ... [2018-12-08 10:26:47,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:26:47" (1/1) ... [2018-12-08 10:26:47,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:26:47" (1/1) ... [2018-12-08 10:26:47,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:26:47" (1/1) ... [2018-12-08 10:26:47,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:26:47" (1/1) ... [2018-12-08 10:26:47,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 10:26:47,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 10:26:47,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 10:26:47,414 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 10:26:47,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:26:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/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-08 10:26:47,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 10:26:47,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 10:26:47,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-08 10:26:47,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-08 10:26:47,444 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-08 10:26:47,445 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-08 10:26:47,445 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-08 10:26:47,445 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-12-08 10:26:47,445 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-12-08 10:26:47,445 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-12-08 10:26:47,445 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 10:26:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-08 10:26:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-08 10:26:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-08 10:26:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-08 10:26:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-08 10:26:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-08 10:26:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-08 10:26:47,445 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-08 10:26:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-08 10:26:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-08 10:26:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-08 10:26:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-08 10:26:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-08 10:26:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-08 10:26:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-08 10:26:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-08 10:26:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-08 10:26:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-08 10:26:47,446 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-08 10:26:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-08 10:26:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-08 10:26:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-08 10:26:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-08 10:26:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-08 10:26:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-08 10:26:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-08 10:26:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-08 10:26:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-08 10:26:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-08 10:26:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-08 10:26:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-08 10:26:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-08 10:26:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-08 10:26:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-08 10:26:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-08 10:26:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-08 10:26:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-08 10:26:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-08 10:26:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-08 10:26:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-08 10:26:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-08 10:26:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-08 10:26:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-08 10:26:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-08 10:26:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-08 10:26:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-08 10:26:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-08 10:26:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-08 10:26:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-08 10:26:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-08 10:26:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-08 10:26:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-08 10:26:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-08 10:26:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-08 10:26:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-08 10:26:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-08 10:26:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-08 10:26:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-08 10:26:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-08 10:26:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-08 10:26:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-08 10:26:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-08 10:26:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-08 10:26:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-08 10:26:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-08 10:26:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-08 10:26:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-08 10:26:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-08 10:26:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-08 10:26:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-08 10:26:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-08 10:26:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-08 10:26:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-08 10:26:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-08 10:26:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-08 10:26:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-08 10:26:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-08 10:26:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-08 10:26:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-08 10:26:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-08 10:26:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-08 10:26:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-08 10:26:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-08 10:26:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-08 10:26:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-08 10:26:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-08 10:26:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-08 10:26:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-08 10:26:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-08 10:26:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-08 10:26:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-08 10:26:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-08 10:26:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-08 10:26:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-08 10:26:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-08 10:26:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-08 10:26:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-08 10:26:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 10:26:47,452 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-12-08 10:26:47,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 10:26:47,453 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-12-08 10:26:47,453 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 10:26:47,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 10:26:47,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 10:26:47,722 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 10:26:47,723 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-08 10:26:47,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:26:47 BoogieIcfgContainer [2018-12-08 10:26:47,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 10:26:47,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 10:26:47,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 10:26:47,726 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 10:26:47,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 10:26:47" (1/3) ... [2018-12-08 10:26:47,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef839de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:26:47, skipping insertion in model container [2018-12-08 10:26:47,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:26:47" (2/3) ... [2018-12-08 10:26:47,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef839de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:26:47, skipping insertion in model container [2018-12-08 10:26:47,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:26:47" (3/3) ... [2018-12-08 10:26:47,728 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 10:26:47,734 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 10:26:47,739 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-12-08 10:26:47,754 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-12-08 10:26:47,774 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 10:26:47,775 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 10:26:47,775 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 10:26:47,775 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 10:26:47,775 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 10:26:47,775 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 10:26:47,775 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 10:26:47,775 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 10:26:47,776 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 10:26:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-12-08 10:26:47,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 10:26:47,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:26:47,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:26:47,793 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:26:47,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:26:47,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1323720086, now seen corresponding path program 1 times [2018-12-08 10:26:47,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:26:47,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:26:47,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:47,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:47,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:47,908 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-08 10:26:47,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:26:47,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 10:26:47,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:26:47,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:26:47,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:26:47,921 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2018-12-08 10:26:47,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:26:47,969 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-12-08 10:26:47,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:26:47,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 10:26:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:26:47,978 INFO L225 Difference]: With dead ends: 84 [2018-12-08 10:26:47,979 INFO L226 Difference]: Without dead ends: 77 [2018-12-08 10:26:47,980 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-08 10:26:47,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-08 10:26:48,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-08 10:26:48,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-08 10:26:48,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-12-08 10:26:48,008 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 13 [2018-12-08 10:26:48,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:26:48,009 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-12-08 10:26:48,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:26:48,009 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-12-08 10:26:48,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 10:26:48,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:26:48,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:26:48,009 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:26:48,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:26:48,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1323720085, now seen corresponding path program 1 times [2018-12-08 10:26:48,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:26:48,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:26:48,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:48,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:48,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:48,054 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-08 10:26:48,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:26:48,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 10:26:48,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:26:48,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:26:48,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:26:48,056 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 3 states. [2018-12-08 10:26:48,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:26:48,083 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-12-08 10:26:48,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:26:48,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 10:26:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:26:48,084 INFO L225 Difference]: With dead ends: 75 [2018-12-08 10:26:48,084 INFO L226 Difference]: Without dead ends: 75 [2018-12-08 10:26:48,084 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-08 10:26:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-08 10:26:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-08 10:26:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-08 10:26:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-12-08 10:26:48,088 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 13 [2018-12-08 10:26:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:26:48,089 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-12-08 10:26:48,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:26:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-12-08 10:26:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 10:26:48,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:26:48,089 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-08 10:26:48,089 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:26:48,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:26:48,090 INFO L82 PathProgramCache]: Analyzing trace with hash 303614154, now seen corresponding path program 1 times [2018-12-08 10:26:48,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:26:48,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:26:48,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:48,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:48,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:48,127 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-08 10:26:48,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:26:48,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:26:48,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:26:48,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:26:48,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:26:48,128 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2018-12-08 10:26:48,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:26:48,166 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2018-12-08 10:26:48,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:26:48,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-08 10:26:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:26:48,169 INFO L225 Difference]: With dead ends: 86 [2018-12-08 10:26:48,169 INFO L226 Difference]: Without dead ends: 83 [2018-12-08 10:26:48,169 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-08 10:26:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-08 10:26:48,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2018-12-08 10:26:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-08 10:26:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-12-08 10:26:48,179 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 18 [2018-12-08 10:26:48,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:26:48,179 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-12-08 10:26:48,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:26:48,179 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-12-08 10:26:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 10:26:48,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:26:48,180 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-08 10:26:48,180 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:26:48,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:26:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash -677829022, now seen corresponding path program 1 times [2018-12-08 10:26:48,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:26:48,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:26:48,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:48,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:48,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:48,230 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-08 10:26:48,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:26:48,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:26:48,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:26:48,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:26:48,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:26:48,231 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 6 states. [2018-12-08 10:26:48,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:26:48,317 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-12-08 10:26:48,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 10:26:48,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-08 10:26:48,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:26:48,319 INFO L225 Difference]: With dead ends: 76 [2018-12-08 10:26:48,319 INFO L226 Difference]: Without dead ends: 76 [2018-12-08 10:26:48,319 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-08 10:26:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-08 10:26:48,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-12-08 10:26:48,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-08 10:26:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-12-08 10:26:48,323 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 19 [2018-12-08 10:26:48,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:26:48,323 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-12-08 10:26:48,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:26:48,323 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-12-08 10:26:48,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 10:26:48,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:26:48,324 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-08 10:26:48,324 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:26:48,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:26:48,324 INFO L82 PathProgramCache]: Analyzing trace with hash -677829021, now seen corresponding path program 1 times [2018-12-08 10:26:48,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:26:48,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:26:48,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:48,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:48,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:48,371 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-08 10:26:48,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:26:48,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:26:48,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:26:48,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:26:48,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:26:48,372 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 6 states. [2018-12-08 10:26:48,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:26:48,438 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-12-08 10:26:48,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 10:26:48,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-08 10:26:48,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:26:48,439 INFO L225 Difference]: With dead ends: 75 [2018-12-08 10:26:48,439 INFO L226 Difference]: Without dead ends: 75 [2018-12-08 10:26:48,439 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-08 10:26:48,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-08 10:26:48,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-12-08 10:26:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-08 10:26:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-12-08 10:26:48,443 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 19 [2018-12-08 10:26:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:26:48,443 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-12-08 10:26:48,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:26:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-12-08 10:26:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 10:26:48,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:26:48,443 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-08 10:26:48,444 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:26:48,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:26:48,444 INFO L82 PathProgramCache]: Analyzing trace with hash 649435046, now seen corresponding path program 1 times [2018-12-08 10:26:48,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:26:48,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:26:48,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:48,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:48,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:48,526 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-08 10:26:48,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:26:48,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 10:26:48,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 10:26:48,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 10:26:48,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:26:48,527 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 12 states. [2018-12-08 10:26:48,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:26:48,712 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-12-08 10:26:48,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 10:26:48,713 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-08 10:26:48,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:26:48,713 INFO L225 Difference]: With dead ends: 80 [2018-12-08 10:26:48,713 INFO L226 Difference]: Without dead ends: 80 [2018-12-08 10:26:48,714 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-08 10:26:48,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-08 10:26:48,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-12-08 10:26:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-08 10:26:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-12-08 10:26:48,717 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 31 [2018-12-08 10:26:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:26:48,717 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-12-08 10:26:48,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 10:26:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-12-08 10:26:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 10:26:48,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:26:48,718 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-08 10:26:48,718 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:26:48,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:26:48,718 INFO L82 PathProgramCache]: Analyzing trace with hash 649435047, now seen corresponding path program 1 times [2018-12-08 10:26:48,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:26:48,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:26:48,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:48,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:48,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:48,751 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-08 10:26:48,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:26:48,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/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-08 10:26:48,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:48,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:26:48,811 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-08 10:26:48,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:26:48,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-08 10:26:48,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:26:48,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:26:48,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:26:48,827 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 6 states. [2018-12-08 10:26:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:26:48,862 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-12-08 10:26:48,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 10:26:48,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-08 10:26:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:26:48,864 INFO L225 Difference]: With dead ends: 91 [2018-12-08 10:26:48,864 INFO L226 Difference]: Without dead ends: 88 [2018-12-08 10:26:48,864 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-08 10:26:48,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-08 10:26:48,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2018-12-08 10:26:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-08 10:26:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-12-08 10:26:48,868 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 31 [2018-12-08 10:26:48,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:26:48,868 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-12-08 10:26:48,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:26:48,868 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-12-08 10:26:48,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 10:26:48,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:26:48,869 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-08 10:26:48,870 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:26:48,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:26:48,870 INFO L82 PathProgramCache]: Analyzing trace with hash 40947275, now seen corresponding path program 2 times [2018-12-08 10:26:48,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:26:48,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:26:48,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:48,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:48,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:49,009 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-08 10:26:49,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:26:49,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 10:26:49,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 10:26:49,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 10:26:49,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-08 10:26:49,011 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 13 states. [2018-12-08 10:26:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:26:49,162 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-12-08 10:26:49,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 10:26:49,162 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-12-08 10:26:49,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:26:49,163 INFO L225 Difference]: With dead ends: 86 [2018-12-08 10:26:49,163 INFO L226 Difference]: Without dead ends: 86 [2018-12-08 10:26:49,163 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-08 10:26:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-08 10:26:49,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2018-12-08 10:26:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-08 10:26:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-12-08 10:26:49,168 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 44 [2018-12-08 10:26:49,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:26:49,168 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-12-08 10:26:49,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 10:26:49,168 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-12-08 10:26:49,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 10:26:49,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:26:49,169 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] [2018-12-08 10:26:49,170 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:26:49,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:26:49,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2009121221, now seen corresponding path program 1 times [2018-12-08 10:26:49,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:26:49,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:26:49,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:49,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:26:49,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:49,227 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 10:26:49,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:26:49,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 10:26:49,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 10:26:49,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 10:26:49,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 10:26:49,228 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 9 states. [2018-12-08 10:26:49,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:26:49,333 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-12-08 10:26:49,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 10:26:49,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-12-08 10:26:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:26:49,334 INFO L225 Difference]: With dead ends: 94 [2018-12-08 10:26:49,335 INFO L226 Difference]: Without dead ends: 94 [2018-12-08 10:26:49,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:26:49,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-08 10:26:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2018-12-08 10:26:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-08 10:26:49,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-12-08 10:26:49,337 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 46 [2018-12-08 10:26:49,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:26:49,337 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-12-08 10:26:49,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 10:26:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-12-08 10:26:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 10:26:49,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:26:49,338 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] [2018-12-08 10:26:49,338 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:26:49,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:26:49,339 INFO L82 PathProgramCache]: Analyzing trace with hash -2009121220, now seen corresponding path program 1 times [2018-12-08 10:26:49,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:26:49,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:26:49,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:49,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:49,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:49,362 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-08 10:26:49,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:26:49,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:26:49,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:26:49,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:26:49,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:26:49,363 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 4 states. [2018-12-08 10:26:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:26:49,379 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2018-12-08 10:26:49,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 10:26:49,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-08 10:26:49,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:26:49,380 INFO L225 Difference]: With dead ends: 92 [2018-12-08 10:26:49,380 INFO L226 Difference]: Without dead ends: 92 [2018-12-08 10:26:49,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:26:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-08 10:26:49,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2018-12-08 10:26:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-08 10:26:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2018-12-08 10:26:49,383 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 46 [2018-12-08 10:26:49,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:26:49,383 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2018-12-08 10:26:49,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:26:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2018-12-08 10:26:49,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 10:26:49,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:26:49,384 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-08 10:26:49,384 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:26:49,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:26:49,384 INFO L82 PathProgramCache]: Analyzing trace with hash 91149112, now seen corresponding path program 1 times [2018-12-08 10:26:49,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:26:49,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:26:49,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:49,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:49,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:49,415 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 10:26:49,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:26:49,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:26:49,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:26:49,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:26:49,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:26:49,415 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 5 states. [2018-12-08 10:26:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:26:49,437 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2018-12-08 10:26:49,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:26:49,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-08 10:26:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:26:49,437 INFO L225 Difference]: With dead ends: 97 [2018-12-08 10:26:49,437 INFO L226 Difference]: Without dead ends: 97 [2018-12-08 10:26:49,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:26:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-08 10:26:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2018-12-08 10:26:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-08 10:26:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-12-08 10:26:49,440 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 47 [2018-12-08 10:26:49,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:26:49,441 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-12-08 10:26:49,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:26:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-12-08 10:26:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 10:26:49,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:26:49,442 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] [2018-12-08 10:26:49,442 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:26:49,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:26:49,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1790381074, now seen corresponding path program 1 times [2018-12-08 10:26:49,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:26:49,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:26:49,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:49,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:49,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 10:26:49,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:26:49,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 10:26:49,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 10:26:49,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 10:26:49,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:26:49,526 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 12 states. [2018-12-08 10:26:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:26:49,695 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2018-12-08 10:26:49,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 10:26:49,695 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-12-08 10:26:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:26:49,696 INFO L225 Difference]: With dead ends: 97 [2018-12-08 10:26:49,696 INFO L226 Difference]: Without dead ends: 97 [2018-12-08 10:26:49,696 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-08 10:26:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-08 10:26:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-12-08 10:26:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-08 10:26:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-12-08 10:26:49,700 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 54 [2018-12-08 10:26:49,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:26:49,700 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-12-08 10:26:49,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 10:26:49,700 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-12-08 10:26:49,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 10:26:49,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:26:49,701 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] [2018-12-08 10:26:49,701 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:26:49,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:26:49,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1790381075, now seen corresponding path program 1 times [2018-12-08 10:26:49,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:26:49,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:26:49,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:49,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:49,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:49,743 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 10:26:49,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:26:49,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/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-08 10:26:49,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:49,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:26:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 10:26:49,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:26:49,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-08 10:26:49,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:26:49,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:26:49,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:26:49,807 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 7 states. [2018-12-08 10:26:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:26:49,864 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2018-12-08 10:26:49,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 10:26:49,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-08 10:26:49,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:26:49,865 INFO L225 Difference]: With dead ends: 108 [2018-12-08 10:26:49,865 INFO L226 Difference]: Without dead ends: 108 [2018-12-08 10:26:49,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:26:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-08 10:26:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2018-12-08 10:26:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-08 10:26:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2018-12-08 10:26:49,869 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 54 [2018-12-08 10:26:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:26:49,869 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2018-12-08 10:26:49,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:26:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2018-12-08 10:26:49,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 10:26:49,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:26:49,870 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:26:49,870 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:26:49,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:26:49,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1855516484, now seen corresponding path program 1 times [2018-12-08 10:26:49,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:26:49,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:26:49,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:49,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:49,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 10:26:50,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:26:50,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/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-08 10:26:50,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:50,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:26:50,309 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-08 10:26:50,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:26:50,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:26:50,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 10:26:51,072 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-08 10:26:51,810 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-08 10:26:52,326 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-08 10:26:52,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:26:52,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:26:52,336 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-08 10:26:52,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-12-08 10:26:52,349 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-08 10:26:52,350 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-08 10:26:52,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:26:52,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:26:52,354 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-08 10:26:52,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-12-08 10:26:52,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-12-08 10:26:52,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-08 10:26:52,404 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-08 10:26:52,405 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-08 10:26:52,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:26:52,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-12-08 10:26:52,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-08 10:26:52,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:26:52,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-08 10:26:52,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:26:52,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:26:52,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:26:52,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2018-12-08 10:26:52,555 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-08 10:26:52,556 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:26:52,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 10:26:52,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:26:52,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:26:52,559 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-08 10:26:52,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:5 [2018-12-08 10:26:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 10:26:52,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:26:52,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 31 [2018-12-08 10:26:52,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-08 10:26:52,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-08 10:26:52,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=909, Unknown=5, NotChecked=0, Total=992 [2018-12-08 10:26:52,606 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 32 states. [2018-12-08 10:26:53,259 WARN L180 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2018-12-08 10:26:53,848 WARN L180 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-12-08 10:26:54,422 WARN L180 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2018-12-08 10:26:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:26:55,343 INFO L93 Difference]: Finished difference Result 166 states and 189 transitions. [2018-12-08 10:26:55,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-08 10:26:55,344 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 55 [2018-12-08 10:26:55,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:26:55,344 INFO L225 Difference]: With dead ends: 166 [2018-12-08 10:26:55,344 INFO L226 Difference]: Without dead ends: 166 [2018-12-08 10:26:55,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 44 SyntacticMatches, 10 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=299, Invalid=2558, Unknown=5, NotChecked=0, Total=2862 [2018-12-08 10:26:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-08 10:26:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 117. [2018-12-08 10:26:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-08 10:26:55,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2018-12-08 10:26:55,350 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 55 [2018-12-08 10:26:55,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:26:55,350 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2018-12-08 10:26:55,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-08 10:26:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2018-12-08 10:26:55,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 10:26:55,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:26:55,351 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:26:55,351 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:26:55,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:26:55,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1855516485, now seen corresponding path program 1 times [2018-12-08 10:26:55,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:26:55,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:26:55,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:55,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:55,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:26:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:55,774 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 10:26:55,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:26:55,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/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-08 10:26:55,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:26:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:26:55,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:26:55,808 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-08 10:26:55,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:26:55,814 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-08 10:26:55,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:26:55,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:26:55,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 10:26:57,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:26:57,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:26:57,165 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-08 10:26:57,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:26:57,172 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-08 10:26:57,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:26:57,178 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-08 10:26:57,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-12-08 10:26:57,239 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-08 10:26:57,241 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-08 10:26:57,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:26:57,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:26:57,252 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-08 10:26:57,253 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-08 10:26:57,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:26:57,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:26:57,261 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-08 10:26:57,261 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:42 [2018-12-08 10:26:57,471 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-08 10:26:57,472 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-08 10:26:57,473 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-08 10:26:57,475 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-08 10:26:57,484 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 9 treesize of output 7 [2018-12-08 10:26:57,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 10:26:57,485 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:26:57,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:26:57,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:26:57,492 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:48, output treesize:21 [2018-12-08 10:26:57,626 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-08 10:26:57,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:26:57,630 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-08 10:26:57,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:26:57,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:26:57,656 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-08 10:26:57,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:26:57,660 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-08 10:26:57,660 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:26:57,663 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:26:57,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 10:26:57,672 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:86, output treesize:56 [2018-12-08 10:26:57,800 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-08 10:26:57,801 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-08 10:26:57,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:26:57,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:26:57,812 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-08 10:26:57,813 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-08 10:26:57,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:26:57,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:26:57,819 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-08 10:26:57,819 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:60, output treesize:18 [2018-12-08 10:26:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 10:26:57,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:26:57,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 43 [2018-12-08 10:26:57,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-08 10:26:57,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-08 10:26:57,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1775, Unknown=3, NotChecked=0, Total=1892 [2018-12-08 10:26:57,917 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 44 states. [2018-12-08 10:27:00,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:27:00,136 INFO L93 Difference]: Finished difference Result 206 states and 236 transitions. [2018-12-08 10:27:00,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-08 10:27:00,136 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 55 [2018-12-08 10:27:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:27:00,137 INFO L225 Difference]: With dead ends: 206 [2018-12-08 10:27:00,137 INFO L226 Difference]: Without dead ends: 206 [2018-12-08 10:27:00,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=332, Invalid=3697, Unknown=3, NotChecked=0, Total=4032 [2018-12-08 10:27:00,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-08 10:27:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 131. [2018-12-08 10:27:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-08 10:27:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2018-12-08 10:27:00,142 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 55 [2018-12-08 10:27:00,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:27:00,142 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2018-12-08 10:27:00,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-08 10:27:00,143 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2018-12-08 10:27:00,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 10:27:00,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:27:00,143 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-08 10:27:00,143 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:27:00,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:27:00,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1464096766, now seen corresponding path program 2 times [2018-12-08 10:27:00,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:27:00,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:27:00,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:27:00,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:27:00,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:27:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:27:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 10:27:00,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:27:00,179 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/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-08 10:27:00,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 10:27:00,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 10:27:00,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 10:27:00,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:27:00,215 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 10:27:00,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:27:00,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-08 10:27:00,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:27:00,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:27:00,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:27:00,230 INFO L87 Difference]: Start difference. First operand 131 states and 155 transitions. Second operand 7 states. [2018-12-08 10:27:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:27:00,265 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-12-08 10:27:00,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 10:27:00,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2018-12-08 10:27:00,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:27:00,266 INFO L225 Difference]: With dead ends: 112 [2018-12-08 10:27:00,267 INFO L226 Difference]: Without dead ends: 112 [2018-12-08 10:27:00,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 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-08 10:27:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-08 10:27:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-08 10:27:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-08 10:27:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2018-12-08 10:27:00,270 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 58 [2018-12-08 10:27:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:27:00,270 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2018-12-08 10:27:00,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:27:00,270 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2018-12-08 10:27:00,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 10:27:00,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:27:00,271 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] [2018-12-08 10:27:00,271 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:27:00,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:27:00,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1111258489, now seen corresponding path program 2 times [2018-12-08 10:27:00,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:27:00,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:27:00,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:27:00,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:27:00,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:27:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:27:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 10:27:00,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:27:00,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/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-08 10:27:00,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 10:27:00,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 10:27:00,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 10:27:00,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:27:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 10:27:00,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 10:27:00,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-12-08 10:27:00,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 10:27:00,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 10:27:00,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-08 10:27:00,378 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 9 states. [2018-12-08 10:27:00,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:27:00,470 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2018-12-08 10:27:00,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:27:00,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2018-12-08 10:27:00,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:27:00,471 INFO L225 Difference]: With dead ends: 110 [2018-12-08 10:27:00,471 INFO L226 Difference]: Without dead ends: 104 [2018-12-08 10:27:00,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-12-08 10:27:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-08 10:27:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-08 10:27:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-08 10:27:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-12-08 10:27:00,474 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 62 [2018-12-08 10:27:00,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:27:00,475 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-12-08 10:27:00,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 10:27:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-12-08 10:27:00,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 10:27:00,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:27:00,475 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-08 10:27:00,475 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:27:00,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:27:00,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1030898547, now seen corresponding path program 1 times [2018-12-08 10:27:00,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:27:00,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:27:00,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:27:00,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:27:00,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:27:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:27:00,596 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-08 10:27:00,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:27:00,596 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/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-08 10:27:00,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:27:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:27:00,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:27:00,629 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-08 10:27:00,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:00,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:00,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 10:27:00,812 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-08 10:27:00,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 10:27:00,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 25 [2018-12-08 10:27:00,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-08 10:27:00,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-08 10:27:00,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-12-08 10:27:00,828 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 26 states. [2018-12-08 10:27:01,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:27:01,051 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-12-08 10:27:01,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 10:27:01,052 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 65 [2018-12-08 10:27:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:27:01,052 INFO L225 Difference]: With dead ends: 109 [2018-12-08 10:27:01,052 INFO L226 Difference]: Without dead ends: 109 [2018-12-08 10:27:01,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2018-12-08 10:27:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-08 10:27:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2018-12-08 10:27:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-08 10:27:01,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-12-08 10:27:01,055 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 65 [2018-12-08 10:27:01,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:27:01,056 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-12-08 10:27:01,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-08 10:27:01,056 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-12-08 10:27:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 10:27:01,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:27:01,056 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:27:01,057 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:27:01,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:27:01,057 INFO L82 PathProgramCache]: Analyzing trace with hash 295194122, now seen corresponding path program 3 times [2018-12-08 10:27:01,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:27:01,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:27:01,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:27:01,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:27:01,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:27:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:27:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 10:27:01,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:27:01,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/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-08 10:27:01,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 10:27:01,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-08 10:27:01,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 10:27:01,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:27:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 10:27:01,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:27:01,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2018-12-08 10:27:01,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 10:27:01,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 10:27:01,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:27:01,165 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 12 states. [2018-12-08 10:27:01,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:27:01,226 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-12-08 10:27:01,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 10:27:01,227 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-12-08 10:27:01,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:27:01,227 INFO L225 Difference]: With dead ends: 96 [2018-12-08 10:27:01,227 INFO L226 Difference]: Without dead ends: 96 [2018-12-08 10:27:01,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-12-08 10:27:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-08 10:27:01,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-08 10:27:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-08 10:27:01,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-12-08 10:27:01,230 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 66 [2018-12-08 10:27:01,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:27:01,231 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-12-08 10:27:01,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 10:27:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-12-08 10:27:01,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 10:27:01,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:27:01,232 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-08 10:27:01,232 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:27:01,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:27:01,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1814159334, now seen corresponding path program 1 times [2018-12-08 10:27:01,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:27:01,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:27:01,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:27:01,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:27:01,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:27:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:27:01,262 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 10:27:01,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:27:01,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:27:01,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:27:01,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:27:01,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:27:01,263 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 5 states. [2018-12-08 10:27:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:27:01,286 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-12-08 10:27:01,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:27:01,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-08 10:27:01,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:27:01,287 INFO L225 Difference]: With dead ends: 102 [2018-12-08 10:27:01,288 INFO L226 Difference]: Without dead ends: 102 [2018-12-08 10:27:01,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:27:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-08 10:27:01,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-08 10:27:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-08 10:27:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-12-08 10:27:01,291 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 68 [2018-12-08 10:27:01,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:27:01,291 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-12-08 10:27:01,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:27:01,291 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-12-08 10:27:01,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 10:27:01,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:27:01,292 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:27:01,292 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:27:01,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:27:01,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2068123706, now seen corresponding path program 1 times [2018-12-08 10:27:01,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:27:01,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:27:01,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:27:01,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:27:01,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:27:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:27:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 10:27:01,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:27:01,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/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-08 10:27:01,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:27:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:27:01,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:27:01,998 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-08 10:27:01,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:01,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:01,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 10:27:02,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:27:02,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:27:02,192 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-08 10:27:02,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:02,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:02,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-08 10:27:02,248 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-08 10:27:02,249 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-08 10:27:02,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:02,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:02,254 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-08 10:27:02,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2018-12-08 10:27:02,954 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2018-12-08 10:27:02,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-12-08 10:27:02,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:27:02,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-08 10:27:02,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:02,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:02,965 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-08 10:27:02,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:10 [2018-12-08 10:27:05,142 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-08 10:27:05,148 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-08 10:27:05,150 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-08 10:27:05,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:05,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:05,155 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-08 10:27:05,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:22 [2018-12-08 10:27:05,377 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-08 10:27:05,378 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-08 10:27:05,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:05,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:05,382 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-08 10:27:05,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:5 [2018-12-08 10:27:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2018-12-08 10:27:05,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:27:05,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 29] total 62 [2018-12-08 10:27:05,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-08 10:27:05,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-08 10:27:05,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=3632, Unknown=1, NotChecked=120, Total=3906 [2018-12-08 10:27:05,447 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 63 states. [2018-12-08 10:27:09,278 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2018-12-08 10:27:10,456 WARN L180 SmtUtils]: Spent 876.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-12-08 10:27:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:27:11,492 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-12-08 10:27:11,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-08 10:27:11,493 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 79 [2018-12-08 10:27:11,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:27:11,493 INFO L225 Difference]: With dead ends: 122 [2018-12-08 10:27:11,493 INFO L226 Difference]: Without dead ends: 122 [2018-12-08 10:27:11,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 94 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1584 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=506, Invalid=8427, Unknown=1, NotChecked=186, Total=9120 [2018-12-08 10:27:11,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-08 10:27:11,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. [2018-12-08 10:27:11,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-08 10:27:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-12-08 10:27:11,496 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 79 [2018-12-08 10:27:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:27:11,497 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-12-08 10:27:11,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-08 10:27:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-12-08 10:27:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 10:27:11,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:27:11,497 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:27:11,497 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:27:11,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:27:11,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2068123705, now seen corresponding path program 1 times [2018-12-08 10:27:11,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:27:11,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:27:11,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:27:11,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:27:11,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:27:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:27:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 10:27:12,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:27:12,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/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-08 10:27:12,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:27:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:27:12,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:27:12,266 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-08 10:27:12,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:12,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:12,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 10:27:12,375 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-08 10:27:12,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:12,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:12,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-08 10:27:12,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:27:12,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:27:12,463 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-08 10:27:12,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:12,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:12,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-12-08 10:27:12,523 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-08 10:27:12,525 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-08 10:27:12,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:12,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:12,531 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-08 10:27:12,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-12-08 10:27:12,708 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 10 treesize of output 8 [2018-12-08 10:27:12,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2018-12-08 10:27:12,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:12,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:12,715 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-08 10:27:12,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:9 [2018-12-08 10:27:12,793 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 15 treesize of output 12 [2018-12-08 10:27:12,794 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 12 treesize of output 1 [2018-12-08 10:27:12,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:12,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:12,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:27:12,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2018-12-08 10:27:21,853 WARN L180 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-08 10:27:21,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-12-08 10:27:21,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:27:21,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-08 10:27:21,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:21,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:21,871 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-08 10:27:21,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2018-12-08 10:27:21,915 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 10 treesize of output 8 [2018-12-08 10:27:21,916 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 8 treesize of output 4 [2018-12-08 10:27:21,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:21,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:21,922 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-08 10:27:21,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:12 [2018-12-08 10:27:24,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:27:24,225 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 120 treesize of output 124 [2018-12-08 10:27:24,228 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 36 treesize of output 1 [2018-12-08 10:27:24,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:24,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:24,249 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 74 treesize of output 75 [2018-12-08 10:27:24,251 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 36 treesize of output 1 [2018-12-08 10:27:24,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:24,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:24,263 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-08 10:27:24,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:62 [2018-12-08 10:27:29,872 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-08 10:27:29,874 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:27:29,874 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 33 treesize of output 25 [2018-12-08 10:27:29,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:29,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:29,888 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-08 10:27:29,890 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:27:29,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-12-08 10:27:29,890 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:27:29,893 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:27:29,900 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-08 10:27:29,900 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:75, output treesize:25 [2018-12-08 10:27:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 18 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 10:27:32,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:27:32,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 58 [2018-12-08 10:27:32,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-08 10:27:32,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-08 10:27:32,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=3248, Unknown=17, NotChecked=0, Total=3422 [2018-12-08 10:27:32,371 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 59 states. [2018-12-08 10:28:08,959 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2018-12-08 10:28:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:28:40,173 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-12-08 10:28:40,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-08 10:28:40,173 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 79 [2018-12-08 10:28:40,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:28:40,174 INFO L225 Difference]: With dead ends: 123 [2018-12-08 10:28:40,174 INFO L226 Difference]: Without dead ends: 123 [2018-12-08 10:28:40,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=430, Invalid=6514, Unknown=28, NotChecked=0, Total=6972 [2018-12-08 10:28:40,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-08 10:28:40,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2018-12-08 10:28:40,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-08 10:28:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-12-08 10:28:40,177 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 79 [2018-12-08 10:28:40,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:28:40,178 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-12-08 10:28:40,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-08 10:28:40,178 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-12-08 10:28:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 10:28:40,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:28:40,178 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:28:40,178 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:28:40,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:28:40,178 INFO L82 PathProgramCache]: Analyzing trace with hash -2068123650, now seen corresponding path program 1 times [2018-12-08 10:28:40,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:28:40,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:28:40,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:28:40,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:28:40,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:28:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:28:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 10:28:40,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:28:40,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/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-08 10:28:40,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:28:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:28:40,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:28:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 10:28:40,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:28:40,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-08 10:28:40,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 10:28:40,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 10:28:40,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:28:40,297 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 8 states. [2018-12-08 10:28:40,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:28:40,345 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-12-08 10:28:40,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:28:40,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2018-12-08 10:28:40,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:28:40,346 INFO L225 Difference]: With dead ends: 96 [2018-12-08 10:28:40,346 INFO L226 Difference]: Without dead ends: 96 [2018-12-08 10:28:40,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:28:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-08 10:28:40,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-08 10:28:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-08 10:28:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-12-08 10:28:40,348 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 79 [2018-12-08 10:28:40,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:28:40,348 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-12-08 10:28:40,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 10:28:40,348 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-12-08 10:28:40,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 10:28:40,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:28:40,348 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] [2018-12-08 10:28:40,349 INFO L423 AbstractCegarLoop]: === Iteration 24 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:28:40,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:28:40,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1402031402, now seen corresponding path program 1 times [2018-12-08 10:28:40,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:28:40,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:28:40,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:28:40,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:28:40,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:28:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:28:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-08 10:28:40,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:28:40,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/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-08 10:28:40,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:28:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:28:40,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:28:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 10:28:40,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 10:28:40,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-12-08 10:28:40,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 10:28:40,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 10:28:40,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-08 10:28:40,471 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 9 states. [2018-12-08 10:28:40,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:28:40,537 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-12-08 10:28:40,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:28:40,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-12-08 10:28:40,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:28:40,538 INFO L225 Difference]: With dead ends: 100 [2018-12-08 10:28:40,538 INFO L226 Difference]: Without dead ends: 96 [2018-12-08 10:28:40,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-12-08 10:28:40,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-08 10:28:40,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-08 10:28:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-08 10:28:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-12-08 10:28:40,540 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 87 [2018-12-08 10:28:40,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:28:40,540 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-12-08 10:28:40,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 10:28:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-12-08 10:28:40,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 10:28:40,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:28:40,541 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-08 10:28:40,541 INFO L423 AbstractCegarLoop]: === Iteration 25 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:28:40,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:28:40,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1467646416, now seen corresponding path program 1 times [2018-12-08 10:28:40,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:28:40,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:28:40,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:28:40,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:28:40,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:28:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:28:40,689 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-08 10:28:40,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:28:40,690 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/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-08 10:28:40,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:28:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:28:40,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:28:40,730 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-08 10:28:40,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:28:40,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:28:40,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 10:28:40,989 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-08 10:28:41,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 10:28:41,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 25 [2018-12-08 10:28:41,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-08 10:28:41,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-08 10:28:41,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-12-08 10:28:41,004 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 26 states. [2018-12-08 10:28:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:28:41,251 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-12-08 10:28:41,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 10:28:41,252 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 90 [2018-12-08 10:28:41,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:28:41,252 INFO L225 Difference]: With dead ends: 102 [2018-12-08 10:28:41,252 INFO L226 Difference]: Without dead ends: 102 [2018-12-08 10:28:41,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 73 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2018-12-08 10:28:41,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-08 10:28:41,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2018-12-08 10:28:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-08 10:28:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2018-12-08 10:28:41,255 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 90 [2018-12-08 10:28:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:28:41,255 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2018-12-08 10:28:41,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-08 10:28:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-12-08 10:28:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 10:28:41,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:28:41,256 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 10:28:41,256 INFO L423 AbstractCegarLoop]: === Iteration 26 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:28:41,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:28:41,257 INFO L82 PathProgramCache]: Analyzing trace with hash -114103981, now seen corresponding path program 1 times [2018-12-08 10:28:41,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:28:41,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:28:41,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:28:41,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:28:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:28:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:28:41,319 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-08 10:28:41,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:28:41,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 10:28:41,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 10:28:41,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 10:28:41,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:28:41,320 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 12 states. [2018-12-08 10:28:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:28:41,431 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2018-12-08 10:28:41,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 10:28:41,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-12-08 10:28:41,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:28:41,432 INFO L225 Difference]: With dead ends: 101 [2018-12-08 10:28:41,432 INFO L226 Difference]: Without dead ends: 99 [2018-12-08 10:28:41,433 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-08 10:28:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-08 10:28:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-12-08 10:28:41,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-08 10:28:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2018-12-08 10:28:41,435 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 93 [2018-12-08 10:28:41,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:28:41,435 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2018-12-08 10:28:41,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 10:28:41,435 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2018-12-08 10:28:41,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 10:28:41,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:28:41,436 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-08 10:28:41,436 INFO L423 AbstractCegarLoop]: === Iteration 27 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:28:41,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:28:41,436 INFO L82 PathProgramCache]: Analyzing trace with hash -944943971, now seen corresponding path program 1 times [2018-12-08 10:28:41,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:28:41,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:28:41,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:28:41,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:28:41,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:28:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:28:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 10:28:42,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:28:42,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/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-08 10:28:42,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:28:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:28:42,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:28:42,542 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-08 10:28:42,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:28:42,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:28:42,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 10:28:42,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:28:42,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:28:42,797 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-08 10:28:42,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:28:42,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:28:42,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-12-08 10:28:42,864 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-08 10:28:42,865 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-08 10:28:42,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:28:42,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:28:42,870 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-08 10:28:42,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-08 10:28:43,615 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2018-12-08 10:28:43,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-12-08 10:28:43,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:28:43,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-08 10:28:43,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:28:43,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:28:43,630 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-08 10:28:43,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2018-12-08 10:28:44,685 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (+ |c_sll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| .cse0) sll_update_at_~head.offset)))))) is different from true [2018-12-08 10:28:44,692 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 44 treesize of output 38 [2018-12-08 10:28:44,693 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-08 10:28:44,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:28:44,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:28:44,697 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-08 10:28:44,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:17 [2018-12-08 10:28:46,699 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_23 Int) (v_main_~s~0.offset_BEFORE_CALL_23 Int)) (and (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_23) (+ v_main_~s~0.offset_BEFORE_CALL_23 4)) v_main_~s~0.base_BEFORE_CALL_23)) (<= 0 v_main_~s~0.offset_BEFORE_CALL_23) (<= v_main_~s~0.offset_BEFORE_CALL_23 0))) is different from true [2018-12-08 10:28:48,751 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_24 Int) (v_main_~s~0.offset_BEFORE_CALL_24 Int)) (and (<= 0 v_main_~s~0.offset_BEFORE_CALL_24) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_24) (+ v_main_~s~0.offset_BEFORE_CALL_24 4)) v_main_~s~0.base_BEFORE_CALL_24)) (<= v_main_~s~0.offset_BEFORE_CALL_24 0))) is different from true [2018-12-08 10:28:52,805 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-08 10:28:53,523 WARN L180 SmtUtils]: Spent 668.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-08 10:28:55,577 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 22 [2018-12-08 10:28:57,635 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 24 [2018-12-08 10:28:57,831 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-08 10:28:57,836 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-08 10:28:57,837 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-08 10:28:57,852 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-08 10:28:57,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 10:28:57,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-08 10:28:58,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:28:58,032 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-08 10:28:58,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:28:58,035 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-08 10:28:58,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-12-08 10:28:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 9 not checked. [2018-12-08 10:28:58,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:28:58,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 37] total 76 [2018-12-08 10:28:58,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-08 10:28:58,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-08 10:28:58,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=5068, Unknown=5, NotChecked=580, Total=5852 [2018-12-08 10:28:58,112 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 77 states. [2018-12-08 10:29:00,537 WARN L180 SmtUtils]: Spent 935.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-12-08 10:29:02,884 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 43 [2018-12-08 10:29:14,586 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-12-08 10:29:15,003 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-12-08 10:29:15,462 WARN L180 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2018-12-08 10:29:15,905 WARN L180 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2018-12-08 10:29:16,633 WARN L180 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2018-12-08 10:29:17,182 WARN L180 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-12-08 10:29:17,529 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-12-08 10:29:17,851 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-08 10:29:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:29:18,609 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-12-08 10:29:18,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-08 10:29:18,610 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 95 [2018-12-08 10:29:18,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:29:18,610 INFO L225 Difference]: With dead ends: 109 [2018-12-08 10:29:18,610 INFO L226 Difference]: Without dead ends: 109 [2018-12-08 10:29:18,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 65 SyntacticMatches, 10 SemanticMatches, 120 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3053 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=691, Invalid=13120, Unknown=11, NotChecked=940, Total=14762 [2018-12-08 10:29:18,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-08 10:29:18,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2018-12-08 10:29:18,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-08 10:29:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-12-08 10:29:18,615 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 95 [2018-12-08 10:29:18,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:29:18,615 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-12-08 10:29:18,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-08 10:29:18,615 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-12-08 10:29:18,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 10:29:18,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:29:18,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, 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-08 10:29:18,616 INFO L423 AbstractCegarLoop]: === Iteration 28 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:29:18,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:29:18,616 INFO L82 PathProgramCache]: Analyzing trace with hash -944943970, now seen corresponding path program 1 times [2018-12-08 10:29:18,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:29:18,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:29:18,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:29:18,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:29:18,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:29:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:29:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 10:29:20,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:29:20,145 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:29:20,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:29:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:29:20,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:29:20,188 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-08 10:29:20,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:29:20,192 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-08 10:29:20,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:29:20,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:29:20,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 10:29:20,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:29:20,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:29:20,562 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-08 10:29:20,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:29:20,568 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-08 10:29:20,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:29:20,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:29:20,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-12-08 10:29:20,671 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-08 10:29:20,672 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-08 10:29:20,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:29:20,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:29:20,686 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-08 10:29:20,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, 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-08 10:29:20,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:29:20,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:29:20,697 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-08 10:29:20,697 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:48 [2018-12-08 10:29:20,989 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-08 10:29:20,991 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-08 10:29:20,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:29:20,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:29:20,998 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-08 10:29:21,000 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-08 10:29:21,000 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-08 10:29:21,003 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-08 10:29:21,008 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-08 10:29:21,008 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:21 [2018-12-08 10:29:35,640 WARN L180 SmtUtils]: Spent 2.20 s on a formula simplification that was a NOOP. DAG size: 37 [2018-12-08 10:29:35,649 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-08 10:29:35,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:29:35,656 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-08 10:29:35,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:29:35,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:29:35,683 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-08 10:29:35,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:29:35,686 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-08 10:29:35,687 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:29:35,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:29:35,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-08 10:29:35,703 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:98, output treesize:65 [2018-12-08 10:29:35,793 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-08 10:29:35,794 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-08 10:29:35,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:29:35,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:29:35,810 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-08 10:29:35,811 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-08 10:29:35,812 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-08 10:29:35,814 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-08 10:29:35,821 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-08 10:29:35,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:21 [2018-12-08 10:29:36,229 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 112 treesize of output 106 [2018-12-08 10:29:36,231 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 36 treesize of output 1 [2018-12-08 10:29:36,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:29:36,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:29:36,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 65 [2018-12-08 10:29:36,256 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 36 treesize of output 1 [2018-12-08 10:29:36,256 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:29:36,259 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:29:36,270 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-08 10:29:36,270 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:65 [2018-12-08 10:29:37,077 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-08 10:29:37,089 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-08 10:29:37,090 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-08 10:29:37,097 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-08 10:29:37,111 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-08 10:29:37,116 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-08 10:29:37,116 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 10:29:37,120 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 10:29:37,135 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-08 10:29:37,135 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:100 [2018-12-08 10:29:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 10:29:37,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:29:37,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 35] total 78 [2018-12-08 10:29:37,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-08 10:29:37,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-08 10:29:37,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=5928, Unknown=8, NotChecked=0, Total=6162 [2018-12-08 10:29:37,559 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 79 states. [2018-12-08 10:29:52,816 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 42 [2018-12-08 10:30:04,591 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2018-12-08 10:30:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:30:06,678 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-12-08 10:30:06,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-08 10:30:06,678 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 95 [2018-12-08 10:30:06,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:30:06,679 INFO L225 Difference]: With dead ends: 110 [2018-12-08 10:30:06,679 INFO L226 Difference]: Without dead ends: 110 [2018-12-08 10:30:06,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 61 SyntacticMatches, 10 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2154 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=695, Invalid=11953, Unknown=8, NotChecked=0, Total=12656 [2018-12-08 10:30:06,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-08 10:30:06,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2018-12-08 10:30:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-08 10:30:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-12-08 10:30:06,681 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 95 [2018-12-08 10:30:06,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:30:06,681 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-12-08 10:30:06,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-08 10:30:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-12-08 10:30:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 10:30:06,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:30:06,682 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-08 10:30:06,682 INFO L423 AbstractCegarLoop]: === Iteration 29 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:30:06,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:30:06,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1611562043, now seen corresponding path program 1 times [2018-12-08 10:30:06,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:30:06,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:30:06,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:30:06,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:30:06,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:30:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:30:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 10:30:07,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:30:07,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:30:07,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:30:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:30:07,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:30:07,362 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-08 10:30:07,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:07,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:07,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 10:30:07,501 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 11 treesize of output 8 [2018-12-08 10:30:07,502 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-08 10:30:07,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:07,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:07,510 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-08 10:30:07,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-12-08 10:30:07,711 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 27 treesize of output 22 [2018-12-08 10:30:07,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:07,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 10:30:07,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:07,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:07,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:07,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2018-12-08 10:30:08,280 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-08 10:30:08,288 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-08 10:30:08,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:30:08,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:38 [2018-12-08 10:30:08,995 WARN L180 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-08 10:30:09,532 WARN L180 SmtUtils]: Spent 491.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-08 10:30:09,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:09,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-12-08 10:30:09,542 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 13 treesize of output 16 [2018-12-08 10:30:09,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:09,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 10:30:09,546 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:09,550 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:09,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:09,566 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-08 10:30:09,566 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:60, output treesize:44 [2018-12-08 10:30:09,669 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-08 10:30:09,671 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-08 10:30:09,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:09,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:09,692 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-08 10:30:09,694 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-08 10:30:09,694 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:09,696 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:09,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:09,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2018-12-08 10:30:09,718 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 16 treesize of output 1 [2018-12-08 10:30:09,718 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:09,721 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:09,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:09,734 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:89, output treesize:80 [2018-12-08 10:30:10,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:10,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-12-08 10:30:10,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-12-08 10:30:10,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:10,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:10,135 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 41 treesize of output 35 [2018-12-08 10:30:10,137 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 35 treesize of output 23 [2018-12-08 10:30:10,137 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-08 10:30:10,145 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-08 10:30:10,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-08 10:30:10,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-08 10:30:10,161 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-08 10:30:10,163 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-08 10:30:10,174 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 7 treesize of output 5 [2018-12-08 10:30:10,176 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 5 treesize of output 3 [2018-12-08 10:30:10,176 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:10,177 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:10,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:30:10,186 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:94, output treesize:29 [2018-12-08 10:30:11,676 WARN L180 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-08 10:30:11,683 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 85 treesize of output 72 [2018-12-08 10:30:11,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:11,687 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 72 treesize of output 76 [2018-12-08 10:30:11,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:11,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:11,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:11,727 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 31 treesize of output 38 [2018-12-08 10:30:11,730 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-08 10:30:11,730 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:11,735 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:11,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-12-08 10:30:11,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:11,760 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 30 treesize of output 26 [2018-12-08 10:30:11,760 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:11,764 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:11,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:30:11,780 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:148, output treesize:88 [2018-12-08 10:30:11,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:11,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-12-08 10:30:11,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-12-08 10:30:11,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:11,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:11,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-12-08 10:30:11,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 10:30:11,903 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:11,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:11,915 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-08 10:30:11,916 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-08 10:30:11,916 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-08 10:30:11,919 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-08 10:30:11,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:30:11,937 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:94, output treesize:29 [2018-12-08 10:30:19,157 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 43 [2018-12-08 10:30:19,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 55 [2018-12-08 10:30:19,179 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 38 treesize of output 37 [2018-12-08 10:30:19,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:19,204 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 29 treesize of output 43 [2018-12-08 10:30:19,205 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 10:30:19,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 10:30:19,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:19,259 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 81 treesize of output 82 [2018-12-08 10:30:19,261 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 12 treesize of output 17 [2018-12-08 10:30:19,262 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:19,272 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:19,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 88 [2018-12-08 10:30:19,290 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 83 treesize of output 71 [2018-12-08 10:30:19,290 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:19,331 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 74 treesize of output 61 [2018-12-08 10:30:19,332 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 10:30:19,356 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 10:30:19,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:19,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 88 [2018-12-08 10:30:19,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-12-08 10:30:19,417 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:19,427 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:19,431 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-12-08 10:30:19,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-12-08 10:30:19,434 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:30:19,445 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:30:19,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 94 [2018-12-08 10:30:19,461 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 83 treesize of output 71 [2018-12-08 10:30:19,462 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:19,499 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 80 treesize of output 79 [2018-12-08 10:30:19,500 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 10:30:19,526 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 10:30:19,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 11 dim-0 vars, and 4 xjuncts. [2018-12-08 10:30:19,602 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:148, output treesize:298 [2018-12-08 10:30:23,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:23,998 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 53 treesize of output 44 [2018-12-08 10:30:24,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:24,001 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 39 [2018-12-08 10:30:24,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:24,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:24,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:24,025 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 36 treesize of output 39 [2018-12-08 10:30:24,026 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 15 [2018-12-08 10:30:24,026 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:24,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:24,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-08 10:30:24,048 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2018-12-08 10:30:32,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:32,505 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 53 treesize of output 50 [2018-12-08 10:30:32,507 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 27 [2018-12-08 10:30:32,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:32,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:32,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:32,529 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 36 treesize of output 39 [2018-12-08 10:30:32,530 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 15 [2018-12-08 10:30:32,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:32,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:32,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-08 10:30:32,548 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2018-12-08 10:30:45,138 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 95 treesize of output 93 [2018-12-08 10:30:45,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-08 10:30:45,141 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-08 10:30:45,160 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-08 10:30:45,161 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 106 treesize of output 104 [2018-12-08 10:30:45,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-08 10:30:45,163 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-08 10:30:45,183 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-08 10:30:45,309 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 106 treesize of output 98 [2018-12-08 10:30:45,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 10:30:45,311 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:45,326 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:45,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 99 [2018-12-08 10:30:45,335 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 95 treesize of output 93 [2018-12-08 10:30:45,335 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:45,384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 89 [2018-12-08 10:30:45,385 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-08 10:30:45,435 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 90 treesize of output 82 [2018-12-08 10:30:45,435 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:45,482 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:30:45,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 79 treesize of output 77 [2018-12-08 10:30:45,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2018-12-08 10:30:45,650 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:45,662 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:45,794 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 3 case distinctions, treesize of input 89 treesize of output 113 [2018-12-08 10:30:45,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 105 [2018-12-08 10:30:45,814 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2018-12-08 10:30:46,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 95 [2018-12-08 10:30:46,063 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 8 xjuncts. [2018-12-08 10:30:46,242 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 101 treesize of output 99 [2018-12-08 10:30:46,242 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:46,522 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 91 treesize of output 89 [2018-12-08 10:30:46,522 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:46,659 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2018-12-08 10:30:46,660 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-12-08 10:30:46,791 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 85 treesize of output 83 [2018-12-08 10:30:46,792 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:47,044 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 96 treesize of output 94 [2018-12-08 10:30:47,044 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:47,175 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2018-12-08 10:30:47,176 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-12-08 10:30:47,300 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 90 [2018-12-08 10:30:47,301 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-12-08 10:30:47,419 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 91 treesize of output 89 [2018-12-08 10:30:47,419 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:47,531 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 87 treesize of output 85 [2018-12-08 10:30:47,531 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:47,629 INFO L267 ElimStorePlain]: Start of recursive call 14: 13 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-08 10:30:47,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 104 [2018-12-08 10:30:47,638 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 100 treesize of output 98 [2018-12-08 10:30:47,638 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:47,697 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 94 [2018-12-08 10:30:47,698 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-12-08 10:30:47,766 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 95 treesize of output 93 [2018-12-08 10:30:47,767 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:47,830 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:30:48,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 4 dim-2 vars, End of recursive call: 38 dim-0 vars, and 10 xjuncts. [2018-12-08 10:30:48,087 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 18 variables, input treesize:425, output treesize:763 [2018-12-08 10:30:53,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,082 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 61 treesize of output 59 [2018-12-08 10:30:53,116 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 10:30:53,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:53,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-12-08 10:30:53,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:53,122 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 10:30:53,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:53,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 63 [2018-12-08 10:30:53,131 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:53,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 54 [2018-12-08 10:30:53,137 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:53,138 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 10:30:53,138 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:53,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 44 [2018-12-08 10:30:53,144 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:53,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:30:53,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 42 [2018-12-08 10:30:53,150 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:53,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:53,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:30:53,183 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:87, output treesize:24 [2018-12-08 10:30:55,577 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2018-12-08 10:30:57,644 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2018-12-08 10:30:57,648 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 10:30:57,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:30:57,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:30:57,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:120, output treesize:1 [2018-12-08 10:30:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 10:30:57,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:30:57,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 48] total 79 [2018-12-08 10:30:57,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-08 10:30:57,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-08 10:30:57,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=5847, Unknown=18, NotChecked=0, Total=6162 [2018-12-08 10:30:57,720 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 79 states. [2018-12-08 10:31:01,308 WARN L180 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-12-08 10:31:02,430 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2018-12-08 10:31:07,513 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 67 [2018-12-08 10:31:18,628 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-12-08 10:31:21,859 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2018-12-08 10:31:33,565 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2018-12-08 10:32:04,910 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-12-08 10:32:35,990 WARN L180 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2018-12-08 10:33:04,102 WARN L180 SmtUtils]: Spent 6.62 s on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2018-12-08 10:33:14,911 WARN L180 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2018-12-08 10:33:22,948 WARN L180 SmtUtils]: Spent 5.54 s on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2018-12-08 10:33:53,752 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2018-12-08 10:33:55,843 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-08 10:33:57,922 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2018-12-08 10:34:00,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:34:00,530 INFO L93 Difference]: Finished difference Result 200 states and 207 transitions. [2018-12-08 10:34:00,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-08 10:34:00,531 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 98 [2018-12-08 10:34:00,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:34:00,531 INFO L225 Difference]: With dead ends: 200 [2018-12-08 10:34:00,532 INFO L226 Difference]: Without dead ends: 196 [2018-12-08 10:34:00,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6702 ImplicationChecksByTransitivity, 131.6s TimeCoverageRelationStatistics Valid=1209, Invalid=20185, Unknown=68, NotChecked=0, Total=21462 [2018-12-08 10:34:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-08 10:34:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 111. [2018-12-08 10:34:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-08 10:34:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2018-12-08 10:34:00,536 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 98 [2018-12-08 10:34:00,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:34:00,536 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2018-12-08 10:34:00,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-08 10:34:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2018-12-08 10:34:00,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 10:34:00,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:34:00,537 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-08 10:34:00,537 INFO L423 AbstractCegarLoop]: === Iteration 30 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:34:00,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:34:00,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1188097393, now seen corresponding path program 2 times [2018-12-08 10:34:00,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:34:00,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:34:00,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:34:00,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:34:00,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:34:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:34:02,021 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-08 10:34:02,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:34:02,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:34:02,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 10:34:02,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 10:34:02,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 10:34:02,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:34:02,068 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-08 10:34:02,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,072 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-08 10:34:02,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 10:34:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-12-08 10:34:02,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,262 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-08 10:34:02,264 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-08 10:34:02,264 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,265 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,272 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-08 10:34:02,273 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-08 10:34:02,273 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,274 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,278 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-08 10:34:02,279 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:50, output treesize:30 [2018-12-08 10:34:02,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:02,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:02,558 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-08 10:34:02,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,579 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-08 10:34:02,581 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-08 10:34:02,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:02,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 10:34:02,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,610 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-08 10:34:02,612 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-08 10:34:02,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:02,615 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-08 10:34:02,616 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,619 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,623 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,632 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-08 10:34:02,632 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:78, output treesize:50 [2018-12-08 10:34:02,781 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:34:02,781 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-08 10:34:02,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 10:34:02,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,804 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-08 10:34:02,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 10:34:02,806 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,810 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:02,819 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-08 10:34:02,819 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:73, output treesize:56 [2018-12-08 10:34:03,241 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-08 10:34:03,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 15 [2018-12-08 10:34:03,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 10:34:03,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 10:34:03,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-12-08 10:34:03,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2018-12-08 10:34:03,286 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-08 10:34:03,292 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-08 10:34:03,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2018-12-08 10:34:03,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 38 [2018-12-08 10:34:03,307 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 10:34:03,319 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 10:34:03,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-08 10:34:03,342 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:86, output treesize:122 [2018-12-08 10:34:03,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 135 [2018-12-08 10:34:03,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 101 [2018-12-08 10:34:03,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 10:34:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 101 [2018-12-08 10:34:03,846 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 10:34:04,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 74 [2018-12-08 10:34:04,007 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:04,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:34:04,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84 [2018-12-08 10:34:04,162 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:34:04,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2018-12-08 10:34:04,164 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:04,170 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:04,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 117 [2018-12-08 10:34:04,198 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 85 treesize of output 49 [2018-12-08 10:34:04,199 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:04,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 56 [2018-12-08 10:34:04,293 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-08 10:34:04,324 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 10:34:04,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 58 [2018-12-08 10:34:04,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2018-12-08 10:34:04,330 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:04,335 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:04,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 195 [2018-12-08 10:34:04,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 154 treesize of output 138 [2018-12-08 10:34:04,407 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-08 10:34:04,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:04,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 165 [2018-12-08 10:34:04,817 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-12-08 10:34:05,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 101 [2018-12-08 10:34:05,007 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:05,085 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 10:34:05,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 86 [2018-12-08 10:34:05,188 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 77 treesize of output 78 [2018-12-08 10:34:05,189 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:34:05,199 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:34:05,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 108 [2018-12-08 10:34:05,207 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:34:05,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2018-12-08 10:34:05,208 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:05,217 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:05,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 84 [2018-12-08 10:34:05,227 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 75 treesize of output 58 [2018-12-08 10:34:05,227 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:05,235 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:05,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 120 [2018-12-08 10:34:05,265 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 118 treesize of output 82 [2018-12-08 10:34:05,265 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:05,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 118 [2018-12-08 10:34:05,357 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-12-08 10:34:05,423 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 85 treesize of output 88 [2018-12-08 10:34:05,424 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 10:34:05,477 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 10:34:05,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 7 xjuncts. [2018-12-08 10:34:05,561 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 6 variables, input treesize:266, output treesize:409 [2018-12-08 10:34:07,624 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:34:07,626 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 67 treesize of output 61 [2018-12-08 10:34:07,628 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:34:07,628 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 42 treesize of output 28 [2018-12-08 10:34:07,628 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-08 10:34:07,638 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-08 10:34:07,638 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 10:34:07,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 10:34:07,659 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 29 [2018-12-08 10:34:07,663 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-08 10:34:07,663 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-08 10:34:07,671 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-08 10:34:07,671 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:07,675 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 10:34:07,677 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 38 [2018-12-08 10:34:07,678 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-08 10:34:07,679 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:07,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:07,687 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-08 10:34:07,687 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:07,689 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:07,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 10:34:07,700 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:82, output treesize:28 [2018-12-08 10:34:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 10:34:07,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:34:07,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 69 [2018-12-08 10:34:07,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-08 10:34:07,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-08 10:34:07,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4428, Unknown=18, NotChecked=0, Total=4692 [2018-12-08 10:34:07,868 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand 69 states. [2018-12-08 10:34:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:34:13,934 INFO L93 Difference]: Finished difference Result 188 states and 195 transitions. [2018-12-08 10:34:13,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-08 10:34:13,934 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 100 [2018-12-08 10:34:13,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:34:13,935 INFO L225 Difference]: With dead ends: 188 [2018-12-08 10:34:13,935 INFO L226 Difference]: Without dead ends: 188 [2018-12-08 10:34:13,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 67 SyntacticMatches, 16 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2484 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=628, Invalid=9654, Unknown=20, NotChecked=0, Total=10302 [2018-12-08 10:34:13,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-08 10:34:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 169. [2018-12-08 10:34:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-08 10:34:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 176 transitions. [2018-12-08 10:34:13,940 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 176 transitions. Word has length 100 [2018-12-08 10:34:13,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:34:13,940 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 176 transitions. [2018-12-08 10:34:13,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-08 10:34:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 176 transitions. [2018-12-08 10:34:13,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 10:34:13,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:34:13,941 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-08 10:34:13,941 INFO L423 AbstractCegarLoop]: === Iteration 31 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:34:13,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:34:13,942 INFO L82 PathProgramCache]: Analyzing trace with hash 214671507, now seen corresponding path program 2 times [2018-12-08 10:34:13,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:34:13,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:34:13,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:34:13,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:34:13,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:34:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:34:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 10:34:14,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:34:14,884 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:34:14,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 10:34:14,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 10:34:14,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 10:34:14,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:34:15,179 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-08 10:34:15,180 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-08 10:34:15,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:15,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:15,189 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-08 10:34:15,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:42 [2018-12-08 10:34:15,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:15,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2018-12-08 10:34:15,425 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-08 10:34:15,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:15,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:15,436 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-08 10:34:15,437 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-08 10:34:15,437 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-08 10:34:15,440 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-08 10:34:15,444 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-08 10:34:15,444 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:18 [2018-12-08 10:34:23,108 WARN L180 SmtUtils]: Spent 649.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-08 10:34:23,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-12-08 10:34:23,122 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-08 10:34:23,122 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-08 10:34:23,135 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-08 10:34:23,156 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-08 10:34:23,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:104 [2018-12-08 10:34:23,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:23,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-12-08 10:34:23,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:23,298 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-08 10:34:23,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:23,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:23,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:23,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-12-08 10:34:23,322 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-08 10:34:23,322 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:23,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:23,335 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-08 10:34:23,336 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-08 10:34:23,337 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-08 10:34:23,340 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-08 10:34:23,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 10:34:23,349 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:79, output treesize:37 [2018-12-08 10:34:41,155 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-08 10:34:41,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 87 [2018-12-08 10:34:41,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2018-12-08 10:34:41,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:41,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:41,247 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 89 treesize of output 90 [2018-12-08 10:34:41,249 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 90 treesize of output 66 [2018-12-08 10:34:41,249 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:41,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:41,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:41,301 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 73 treesize of output 80 [2018-12-08 10:34:41,302 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 10:34:41,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 10:34:41,390 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-08 10:34:41,390 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:170, output treesize:163 [2018-12-08 10:34:41,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:41,603 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 41 [2018-12-08 10:34:41,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:41,605 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-08 10:34:41,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:41,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:41,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:41,633 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-08 10:34:41,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:41,635 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-08 10:34:41,635 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:41,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:41,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:41,656 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-08 10:34:41,657 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-08 10:34:41,657 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:41,660 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:41,672 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-08 10:34:41,672 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:116, output treesize:67 [2018-12-08 10:34:41,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:41,912 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 42 [2018-12-08 10:34:41,914 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-08 10:34:41,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:41,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:41,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:41,941 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 41 [2018-12-08 10:34:41,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:41,943 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-08 10:34:41,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:41,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:41,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:34:41,967 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-08 10:34:41,969 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-08 10:34:41,969 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:41,972 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:34:41,985 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-08 10:34:41,985 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:116, output treesize:67 [2018-12-08 10:34:42,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:34:42,507 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-08 10:34:42,509 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-08 10:34:42,509 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-08 10:34:42,515 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-08 10:34:42,519 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-08 10:34:42,520 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:55, output treesize:26 [2018-12-08 10:34:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 23 refuted. 2 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 10:34:51,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:34:51,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34] total 61 [2018-12-08 10:34:51,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-08 10:34:51,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-08 10:34:51,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3548, Unknown=33, NotChecked=0, Total=3782 [2018-12-08 10:34:51,667 INFO L87 Difference]: Start difference. First operand 169 states and 176 transitions. Second operand 62 states. [2018-12-08 10:35:27,063 WARN L180 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2018-12-08 10:35:38,932 WARN L180 SmtUtils]: Spent 771.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-08 10:35:47,989 WARN L180 SmtUtils]: Spent 646.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-08 10:35:55,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:35:55,271 INFO L93 Difference]: Finished difference Result 183 states and 191 transitions. [2018-12-08 10:35:55,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-08 10:35:55,271 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 103 [2018-12-08 10:35:55,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:35:55,272 INFO L225 Difference]: With dead ends: 183 [2018-12-08 10:35:55,272 INFO L226 Difference]: Without dead ends: 128 [2018-12-08 10:35:55,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 77 SyntacticMatches, 11 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1649 ImplicationChecksByTransitivity, 47.8s TimeCoverageRelationStatistics Valid=513, Invalid=7641, Unknown=36, NotChecked=0, Total=8190 [2018-12-08 10:35:55,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-08 10:35:55,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2018-12-08 10:35:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-08 10:35:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-12-08 10:35:55,276 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 103 [2018-12-08 10:35:55,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:35:55,276 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-12-08 10:35:55,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-08 10:35:55,276 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-12-08 10:35:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 10:35:55,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:35:55,277 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-08 10:35:55,277 INFO L423 AbstractCegarLoop]: === Iteration 32 === [sll_destroyErr1REQUIRES_VIOLATION, sll_destroyErr0REQUIRES_VIOLATION, sll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, sll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, sll_update_atErr2REQUIRES_VIOLATION, sll_update_atErr3REQUIRES_VIOLATION, sll_update_atErr0REQUIRES_VIOLATION, sll_update_atErr1REQUIRES_VIOLATION, sll_createErr0REQUIRES_VIOLATION, sll_createErr1REQUIRES_VIOLATION, sll_get_data_atErr2REQUIRES_VIOLATION, sll_get_data_atErr3REQUIRES_VIOLATION, sll_get_data_atErr0REQUIRES_VIOLATION, sll_get_data_atErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION]=== [2018-12-08 10:35:55,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:35:55,277 INFO L82 PathProgramCache]: Analyzing trace with hash 376668779, now seen corresponding path program 3 times [2018-12-08 10:35:55,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:35:55,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:35:55,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:35:55,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:35:55,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:35:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:35:55,312 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-08 10:35:55,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:35:55,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:35:55,319 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 10:35:55,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-08 10:35:55,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 10:35:55,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:35:55,439 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-08 10:35:55,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:35:55,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-08 10:35:55,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:35:55,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:35:55,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:35:55,456 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 7 states. [2018-12-08 10:35:55,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:35:55,475 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-12-08 10:35:55,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 10:35:55,475 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-08 10:35:55,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:35:55,475 INFO L225 Difference]: With dead ends: 44 [2018-12-08 10:35:55,476 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 10:35:55,476 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-08 10:35:55,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 10:35:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 10:35:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 10:35:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 10:35:55,476 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2018-12-08 10:35:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:35:55,476 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 10:35:55,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:35:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 10:35:55,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 10:35:55,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 10:35:55 BoogieIcfgContainer [2018-12-08 10:35:55,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 10:35:55,480 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 10:35:55,480 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 10:35:55,480 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 10:35:55,480 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:26:47" (3/4) ... [2018-12-08 10:35:55,483 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 10:35:55,488 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 10:35:55,488 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-08 10:35:55,488 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-12-08 10:35:55,488 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_update_at [2018-12-08 10:35:55,488 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-08 10:35:55,488 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-08 10:35:55,488 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-12-08 10:35:55,488 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_get_data_at [2018-12-08 10:35:55,488 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 10:35:55,488 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-12-08 10:35:55,491 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-08 10:35:55,492 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-08 10:35:55,492 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 10:35:55,522 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_742f1cd9-303f-4c69-8403-a449c61338da/bin-2019/uautomizer/witness.graphml [2018-12-08 10:35:55,522 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 10:35:55,522 INFO L168 Benchmark]: Toolchain (without parser) took 548414.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 950.6 MB in the beginning and 869.5 MB in the end (delta: 81.1 MB). Peak memory consumption was 222.6 MB. Max. memory is 11.5 GB. [2018-12-08 10:35:55,523 INFO L168 Benchmark]: CDTParser took 0.14 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-08 10:35:55,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -138.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-08 10:35:55,523 INFO L168 Benchmark]: Boogie Preprocessor took 32.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 10:35:55,523 INFO L168 Benchmark]: RCFGBuilder took 309.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2018-12-08 10:35:55,523 INFO L168 Benchmark]: TraceAbstraction took 547756.17 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 35.1 MB). Free memory was 1.0 GB in the beginning and 876.1 MB in the end (delta: 161.7 MB). Peak memory consumption was 196.8 MB. Max. memory is 11.5 GB. [2018-12-08 10:35:55,523 INFO L168 Benchmark]: Witness Printer took 42.02 ms. Allocated memory is still 1.2 GB. Free memory was 876.1 MB in the beginning and 869.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-08 10:35:55,524 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.14 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 272.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -138.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 309.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 547756.17 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 35.1 MB). Free memory was 1.0 GB in the beginning and 876.1 MB in the end (delta: 161.7 MB). Peak memory consumption was 196.8 MB. Max. memory is 11.5 GB. * Witness Printer took 42.02 ms. Allocated memory is still 1.2 GB. Free memory was 876.1 MB in the beginning and 869.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 584]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 576]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 602]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 94 locations, 19 error locations. SAFE Result, 547.7s OverallTime, 32 OverallIterations, 3 TraceHistogramMax, 382.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1985 SDtfs, 3409 SDslu, 14605 SDs, 0 SdLazy, 30863 SolverSat, 1089 SolverUnsat, 185 SolverUnknown, 0 SolverNotchecked, 228.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2402 GetRequests, 1228 SyntacticMatches, 96 SemanticMatches, 1078 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 20312 ImplicationChecksByTransitivity, 303.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 348 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 162.8s InterpolantComputationTime, 3439 NumberOfCodeBlocks, 3439 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 3388 ConstructedInterpolants, 353 QuantifiedInterpolants, 4068852 SizeOfPredicates, 288 NumberOfNonLiveVariables, 6800 ConjunctsInSsa, 1092 ConjunctsInUnsatCore, 51 InterpolantComputations, 17 PerfectInterpolantSequences, 1041/1498 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...